Asynchronous resource discovery in peer-to-peer networks

Computer Networks

Volumn 51, Issue 1, 2007, Pages 190-206

  Kutten, Shay ^a   Peleg, David ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Asynchronous networks; Distributed algorithms; Peer to peer; Topology changes; Topology knowledge loss

Indexed keywords

ASYNCHRONOUS NETWORKS; DISTRIBUTED ALGORITHMS; PEER TO PEER (P2P) NETWORKS; TOPOLOGY CHANGES; TOPOLOGY KNOWLEDGE LOSS;

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; RANDOM PROCESSES; ROUTERS;

COMPUTER NETWORKS;

EID: 33749624262     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2006.02.005     Document Type: Article

References (27)

1. J. Aspnes, D. Angluin, J. Chen, Y. Wu, Y. Yin, Fast construction of overlay networks, in: Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 2005, pp. 145-154.
2. Awerbuch B., and Shiloach Y. New connectivity and MSF algorithms for Ultracomputer and PRAM. IEEE Trans. Comput. 36 (1987) 1258-1263
3. I. Cidon, I. Gopal, S. Kutten, New models and algorithms for future networks, in: 7th Annual ACM Symposium on Principles of Distributed Computing (PODC 88), Toronto, Ont., Canada, August 1988, pp. 75-89.
4. B. Awerbuch, I. Cidon, S. Kutten, Optimal maintenance of replicated information, in: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS 90), St. Louis, MO, USA, October 1990, pp. 492-502.
5. D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: Towards a realistic model of parallel computation, in: Proceedings of the 4th ACM SIGPLAN Symposium on Principles Practice of Parallel Programming, pp. 1-12, 1993.
6. A. Bar-Noy, S. Kipnis, Designing broadcasting algorithms in the postal model for message-passing systems, in: ACM SPAA 1992, pp. 13-22.
7. Cidon I., Gopal I., Kaplan M., and Kutten S. Distributed control for fast networks. IEEE Trans. Commun. 43 (1995) 1950-1960
8. E. Cohen, S. Shenker, Replication strategies in unstructured peer-to-peer networks, in: Proceedings of ACM SIGCOMM'2002, Pittsburgh, PA, USA, August 2002, pp. 177-190.
9. Gnutella home page, http://gnutella.wego.com.
10. Freenet home page, http://freenet.sourceforge.net.
11. PPWAN: Peer-to-Peer Without a Name, http://dividuum.de/p/ppwan/.
12. ALPINE: Adaptive Large-scale P2p Information Networking, http://cubicmetercrystal.com/alpine/.
13. The GDNP: The G Diffuse Networking Protocol, http://web.g.diffuse-network.org/.
14. Retsina: Discovery of Infrastructure in Multi-Agent Systems, http://www-2.cs.cmu.edu/~softagents/retsina.html.
15. JXTA home page, http://www.jxta.org.
16. P2P seminar home page, http://iew3.technion.ac.il/kutten/p2p-seminar.html.
17. M. Harchol-Balter, T. Leighton, D. Lewin, Resource discovery in distributed networks, in: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, May 1999, pp. 229-237.
18. I. Abraham, D. Dolev, Asynchronous resource discovery, in: Proceedings of ACM PODC 2003, pp. 143-150.
19. C. Law, K.-Y. Siu, An O(log n) randomized resource discovery algorithm. Brief Announcements of the 14th Symposium on Distributed Computing, Tech. Report FIM/110.1/DLSIIS/2000, Technical University of Madrid, October 2000, pp. 5-8.
20. Kutten S., Peleg D., and Vishkin U. Deterministic resource discovery in distributed networks. Theor. Comput. Syst. (TOCS) 36 5 (2003) 479-495
21. McQuillan J., Richer I., and Rosen E. The new routing algorithm for the Arpanet. IEEE Trans. Commun. 28 (1980) 711-719
22. Okasaki C. Purely Functional Data Structures (1998), Cambridge University Press, Cambridge
23. I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, in: Proceedings of the 2001 ACM SIGCOMM Conference, 2001, pp. 149-160.
24. Shiloach Y., and Vishkin U. An O(log n) parallel connectivity algorithm. J. Algorithms 3 (1982) 57-67
25. Zhao B.Y., Huang L., Stribling J., Rhea S.C., Joseph A.D., and Kubiatowicz J.D. Tapestry: A global-scale overlay for rapid service deployment. IEEE J. Select. Areas Commun. (2003)
26. D. Malkhi, M. Naor, D. Ratajczak, Viceroy: A scalable and dynamic emulation of the butterfly, in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), August 2002.
27. Tanenbaum A.S. Computer Networks, 4/E (2003), Prentice Hall, New Jersey