Stanford InfoLab Publication Server

SIL: Modeling and measuring scalable peer-to-peer search networks

Cooper, Brian F. and Garcia-Molina, Hector (2003) SIL: Modeling and measuring scalable peer-to-peer search networks. In: International Workshop on Databases, Information Systems and Peer-to-Peer Computing, September 7-8, 2003, Berlin, Germany.

BibTeXDublinCoreEndNoteHTML

This is the latest version of this item.

[img]
Preview
PDF
250Kb

Abstract

The popularity of peer-to-peer search networks continues to grow, 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 analytical and simulation results, we argue that one new organization, parallel search clusters, is superior to existing supernode networks in many cases.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:peer-to-peer, search, SIL, information discovery
Subjects: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:754
Deposited By:Import Account
Deposited On:03 Aug 2003 17:00
Last Modified:24 Dec 2008 09:18

Available Versions of this Item

Download statistics

Repository Staff Only: item control page