Efficient lookup on unstructured topologies

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 77-86

  Morselli, Ruggero ^a   Bhattacharjee, Bobby ^a   Srinivasan, Aravind ^a   Marsh, Michael A ^b  

^a University of Maryland ^*  (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Distributed algorithms; Lookup protocols; Peer to peer networks; Random walks

Indexed keywords

DISTRIBUTED HASH TABLE (DHT); LOOKUP PROTOCOLS; RANDOM WALKS; UNSTRUCTURED TOPOLOGIES;

ALGORITHMS; OPTIMIZATION; TOPOLOGY;

COMPUTER NETWORKS;

EID: 32344448483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073828     Document Type: Conference Paper

References (22)

1. I. Abraham and D. Malkhi. Probabilistic quorums for dynamic systems. In International Symposium on Distributed Computing (DISC), pages 60-74, 2003.
2. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, July 1970.
3. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making Gnutella-like P2P systems scalable. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 407-418. ACM Press, 2003.
4. J. Chu, K. Labonte, and B. N. Levine. Availability and locality measurements of peer-to-peer file systems. In Proc. ITCom: Scalability and Traffic Control in IP Networks II Conferences, volume 4868, July 2002.
5. I. Clarke, S. G. Miller, T. W. Hong, O. S. Sandberg, and B. Wiley. Protecting free expression online with Freenet. IEEE Internet Computing, 6(1), Jan./Feb. 2002.
6. P. Ganesan, Q. Sun, and H. Garcia-Molina. Yappers: A peer-to-peer lookup service over arbitrary topology. In 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2003.
7. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In IEEE Infocom, 2004.
8. http://www.gnutella.com.
9. S. Jiang, L. Guo, and X. Zhang. LightFlood: an efficient flooding scheme for file search in unstructured peer-to-peer systems. In International Conference on Parallel Processing, 2003.
10. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 16th international conference on Supercomputing, pages 84-95. ACM Press, 2002.
11. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: a scalable and dynamic emulation of the butterfly. In Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 183-192. ACM Press, 2002.
12. M. Mitzenmacher. Compressed Bloom filters. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC '01), pages 144-150, Newport, RI USA, August 26-29 2001. ACM Press.
13. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput., 26(2):350-368, 1997.
14. V. Ramasubramanian and E. G. Sirer. Beehive: Exploiting power law query distributions for O(1) lookup performance in peer to peer overlays. In Proceedings of NSDI, 2004.
15. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A scalable content-addressable network, In Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '01), pages 161-172, San Diego, CA USA, August 27-31 2001. ACM.
16. S. C. Rhea and J. Kubiatowicz. Probabilistic location and routing. In Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), Proceedings, volume 3, pages 1248-1257, New York, NY USA, June 23-27 2002. IEEE.
17. people.cs.uchicago.edu/~matei/GnutellaGraphs/
18. M. Ripeanu and I. T. Foster. Mapping the Gnutella network: Macroscopic properties of large-scale peer-to-peer systems. In P. Druschel, M. F. Kaashoek, and A. I. T. Rowstron, editors, Peer-to-Peer Systems, First International Workshop (IPTPS 2002), volume 2429 of Lecture Notes in Computer Science, pages 85-93, Cambridge, MA USA, March 7-8 2002. Springer.
19. A. I. Rowstron and P. Druschel. Pastry: Scalable, distributed object location, and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), volume 2218 of Lecture Notes in Computer Science, pages 329-350, Heidelberg, Germany, 2001. Springer.
20. S. Saroiu, K. P. Gummadi, and S. D. Gribble. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Multimedia Syst., 9(2):170-184, August 2003.
21. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '01), pages 149-160, San Diego, CA USA, August 27-31 2001. ACM.
22. B. Zhao, K. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, University of California at Berkeley Technical Report, 2001.