ACM Home Page
Please provide us with feedback. Feedback
ARRG: real-world gossiping
Full text PdfPdf (262 KB)
Source
High Performance Distributed Computing archive
Proceedings of the 16th international symposium on High performance distributed computing table of contents
Monterey, California, USA
SESSION: Communication table of contents
Pages: 147 - 158  
Year of Publication: 2007
ISBN:978-1-59593-673-8
Authors
Niels Drost  Vrije Universiteit
Elth Ogston  Vrije Universiteit
Rob V. van Nieuwpoort  Vrije Universiteit
Henri E. Bal  Vrije Universiteit
Sponsors
ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 56,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1272366.1272386
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
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.
5
 
6
P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulie. From epidemics to distributed computing. IEEE Computer, 37(5):60--67, 2004.
 
7
 
8
M. Jelasity, W. Kowalczyk, and M. van Steen. Newscast computing. Technical report, Vrije Universiteit Amsterdam, Department of Computer Science, 2003.
 
9
 
10
11
12
 
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
 
15
 
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


Collaborative Colleagues:
Niels Drost: colleagues
Elth Ogston: colleagues
Rob V. van Nieuwpoort: colleagues
Henri E. Bal: colleagues