A blueprint for constructing peer-to-peer systems robust to dynamic worst-case joins and leaves

IEEE International Workshop on Quality of Service, IWQoS

Volumn , Issue , 2006, Pages 12-19

  Kuhn, Fabian ^a   Schmid, Stefan ^b   Smit, Joest ^b   Wattenhofer, Roger ^b  

^a MICROSOFT RESEARCH   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAULT TOLERANCE; RANDOM PROCESSES; ROBUST CONTROL; TELECOMMUNICATION NETWORKS;

ALGORITHMIC RESEARCH; PEER-TO-PEER SYSTEMS; RANDOM FAULTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34250645222     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQOS.2006.250446     Document Type: Conference Paper

References (20)

1. I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, and E. Pavlov. A Generic Scheine for Building Overlay Networks in Adversarial Scenarios. In Proc. 17th Jnt. Symp. on Parallel and Distributed Processing (IPDPS), 2003.
2. I. Abraham, D. Malkhi, and O. Dobzinski. LAND: Stretch (1 + ε) Locality-Aware Networks for DHTs. In Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 550-559, 2004.
3. S. B. Akers and B. Krishnamurthy. A Group-Theoretic Model for Symmetric Interconnection Networks. IEEE Transactions on Computing, 38(4):555-566, 1989.
4. F. Annexstein, M. Baumslag, and A. L. Rosenberg. Group Action Graphs and Parallel Architectures. SIAM J. Comput., 19(3):544-569, 1990.
5. J. Aspnes and G. Shah. Skip Graphs. In Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 384-393, 2003.
6. B. Awerbuch and C. Scheideler. The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments. In Proc. 15th Am. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 318-327, 2004.
7. H. Dweighter (a.k.a. J. E. Goodman). American Mathematical Monthly, 82, 1975.
8. A. Fiat and J. Saia. Censorship Resistant Peer-to-Peer Content Address-able Networks. In Proc. 13th Symp. on Discrete Algorithms (SODA), 2002.
9. W. Gates and C. Papadimitriou. Bounds for Sorting by Prefix Reversal. Discrete Math., 27:47-57, 1979.
10. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In Proc. 4th USENIX Symp. on Internet Technologies and Systems (USITS), 2003.
11. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. OceanStore: An Architecture for Global-scale Persistent Storage. In Proc. of ACM ASPLOS, November 2000.
12. F. Kuhn, S. Schmid, and R. Wattenhofer. A Self-Repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. In Proc. 4th Int. Workshop on Peer-to-Peer Systems (IPTPS), 2005.
13. X. Li, J. Misra, and C. G. Plaxton. Active and Concurrent Topology Maintenance. In Proc. 18th Ann. Conference on Distributed Computing (DISC), 2004.
14. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proc. 21st Ann. Symp. on Principles of Distributed Computing (PODC), pages 183-192, 2002.
15. D. Peleg and E. Upfal. The Token Distribution Problem. SIAM Journal on Computing, 18(2):229-243, 1989.
16. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In Proc. 9th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 311-320, 1997.
17. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content Addressable Network. In Proc. of ACM SIGCOMM 2001, 2001.
18. J. Saia, A. Fiat, S. Gribble, A. Karlin, and S. Saroiu. Dynamically Fault-Tolerant Content Addressable Networks. In Proc. 1st Int. Workshop on Peer-to-Peer Systems (IPTPS), 2002.
19. B. A. Shirazi, K. M. Kavi, and A. R. Hurson. Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE Computer Science Press, 1995.
20. 1. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proc. ACM SIGCOMM Conference, 2001.