Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/1822/51970 |
Resumo: | Flow-Updating (FU) is a fault-tolerant technique that has proved to be efficient in practice for the distributed computation of aggregate functions in communication networks where individual processors do not have access to global information. Previous distributed aggregation protocols, based on repeated sharing of input values (or mass) among processors, sometimes called Mass-Distribution (MD) protocols, are not resilient to communication failures (or message loss) because such failures yield a loss of mass. In this paper, we present a protocol which we call Mass-Distribution with Flow-Updating (MDFU). We obtain MDFU by applying FU techniques to classic MD. We analyze the convergence time of MDFU showing that stochastic message loss produces low overhead. This is the first convergence proof of an FU-based algorithm. We evaluate MDFU experimentally, comparing it with previous MD and FU protocols, and verifying the behavior predicted by the analysis. Finally, given that MDFU incurs a fixed deviation proportional to the message-loss rate, we adjust the accuracy of MDFU heuristically in a new protocol called MDFU with Linear Prediction (MDFU-LP). The evaluation shows that both MDFU and MDFU-LP behave very well in practice, even under high rates of message loss and even changing the input values dynamically. |
id |
RCAP_8189ac1139de323c60412699f65b2557 |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/51970 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Fault-tolerant aggregation: Flow-Updating meets Mass-DistributionAggregate computationDistributed computingRadio networksCommunication networksCiências Naturais::Ciências da Computação e da InformaçãoScience & TechnologyFlow-Updating (FU) is a fault-tolerant technique that has proved to be efficient in practice for the distributed computation of aggregate functions in communication networks where individual processors do not have access to global information. Previous distributed aggregation protocols, based on repeated sharing of input values (or mass) among processors, sometimes called Mass-Distribution (MD) protocols, are not resilient to communication failures (or message loss) because such failures yield a loss of mass. In this paper, we present a protocol which we call Mass-Distribution with Flow-Updating (MDFU). We obtain MDFU by applying FU techniques to classic MD. We analyze the convergence time of MDFU showing that stochastic message loss produces low overhead. This is the first convergence proof of an FU-based algorithm. We evaluate MDFU experimentally, comparing it with previous MD and FU protocols, and verifying the behavior predicted by the analysis. Finally, given that MDFU incurs a fixed deviation proportional to the message-loss rate, we adjust the accuracy of MDFU heuristically in a new protocol called MDFU with Linear Prediction (MDFU-LP). The evaluation shows that both MDFU and MDFU-LP behave very well in practice, even under high rates of message loss and even changing the input values dynamically.- A preliminary version of this work appeared in [2]. This work was partially supported by the National Science Foundation (CNS-1408782, IIS-1247750); the National Institutes of Health (CA198952-01); EMC, Inc.; Pace University Seidenberg School of CSIS; and by Project "Coral - Sustainable Ocean Exploitation: Tools and Sensors/NORTE-01-0145-FEDER-000036" financed by the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement, and through the European Regional Development Fund (ERDF).info:eu-repo/semantics/publishedVersionSpringer VerlagUniversidade do MinhoAlmeida, Paulo SérgioBaquero, CarlosFarach-Colton, MartinJesus, PauloMosteiro, Miguel A.2017-08-012017-08-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/51970engAlmeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P., & Mosteiro, M. A. (2017). Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution. Distributed Computing, 30(4), 281-2910178-277010.1007/s00446-016-0288-5https://link.springer.com/article/10.1007/s00446-016-0288-5info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T12:43:32Zoai:repositorium.sdum.uminho.pt:1822/51970Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:41:02.336719Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution |
title |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution |
spellingShingle |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution Almeida, Paulo Sérgio Aggregate computation Distributed computing Radio networks Communication networks Ciências Naturais::Ciências da Computação e da Informação Science & Technology |
title_short |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution |
title_full |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution |
title_fullStr |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution |
title_full_unstemmed |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution |
title_sort |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution |
author |
Almeida, Paulo Sérgio |
author_facet |
Almeida, Paulo Sérgio Baquero, Carlos Farach-Colton, Martin Jesus, Paulo Mosteiro, Miguel A. |
author_role |
author |
author2 |
Baquero, Carlos Farach-Colton, Martin Jesus, Paulo Mosteiro, Miguel A. |
author2_role |
author author author author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Almeida, Paulo Sérgio Baquero, Carlos Farach-Colton, Martin Jesus, Paulo Mosteiro, Miguel A. |
dc.subject.por.fl_str_mv |
Aggregate computation Distributed computing Radio networks Communication networks Ciências Naturais::Ciências da Computação e da Informação Science & Technology |
topic |
Aggregate computation Distributed computing Radio networks Communication networks Ciências Naturais::Ciências da Computação e da Informação Science & Technology |
description |
Flow-Updating (FU) is a fault-tolerant technique that has proved to be efficient in practice for the distributed computation of aggregate functions in communication networks where individual processors do not have access to global information. Previous distributed aggregation protocols, based on repeated sharing of input values (or mass) among processors, sometimes called Mass-Distribution (MD) protocols, are not resilient to communication failures (or message loss) because such failures yield a loss of mass. In this paper, we present a protocol which we call Mass-Distribution with Flow-Updating (MDFU). We obtain MDFU by applying FU techniques to classic MD. We analyze the convergence time of MDFU showing that stochastic message loss produces low overhead. This is the first convergence proof of an FU-based algorithm. We evaluate MDFU experimentally, comparing it with previous MD and FU protocols, and verifying the behavior predicted by the analysis. Finally, given that MDFU incurs a fixed deviation proportional to the message-loss rate, we adjust the accuracy of MDFU heuristically in a new protocol called MDFU with Linear Prediction (MDFU-LP). The evaluation shows that both MDFU and MDFU-LP behave very well in practice, even under high rates of message loss and even changing the input values dynamically. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-08-01 2017-08-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/51970 |
url |
http://hdl.handle.net/1822/51970 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Almeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P., & Mosteiro, M. A. (2017). Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution. Distributed Computing, 30(4), 281-291 0178-2770 10.1007/s00446-016-0288-5 https://link.springer.com/article/10.1007/s00446-016-0288-5 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Springer Verlag |
publisher.none.fl_str_mv |
Springer Verlag |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799132957846274048 |