Asynchronous resource discovery in peer to peer networks

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 224-231

  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; P2P; Peer to Peer; Topology changes; Topology knowledge loss

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INFORMATION ANALYSIS; INTERNET; TOPOLOGY;

PEER TO PEER NETWORKS;

NETWORK PROTOCOLS;

EID: 0036443140     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. B. Awerbuch and Y. Shiloach. New Connectivity and MSF Algorithms for Ultracomputer and PRAM. IEEE Trans. on Computers 36, (1987), 1258-1263.
2. I. Cidon, I. Gopal, and S. kutten. New Models and Algorithms for Future Networks. IEEE Trans. on Information Theory 41, (1995), 769-780.
3. I. Cidon, I. Gopal, M. Kaplan, and S. kutten. Distributed Control for Fast Networks. IEEE Trans. on Communications, 43, (1995), 1950-1960.
4. R.G. Gallager, P.A. Humbler, and P.M. Spira. A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. on Programming Lang. and Syst. 5, (1983), 66-77.
5. Gnutella home page http://gnutella.wego.com.
6. Freenet home page http://freenet.sourceforge.net.
7. PPWAN: Peer-to-Peer Without a Name, http://dividuum.de/p/ppwan/.
8. ALPINE: Adaptive Large-scale P2p Information Networking, http://cubicmetercrystal.com/alpine/.
9. The GDNP: The G Diffuse Networking Protocol, http://web.g.diffuse-network.org/.
10. Retsina: Discovery of Infrastructure in Multi-Agent Systems, http://www-2.cs.cmu.edu/~softagents/retsina.html.
11. JXTA home page, http://www.jxta.org.
12. P2P seminar home page. http://iew3.technion.ac.il/kutten/p2p-seminar.html.
13. M. Harchol-Balter, T. Leighton, and D. Lewin. Resource Discovery in Distributed Networks. In Proc. 15th ACM Symp. on Principles of Distributed Computing, May 1999, pp. 229-237.
14. C. Law and K.-Y. Siu. An O(log n) Randomized Resource Discovery Algorithm. Brief Announcements of the 14th Symp. on Distributed Computing, Tech. Report FIM/110.1/DLSIIS/2000, Technical University of Madrid, Oct. 2000, pp. 5-8.
15. S. Kutten, D. Peleg, and U. Vishkin. Deterministic Resource Discovery in Distributed Networks. In Proc. 13th ACM Symp. on Parallel Algorithms and Architectures, 2001 Crete, pp. 77-83.
16. J. McQuillan, I. Richer, and E. Rosen. The New Routing Algorithm for the Arpanet. IEEE Trans. on Communications 28, (1980), 711-719.
17. Y. Shiloach and U. Vishkin. An O(log n) Parallel Connectivity Algorithm. J. Algorithms 3, (1982), 57-67.