NDLI: Search Algorithms for Unstructured Peer-to-Peer Networks

Content Provider	IEEE Xplore Digital Library
Author	Dorrigiv, R. Lopez-Ortiz, A. Pralat, P.
Copyright Year	2007
Description	Author affiliation: Univ. of Waterloo, Waterloo (Dorrigiv, R.)
Abstract	We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as well as a new hybrid algorithm proposed in this paper. This hybrid algorithm first uses flooding to find sufficient number of nodes and then starts random walks from these nodes. We compare the performance of the search algorithms on several graphs corresponding to common topologies proposed for peer- to-peer networks. In particular, we consider binomial random graphs, regular random graphs, power-law graphs, and clustered topologies. Our experiments show that for binomial random graphs and regular random graphs all algorithms have similar performance. For power-law graphs, flooding is effective for small number of messages, but for large number of messages our hybrid algorithm outperforms it. Flooding is ineffective for clustered topologies in which random walk is the best algorithm. For these topologies, our hybrid algorithm provides a compromise between flooding and random walk. We also compare the proposed hybrid algorithm with the fc-walker algorithm on power-law and clustered topologies. Our experiments show that while they have close performance on clustered topologies, the hybrid algorithm has much better performance on power-law graphs. We theoretically prove that flooding is effective for regular random graphs which is consistent with our experimental results.
Starting Page	343
Ending Page	352
File Size	238728
Page Count	10
File Format	PDF
ISBN	0769530001
ISSN	07421303
DOI	10.1109/LCN.2007.65
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-10-15
Publisher Place	Ireland
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Peer to peer computing Floods Clustering algorithms Network topology Computer science Search methods Computer networks Mathematics Statistics Broadcasting
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

RSB-Topo: A Topology Adaptation Algorithm for Unstructured P2P Networks

A Class-Based Search System in Unstructured P2P Networks

An Active Index Caching Search Algorithm for Unstructured P2P Networks

A category overlay infrastructure for peer-to-peer content search

Hybrid search schemes for unstructured peer-to-peer networks

Network coding with shortcuts

An efficient random walks based approach to reducing file locating delay in unstructured P2P network

Optimal Search Performance in Unstructured Peer-to-Peer Networks With Clustered Demands

Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks

Search Algorithms for Unstructured Peer-to-Peer Networks

Similar Documents

RSB-Topo: A Topology Adaptation Algorithm for Unstructured P2P Networks

A Class-Based Search System in Unstructured P2P Networks

An Active Index Caching Search Algorithm for Unstructured P2P Networks

A category overlay infrastructure for peer-to-peer content search

Hybrid search schemes for unstructured peer-to-peer networks

Network coding with shortcuts

An efficient random walks based approach to reducing file locating delay in unstructured P2P network

Optimal Search Performance in Unstructured Peer-to-Peer Networks With Clustered Demands

Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks

Search Algorithms for Unstructured Peer-to-Peer Networks