Exploiting the synergy between gossiping and structured overlays

Operating Systems Review (ACM)

Volumn 41, Issue 5, 2007, Pages 61-66

  Ghodsi, Ali ^a   Haridi, Seif ^b   Weatherspoon, Hakim ^c  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c School of Operations Research and Information Engineering   (United States)

Author keywords

Distributed hash tables; Gossip based algorithms; Structured overlay networks

Indexed keywords

BROADCAST ALGORITHM; DISTRIBUTED HASH TABLE; FAULT-TOLERANT; GOSSIP-BASED ALGORITHMS; GRAPH-THEORETIC; LARGE-SCALE DISTRIBUTED SYSTEM; LOAD-BALANCING; MEMBERSHIP MANAGEMENT; NETWORK SIZE; POSITION PAPERS; SELF-MANAGING; SMALL WORLDS; STRUCTURED OVERLAY NETWORK; STRUCTURED OVERLAYS; THREE PROBLEMS;

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; MERCURY (METAL); OVERLAY NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 64849092209     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1317379.1317389     Document Type: Conference Paper

References (42)

1. K. Aberer, P. Cudré-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt. P-Grid: a self-organizing structured P2P system. SIGMOD Record, 32(3):29-33, 2003.
2. K. Aberer, A. Datta, and M. Hauswirth. Efficient, self-contained handling of identity in Peer-to-Peer systems. IEEE Transactions on Knowledge and Data Engineering (TKDE), 16(7):858-869, 2004.
3. L. O. Alima, A. Ghodsi, P. Brand, and S. Haridi. Multicast in DKS(N, k, f) Overlay Networks. In The 7th International Conference on Principles of Distributed Systems (OPODIS'03), volume 3144 of Lecture Notes in Computer Science (LNCS), pages 83-95. Springer-Verlag, 2004.
4. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting Scalable Multi-Attribute Range Queries. In Proceedings of the ACM SIGCOMM 2004 Symposium on Communication, Architecture, and Protocols, pages 353-366, Portland, OR, USA, March 2004. ACM Press.
5. K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal Multicast. ACM Transactions on Computer Systems (TOCS), 17(2):41-88, 1999.
6. M. Castro, M. Costa, and A. Rowstron. Should we build Gnutella on a structured overlay? SIGCOMM Computing Communication Review, 34(1):131-136, 2004.
7. M. Castro, M. Costa, and A. Rowstron. Debunking Some Myths About Structured and Unstructured Overlays. In Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI'05), Boston, MA, USA, May 2005. USENIX.
8. A. Datta and K. Aberer. The Challenges of Merging Two Similar Structured Overlays: A Tale of Two Networks. In Proceedings of the First International Workshop on Self-Organizing Systems (IWSOS'06), volume 4124 of Lecture Notes in Computer Science (LNCS), pages 7-22. Springer-Verlag, 2006.
9. 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 Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (PODC'87), pages 1-12, New York, NY, USA, 1987. ACM Press.
10. E. W. Dijkstra. Self Stabilization in spite of Distributed Control. Communications of the ACM, 17(11):643-644, 1974.
11. S. El-Ansary, L. O. Alima, P. Brand, and S. Haridi. Efficient Broadcast in Structured P2P Netwoks. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), volume 2735 of Lecture Notes in Computer Science (LNCS), pages 304-314, Berkeley, CA, USA, 2003. Springer-Verlag.
12. P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié. From epidemics to distributed computing. IEEE Computer, 37:60-67, May 2004.
13. A. Ganesh, A.-M. Kermarrec, and L. Massoulié. Peer-to-Peer Membership Management for Gossip-based Protocols. IEEE Transactions on Computers (TOC), 52(2):139-149, 2003.
14. A. Ghodsi. Distributed k-ary System: Algorithms for Distributed Hash Tables. PhD dissertation, KTH - Royal Institute of Technology, Stockholm, Sweden, December 2006.
15. A. Ghodsi, L. O. Alima, S. El-Ansary, P. Brand, and S. Haridi. Self-Correcting Broadcast in Distributed Hash Tables. In Proceedings of the 15th International Conference, Parallel and Distributed Computing and Systems, Marina del Rey, CA, USA, November 2003.
16. A. Ghodsi, L. O. Alima, and S. Haridi. Symmetric Replication for Structured Peer-to-Peer Systems . In Proceedings of the 3rd International VLDB Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P'05), volume 4125 of Lecture Notes in Computer Science (LNCS), pages 74-85. Springer-Verlag, 2005.
17. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of DHT routing geometry on resilience and proximity. In Proceedings of the ACM SIGCOMM 2003 Symposium on Communication, Architecture, and Protocols, pages 381-394, New York, NY, USA, 2003. ACM Press.
18. I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse. Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), volume 2735 of Lecture Notes in Computer Science (LNCS), pages 160-169, Berkeley, CA, USA, 2003. Springer-Verlag.
19. M. Jelasity and Ö. Babaoglu. T-man: Gossip-based overlay topology management. In Proceedings of 3rd Workshop on Engineering Self-Organising Systems (EOSA'05), volume 3910 of Lecture Notes in Computer Science (LNCS), pages 1-15. Springer-Verlag, 2005.
20. M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware (MIDDLEWARE'04), volume 3231 of Lecture Notes in Computer Science (LNCS), pages 79-98, New York, NY, USA, 2004. Springer-Verlag.
21. M. Jelasity and A. Montresor. Epidemic-Style Proactive Aggregation in Large Overlay Networks. In Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04), pages 102-109, Tokyo, Japan, March 2004. IEEE Computer Society.
22. M. Jelasity, A. Montresor, and Ö. Babaoglu. Gossip-based Aggregation in Large Dynamic Networks. ACM Transactions on Computer Systems (TOCS), 23(3), August 2005.
23. J. M. Kleinberg. The small-world phenomenon: an algorithm perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC'00), pages 163-170, Portland, OR, USA, 2000. ACM Press.
24. B. Leong and J. Li. Achieving One-Hop DHT Lookup and Strong Stabilization by Passing Tokens. In 12th International Conference on Networks (ICON'04), Singapore, November 2004. IEEE Computer Society.
25. B. Leong, B. Liskov, and E. Demaine. EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. In 12th International Conference on Networks (ICON'04), Singapore, November 2004. IEEE Computer Society.
26. J. Li, J. Stribling, R. Morris, and M. F. Kaashoek. Bandwidth-efficient management of DHT routing tables. In Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI'05), Boston, MA, USA, May 2005. USENIX.
27. D. Liben-Nowell, H. Balakrishnan, and D. R. Karger. Observations on the Dynamic Evolution of Peer-to-Peer Networks. In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'02), volume 2429 of Lecture Notes in Computer Science (LNCS). Springer-Verlag, 2002.
28. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC'02), New York, NY, USA, 2002. ACM Press.
29. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed Hashing in a Small World. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS'03), Seattle, WA, USA, March 2003. USENIX.
30. A. Montresor, M. Jelasity, and Ö. Babaoglu. Chord on Demand. In Proceedings of the 5th International Conference on Peer-To-Peer Computing (P2P'05). IEEE Computer Society, August 2005.
31. P2PSIP. http://www.p2psip.org, 2006.
32. Host Identity Payload. http://www.ietf.org/html.charters/hip-charter. html, 2006.
33. J.A. Pouwelse, P. Garbacki, J. Wangand A. Bakker, J. Yang, A. Iosup, D. Epema, M.Reinders, M. van Steen, and H. J. Sips. Tribler: A social-based based peer to peer system. In Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS'06), February 2006.
34. S. Ratnasamy. A Scalable Content-Addressable Network. PhD thesis, University of California at Berkeley, Berkeley, CA, USA, 2002.
35. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling Churn in a DHT. In Proceedings of the 2004 USENIX Annual Technical Conference (USENIX'04), Boston, MA, USA, June 2004. USENIX.
36. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 2nd ACM/IFIP International Conference on Middleware (MIDDLEWARE'01), volume 2218 of Lecture Notes in Computer Science (LNCS), pages 329-350, Heidelberg, Germany, November 2001. Springer-Verlag.
37. T. M. Shafaat, A. Ghodsi, and S. Haridi. Handling Network Partitions and Mergers in Structured Overlay Networks. In Proceedings of the 7th International Conference on Peer-To-Peer Computing (P2P'07), September 2007.
38. I. Stoica, D. Adkins, S. Ratnasamy, S. Shenker, S. Surana, and S. Zhuang. Internet Indirection Infrastructure. In Proceedings of the First Interational Workshop on Peer-to-Peer Systems (IPTPS'02), Lecture Notes in Computer Science (LNCS), pages 191-202, London, UK, 2002. Springer-Verlag.
39. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (TON), 11(1):17-32, 2003.
40. R. van Renesse, Y. Minsky, and M. Hayden. A Gossip-Style Failure Detection Service. In Proceedings of the IFIP/ACM International Conference on MIDDLEWARE (MIDDLEWARE'98), Lecture Notes in Computer Science (LNCS). Springer-Verlag, 1998.
41. S. Voulgaris, D. Gavidia, and M. van Steen. Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management, 13(2), 2005.
42. S. Voulgaris and M. van Steen. Epidemic-Style Management of Semantic Overlays for Content-Based Searching. In Proceedings of the 11th European Conference on Parallel Computing (EUROPAR'05). Springer-Verlag, 2005.