Stanford InfoLab Publication Server

Modeling and measuring scalable peer-to-peer search networks

Cooper, Brian F. and Garcia-Molina, Hector (2002) Modeling and measuring scalable peer-to-peer search networks. Technical Report. Stanford.

BibTeXDublinCoreEndNoteHTML
WarningThere is a more recent version of this item available.

[img]
Preview
PDF
296Kb

Abstract

The popularity of peer-to-peer search networks grows, even as the limitations to the scalability of existing systems become apparent. We propose a simple model for search networks, called the search/index links (SIL) model. The SIL model describes existing networks while also yielding organizations not previously studied. Using simulation results, we argue that a new organization, parallel search clusters, is superior to existing supernode networks in many cases.

Item Type:Techreport (Technical Report)
Uncontrolled Keywords:peer-to-peer search, content discovery, supernodes, network modeling, efficient networks
Subjects:Computer Science > Archival
Computer Science > Digital Libraries
Computer Science > Distributed Systems
Projects:Peers
Digital Libraries
Related URLs:Project Homepage, Project Homepagehttp://www-diglib.stanford.edu/diglib/pub/, http://infolab.stanford.edu/peers/
ID Code:552
Deposited By:Import Account
Deposited On:14 Sep 2002 17:00
Last Modified:25 Dec 2008 08:51

Available Versions of this Item

Download statistics

Repository Staff Only: item control page