Handling Network Partitions and Mergers in Structured Overlay Networks

@article{Shafaat2007HandlingNP,
  title={Handling Network Partitions and Mergers in Structured Overlay Networks},
  author={Tallat M. Shafaat and Ali Ghodsi and Seif Haridi},
  journal={Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)},
  year={2007},
  pages={132-139}
}
Structured overlay networks form a major class of peer- to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. These systems have mainly been studied… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Distributed k-ary System: Algorithms for Distributed Hash Tables

  • A. Ghodsi
  • PhD dissertation, KTH—Royal Institute of…
  • 2006
Highly Influential
4 Excerpts

Gossip Algorithms and Emergent Shape. Invited talk at the Workshop on Gossip-based Computer Networking at the Lorentz

  • Ken Birman
  • 2006
3 Excerpts

Similar Papers

Loading similar papers…