HyperTree for self-stabilizing peer-to-peer systems

Proceedings - Third IEEE International Symposium on Network Computing and Applications, NCA 2004

Volumn , Issue , 2004, Pages 25-32

  Dolev, Shlomi ^a   Kat, Ronen I ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DNS; HYPERTREE STRUCTURE; PEER-TO-PEER SYSTEMS; VIRTUAL COMMUNICATION NETWORKS;

ALGORITHMS; CONDITION MONITORING; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; STABILIZATION; SYNCHRONIZATION; TREES (MATHEMATICS); VIRTUAL REALITY;

INTERNET;

EID: 18844461675     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCA.2004.1347757     Document Type: Conference Paper

References (24)

1. Gnutella, http://gnutella.wego.com.
2. I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, and E. Pavlov. A generic scheme for building overlay networks in adversarial scenarios. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS'03), page 40.2, Nice, France, Apr. 2003.
3. R. R. C. G. Plaxton and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of ACM Symposium on Parallel Algorithms and Architectures, pages 311-320, Newport, Rhode Island, USA, June 1997.
4. D. D. Clark. The design philosophy of the darpa internet protocols. In Proceedings of ACM SIGCOMM, pages 106-114, Stanford, CA, USA, Aug. 1988.
5. M. N. D. Malkhi and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, pages 233-242, Monterey, CA, USA, July 2002.
6. E. W. Dijkstra. Connection management without retaining information. Communications of the ACM, 17(11):643-644, November 1974.
7. S. Dolev. Self-stabilization. MIT press, 2000.
8. S. Dolev and R. I. Kat. Self-stabilizing distributed file systems. In Proceedings of the International Workshop on Self-Repairing and Self-Configurable Distributed Systems, pages 384-389, Osaka, Japan, Oct. 2002.
9. S. Dolev and E. Schiller. Communication adaptive self-stabilizing group membership service. IEEE Transactions on Parallel and Distributed Systems, 14(7):709-720, July 2003.
10. S. Dolev and J. L. Welch. Crash resilient communication in dynamic networks. IEEE Transactions on Computers, 46(1): 14-26, January 1997.
11. P. Druschel and A. I. T. Rowstron. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, Heidelberg, Germany, Nov. 2001.
12. P. D. F. Dabek, B. Zhao and I. Stoica. Towards a common api for structured peer-to-peer overlays. In Proceedings of IPTPS'03, pages 33-44, Berkeley, CA, USA, Feb. 2003.
13. S. D. H. Attiya and J. L. Welch. Connection management without retaining information. Information and Computation, 123(2):155-171, December 1995.
14. C. K. I. Foster and S. Tuecke. The anatomy of the grid: Enabling scalable virtual organizations. International Journal of Supercomputer Applications, 15(3):200-222, August 2001.
15. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 163-170, Portland, Oregon, USA, May 2000.
16. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, H. W. S. Rhea, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale per sistent storage. In Proceedings of ACM ASPLOS, pages 190-201, Cambridge, MA, USA, Dec. 2000.
17. N. A. Lynch. Distributed Algorithms. Morgan Kaufman Publishers, 1996.
18. S. D. M. Schlosser, M. Sintek and W. Nejdl. Hypercup -hypercubes, ontologies, and efficient search on peer-to-peer networks. Lecture Notes in Computer Science - Agents and Peer-to-Peer Computing, 2530:112-124, 2003.
19. R. Perlman. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley Pub Co, 1999.
20. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM, pages 161-172, San Diego, CA, USA, Aug. 2001.
21. D. K. S. Dolev, E. Kranakis and D. Peleg. Bubbles: Adaptive routing scheme for high-speed dynamic networks. SIAM Journal on Computing, 29(3):804-833, December 1999.
22. E. S. S. Dolev and J. L. Welch. Random walk for self-stabilizing group communication in ad-hoc networks. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pages 70-79, Osaka, Japan, Oct. 2002.
23. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, pages 149-160, San Diego, CA, USA, Aug. 2001.
24. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. J., and J. D. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas on Communications, 22(1):41-53, January 2004.