Idit Keidar
Roie Melamed
ABSTRACT
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dynamic failure-prone environments. In this paper, we define metrics for evaluating unstructured overlays for peer-to-peer lookup systems. These metrics capture the search dependability and efficiency, and the granularity at which one can control the tradeoff between the two, as well as fairness. According to these metrics, we evaluate different graphs and overlays, including a Gnutella graph, a power law random graph, normal random graphs, a 3-regular random graph, and a 3-Araneola overlay. Our study shows that, according to our metrics, a 3-Araneola overlay achieves the best results, and hence it is an excellent solution for flooding-based peer-to-peer lookup system.
- E. Adar and B. A. Huberman. Free riding on gnutella. First Monday, Sept. 2000.Google Scholar
Cross Ref
- B. Bollobas. Random graphs.Google Scholar
- Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like p2p systems scalable. In ACM SIGCOMM, August 2003. Google ScholarDigital Library
- P. T. Eugster, R. Guerraoui, S. B. Handurukande, A. M. Kermarrec, and P. Kouznetsov. Lightweight probabilistic broadcast. ACM Trans. Comput. Syst., 21(4):341--374, November 2003. Google ScholarDigital Library
- K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In SOSP, 2003. Google ScholarDigital Library
- C. Law and K. Siu. Distributed construction of random expander networks. In IEEE Infocom, April 2003.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- R. Melamed and I. Keidar. Araneola: A scalable reliable multicast system for dynamic environments. In IEEE NCA, 2004. Google ScholarDigital Library
- M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal, 6(1), 2002. Google ScholarDigital Library
- N. Wormald. Models of random regular graphs. Surveys in Combinatorics, 276:239--298, 1999.Google Scholar
Index Terms
- Evaluating unstructured peer-to-peer lookup overlays
Recommendations
Performance analysis of structured peer-to-peer overlays for mobile networks
Distributed Hash Table DHT based Peer-to-Peer P2P overlays have been widely researched and deployed in many applications such as file sharing, IP telephony, content distribution and media streaming applications. However, their deployment has largely ...
A framework for architecting peer-to-peer receiver-driven overlays
NOSSDAV '04: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and videoThis paper presents a simple and scalable framework for architecting peer-to-peer overlays called Peer-to-peer Receiver-driven Overlay (or PRO). PRO is designed for non-interactive streaming applications and its primary design goal is to maximize ...
On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks
Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce ...
Comments