Stanford InfoLab Publication Server

Ad hoc, self-supervising peer-to-peer search networks

Cooper, Brian F. and Garcia-Molina, Hector (2003) Ad hoc, self-supervising peer-to-peer search networks. Technical Report. Stanford.




Peer-to-peer search networks are a popular and widely deployed means of searching massively distributed digital object repositories. Unfortunately, as such networks grow, they place an increasingly overwhelming load on some or all of the participating nodes. We examine how to reduce the load on nodes by allowing them to self-organize into a relatively efficient network, and then self-tune to make the network even more efficient. Unlike previously studied architectures, our ``ad hoc, self-supervising'' networks avoid restrictions on who a node can connect to or what information can be exchanged. This makes the network topology quite flexible and tuneable. Our results indicate that our ad hoc networks are more efficient than popular supernode topologies for several important scenarios.

Item Type:Techreport (Technical Report)
Uncontrolled Keywords:peer-to-peer search, flooding networks, information discovery, ad-hoc networks, SIL model
Subjects:Computer Science > Digital Libraries
Computer Science > Distributed Systems
Digital Libraries
Related URLs:Project Homepage, Project Homepage,
ID Code:608
Deposited By:Import Account
Deposited On:04 Feb 2003 16:00
Last Modified:24 Dec 2008 09:12

Download statistics

Repository Staff Only: item control page