Virtual direction routing for overlay networks

IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing

Volumn , Issue , 2009, Pages 61-70

  Cheng, Bow Nan ^a,d   Yuksel, Mura ^b   Kalyanaraman, Shivkumar ^c  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF NEVADA   (United States)

^c IBM INDIA RESEARCH LAB   (India)

^d MIT LINCOLN LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH STRUCTURES; LOOKUPS; PEER-TO-PEER SYSTEM; QUERY PACKETS; REACHABILITY; SEARCHING METHODS; STATE INFORMATION; UNSTRUCTURED OVERLAY NETWORKS; VIRTUAL STRUCTURES;

CLIENT SERVER COMPUTER SYSTEMS; GRAPHIC METHODS; NETWORK PROTOCOLS; NETWORK ROUTING; OVERLAY NETWORKS; RECORDING INSTRUMENTS;

PEER TO PEER NETWORKS;

EID: 73549116337     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2009.5284516     Document Type: Conference Paper

References (13)

1. PeerSim: A Peer-to-Peer Simulator, http://peersim.souroeforge.net.
2. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like systems scalable. In Proceedings of ACM SIGCOMM, 2003.
3. B. Cheng, M. Yuksel, and S. Kalyanaraman. Orthogonal rendezvous routing protocol for wireless mesh networks. IEEEIACM Transactions on Networking (ToN), 17(2):542-555, April 2009.
4. D. Eastlake and P. Jones. Us secure hash algorithm 1. (shal). RFC 3174, September 2001.
5. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search, schemes for unstructured peer-to-peer networks. In Proceedings of Conference on Computer Communications, 2005.
6. Gnutella Inc.http://www.gnutel.la.com 2004.
7. H. Guclu and M. Yuksel. Limited scale-free overlay topologies for unstructured peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 20(5):667-679, May 2009.
8. A. Iamnitchi, M. Ripeanu, and I. Foster. Small-world filesharing communities. In Proceedings of Conference on Computer Communications (INFOCOM), 2004.
9. KaZaA Inc.http://www.kazaa.com, 2004.
10. J. Kleinberg. Navigation in a small world. Nature, page 845, 2000.
11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, 2001.
12. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEEIACM Tran. on Networking, 11(1):17-32, Feb 2003.
13. W. Terpstra, J. Kangasharju, C. Leng, and A. Buchmann. BubbleStorm: Resilient, Probabilistic, and Exhaustive Peerto-Peer Search. In Proceedings of ACM SIGCOMM, 2007.