Article

ARRG: real-world gossiping

Authors:

Rob V. van Nieuwpoort,

Henri E. BalAuthors Info & Claims

HPDC '07: Proceedings of the 16th international symposium on High performance distributed computing

Pages 147 - 158

https://doi.org/10.1145/1272366.1272386

Published: 25 June 2007 Publication History

Abstract

Gossiping is an effective way of disseminating information in large dynamic systems. Until now, most gossiping algorithms have been designed and evaluated using simulations. However, these algorithms often cannot cope with several real-world problems that tend to be overlooked in simulations, such as node failures, message loss, non-atomicity ofinformation exchange, and firewalls.

We explore the problems in designing and applying gossiping algorithms in real systems. Next to identifying the most prominent real-world problems and their current solutions, we introduce Actualized Robust Random Gossiping (ARRG), an algorithm specifically designed to take all of these real-world problems into account simultaneously. To address network connectivity problems such as firewalls we introduce a novel technique, the Fallback Cache. This cache can be applied to existing gossiping algorithms to improve their resilience against connectivity problems.

We introduce a new metric, Perceived Network Size to measure a gossiping algorithm's effectiveness. In contrast to existing metrics, our new metric does not require global knowledge. Evaluation of ARRG and the Fallback Cache in a number of realistic scenarios shows that the proposed techniques significantly improve the performance of gossiping algorithms in networks with limited connectivity. Even in pathological situations, with 50% message loss and with 80% of the nodes behind a NAT, ARRG continues to work well. Existing algorithms fail in these circumstances.

References

[1]

A. Allavena, A. Demers, and J. E. Hopcroft. Correctness of a gossip based membership protocol. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pages 292--301, New York, NY, USA, 2005. ACM Press.

Digital Library

[2]

K. P. Birman, R. v. Renesse, and W. Vogels. Navigating in the Storm: Using Astrolabe to Adaptively Configure Web Services and Their Clients. Cluster Computing, 9(2):127--139, 2006.

Digital Library

[3]

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In PODC '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pages 1--12, New York, NY, USA, 1987. ACM Press.

Digital Library

[4]

N. Drost, R. V. van NieuwPoort, and H. E. Bal. Simple locality-aware co-allocation in peer-to-peer supercomputing. In Proceedings of GP2P: Sixth International Workshop on Global and Peer-2-Peer Computing, Singapore, may 2006.

Digital Library

[5]

P. T. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec. Lightweight probabilistic broadcast. ACM Trans. Comput. Syst., 21(4):341--374, 2003.

Digital Library

[6]

P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulie. From epidemics to distributed computing. IEEE Computer, 37(5):60--67, 2004.

Digital Library

[7]

A. J. Ganesh, A.-M. Kermarrec, and L. Massoulie. Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput., 52(2):139--149, 2003.

Digital Library

[8]

M. Jelasity, W. Kowalczyk, and M. van Steen. Newscast computing. Technical report, Vrije Universiteit Amsterdam, Department of Computer Science, 2003.

[9]

M.-J. Lin and K. Marzullo. Directional gossip: Gossip in a wide area network. In EDCC-3: Proceedings of the Third European Dependable Computing Conference on Dependable Computing, pages 364--379, London, UK, 1999. Springer-Verlag.

Digital Library

[10]

M.-J. Lin, K. Marzullo, and S. Masini. Gossip versus deterministically constrained flooding on small networks. In DISC '00: Proceedings of the 14th International Conference on Distributed Computing, pages 253--267, London, UK, 2000. Springer-Verlag.

Digital Library

[11]

J. Maassen and H. E. Bal. Solving the Connectivity Problems in Grid Computing. In Proceedings of The 16th IEEE International Symposium on High-Performance Distributed Computing (HPDC), Monterey, CA, USA, June 2007. Accepted for Publication.

Digital Library

[12]

R. v. Renesse, K. P. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst., 21(2):164--206, 2003.

Digital Library

[13]

R. v. Renesse, Y. Minsky, and M. Hayden. A gossip-based failure detection service. In Middleware'98, IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing, pages 55--70, England, September 1998.

[14]

A. Stavrou, D. Rubenstein, and S. Sahu. A lightweight, robust p2p system to handle flash crowds. In ICNP '02: Proceedings of the 10th IEEE International Conference on Network Protocols, pages 226--235, Washington, DC, USA, 2002. IEEE Computer Society.

Digital Library

[15]

G. Tan, S. A. Jarvis, X. Chen, and D. P. Spooner. Performance analysis and improvement of overlay construction for peer-to-peer live streaming. Simulation, 82(2):93--106, 2006.

Digital Library

[16]

S. Voulgaris. Epidemic-Based Self-Organization in Peer-to-Peer Systems. PhD thesis, Vrije University Amsterdam, 2006.

[17]

S. Voulgaris, D. Gavidia, and M. Steen. Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management, 13(2):197--217, June 2005.

[18]

S. Voulgaris, M. Jelasity, and M. van Steen. A robust and scalable peer-to-peer gossiping protocol. In Proceedings of the 2nd International Workshop on Agents and Peer-to-Peer Computing (AP2PC03), Melbourne, Australia, July 2003.

[19]

B. Yang and H. Garcia-Molina. Improving search in peer-to-peer networks. In Proceedings of the International Conference on Distributed Computing Systems, pages 5--14, Vienna, Austria, July 2002.

Digital Library

Cited By

Ghosh RGhosh H(2023)Gossip ProtocolsDistributed Systems10.1002/9781119825968.ch10(253-282)Online publication date: 10-Feb-2023
https://doi.org/10.1002/9781119825968.ch10
Erdil D(2017)Self-organized dynamic provisioning for big dataCluster Computing10.1007/s10586-017-0822-720:3(2749-2762)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s10586-017-0822-7
Kavalionak HPayberah AMontresor ADowling JOssowski S(2016)NATCloudProceedings of the 31st Annual ACM Symposium on Applied Computing10.1145/2851613.2851640(508-513)Online publication date: 4-Apr-2016
https://dl.acm.org/doi/10.1145/2851613.2851640
Show More Cited By

Index Terms

ARRG: real-world gossiping

Recommendations

Churn: A Key Effect on Real-World P2P Software
ICPP '13: Proceedings of the 2013 42nd International Conference on Parallel Processing

Churn refers to a large number of arriving and departing participants within a short time in peer-to-peer (P2P) networks. This paper studies the impact of churn on real-world unstructured P2P networks. To this end, we need collecting snapshots of P2P ...
PolderCast: fast, robust, and scalable architecture for P2P topic-based pub/sub
Middleware '12: Proceedings of the 13th International Middleware Conference

We propose PolderCast, a P2P topic-based Pub/Sub system that is (a) fault-tolerant and robust, (b) scalable w.r.t the number of nodes interested in a topic and number of topics that nodes are interested in, and (c) fast in terms of dissemination latency ...
Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination

We consider buffer management in support of large-scale gossip-based peer-to-peer data dissemination protocols. Coupled with an efficient buffering mechanism, system-wide buffer usage can be optimized while providing reliability and scalability in such ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

HPDC '07: Proceedings of the 16th international symposium on High performance distributed computing

June 2007

256 pages

ISBN:9781595936738

DOI:10.1145/1272366

General Chair:
Carl Kesselman
USC/ISI
,
Program Chairs:
Jack Dongarra
University of Tennessee
,
David Walker
University of Cardiff

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

HPDC07

Sponsor:

HPDC07: International Symposium on High Performance Distributed Computing

June 25 - 29, 2007

California, Monterey, USA

Acceptance Rates

Overall Acceptance Rate 166 of 966 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
313
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ghosh RGhosh H(2023)Gossip ProtocolsDistributed Systems10.1002/9781119825968.ch10(253-282)Online publication date: 10-Feb-2023
https://doi.org/10.1002/9781119825968.ch10
Erdil D(2017)Self-organized dynamic provisioning for big dataCluster Computing10.1007/s10586-017-0822-720:3(2749-2762)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s10586-017-0822-7
Kavalionak HPayberah AMontresor ADowling JOssowski S(2016)NATCloudProceedings of the 31st Annual ACM Symposium on Applied Computing10.1145/2851613.2851640(508-513)Online publication date: 4-Apr-2016
https://dl.acm.org/doi/10.1145/2851613.2851640
Dowling JPayberah A(2012)Shuffling with a CroupierProceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems10.1109/ICDCS.2012.19(102-111)Online publication date: 18-Jun-2012
https://dl.acm.org/doi/10.1109/ICDCS.2012.19
(2012)Notice to IEEE Xplore subscribers2012 2nd International Conference on Applied Robotics for the Power Industry (CARPI)10.1109/CARPI.2012.6450177Online publication date: 2012
https://doi.org/10.1109/CARPI.2012.6450177
Vera-Del-Campo JPegueroles JHernáNdez-Serrano JSoriano M(2012)Design of a P2P content recommendation system using affinity networksComputer Communications10.1016/j.comcom.2012.07.01836:1(90-104)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1016/j.comcom.2012.07.018
Ogston EBrazier FSonenberg LStone PTumer KYolum P(2011)AgentScopeThe 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 110.5555/2030470.2030528(389-396)Online publication date: 2-May-2011
https://dl.acm.org/doi/10.5555/2030470.2030528
Niazi SDowling J(2011)UsurpProceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems10.5555/2022090.2022093(29-42)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.5555/2022090.2022093
Payberah ADowling JHaridi S(2011)GozarProceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems10.5555/2022090.2022091(1-14)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.5555/2022090.2022091
Bakhshi RGavidia DFokkink Wvan Steen M(2011)A Modeling Framework for Gossip-based Information SpreadProceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems10.1109/QEST.2011.39(245-254)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.1109/QEST.2011.39
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents