Handling network partitions and mergers in structured overlay networks

Proceedings - P2P - 7th IEEE International Conference on Peer-to-Peer Computing

Volumn , Issue , 2007, Pages 132-139

  Shafaat, Tallat M ^a   Ghodsi, Ali ^b   Haridi, Seif ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED SYSTEMS; DYNAMIC CONDITIONS; LARGE-SCALE SYSTEMS; MESSAGE COMPLEXITIES; NETWORK PARTITIONS; NODE FAILURES; PEER-TO-PEER SYSTEMS; SELF MANAGEMENTS; SIDE EFFECTS; STRUCTURED OVERLAY NETWORKS; STRUCTURED OVERLAYS; TIME COMPLEXITIES; UNDERLYING NETWORKS;

CLIENT SERVER COMPUTER SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; MERGERS AND ACQUISITIONS; MERGING; METROPOLITAN AREA NETWORKS; QUALITY ASSURANCE; RELIABILITY; TELECOMMUNICATION NETWORKS;

NETWORK MANAGEMENT;

EID: 47949085247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2007.4343473     Document Type: Conference Paper

References (32)

1. 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.
2. Ken Birman. Gossip Algorithms and Emergent Shape. Invited talk at the Workshop on Gossip-based Computer Networking at the Lorentz Center, Leiden, Netherlands, December 2006.
3. E. Brewer. Towards Robust Distributed Systems, invited talk at the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC'00), 2000.
4. 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.
5. S. B. Davidson, H. Garcia-Molina, and D. Skeen. Consistency in a partitioned network: a survey. ACM Computing Surveys, 17(3):341-370, 1985.
6. 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 (PODC87), pages 1-12, New York, NY, USA, 1987. ACM Press.
7. 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.
8. A. J. Ganesh, A.-M. Kermarrec, and L Massoulié. SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication. In Proceedings of the 3rd International Workshop on Networked Group Communication (NGC'01), volume 2233 of Lecture Notes in Computer Science (LNCS), pages 44-55, London, UK, 2001. Springer-Verlag.
9. A. Ghodsi. Distributed k-ary System: Algorithms for Distributed Hash Tables. PhD dissertation, KTH - Royal Institute of Technology, Stockholm, Sweden, December 2006.
10. 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.
11. S. Gilbert and N. A. Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM Special Interest Group on Algorithms and Computation Theory News, 33(2):51-59, 2002.
12. 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.
13. N. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS'03), Seattle, WA, USA, March 2003. USENIX.
14. 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.
15. M. Jelasity, W. Kowalczyk, and M. van Steen. Newscast Computing. Technical Report IR-CS-006, Vrije Universiteit, November 2003.
16. M. F. Kaashoek and D. R. Karger. Koorde: A Simple Degree-optimal Distributed Hash Table. In Proceedings of the 2nd Interational Workshop on Peer-to-Peer Systems (IPTPS'03), volume 2735 of Lecture Notes in Computer Science (LNCS), pages 98-107, Berkeley, CA, USA, 2003. Springer-Verlag.
17. 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.
18. 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.
19. X. Li, J. Misra, and C. G. Plaxton. Brief Announcement: Concurrent Maintenance of Rings. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC'04), page 376, New York, NY, USA, 2004. ACM Press.
20. 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.
21. N. A. Lynch, D. Malkhi, and D. Ratajczak. Atomic Data Access in Distributed Hash Tables. In Proceedings of the First Intentional Workshop on Peer-to-Peer Systems (IPTPS'02), Lecture Notes in Computer Science (LNCS), pages 295-305, London, UK, 2002. Springer-Verlag.
22. R. Mahajan, M. Castro, and A. Rowstron. Controlling the Cost of Reliability in Peer-to-Peer Overlays. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), volume 2735 of Lecture Notes in Computer Science (LNCS), pages 21-32, Berkeley, CA, USA, 2003. Springer-Verlag.
23. 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 (PODC02), New York, NY, USA, 2002. ACM Press.
24. 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.
25. 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.
26. 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.
27. A. Shaker and D. S. Reeves. Self-Stabilizing Structured Ring Topology P2P Systems. In Proceedings of the 5th International Conference on Peer-To-Peer Computing (P2P'05), pages 39-46. IEEE Computer Society, August 2005.
28. SicsSim, 2007. http://dks.sics.se/p2p07partition/.
29. 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.
30. D. B. Terry, M. Theimer, K. Petersen, A. J. Demers, M. Spreitzer, and C. Hauser. Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. In Proceedings of the 15th ACM Symposium on Operating Systems Principles (SOSP'95), pages 172-183. ACM Press, December 1995.
31. 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.
32. C. A. Waldspurger and W E. Weihl. Lottery Scheduling: Flexible Proportional-Share Resource Management. In Proceedings of the First Symposium on Operating Systems Design and Implementation (OSDI'94), pages 1-11. USENIX, November 1994.