On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
An adaptive peer-to-peer network for distributed caching of OLAP results
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Text-Based Content Search and Retrieval in Ad-hoc P2P Communities
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Piazza: data management infrastructure for semantic web applications
WWW '03 Proceedings of the 12th international conference on World Wide Web
Make it fresh, make it quick: searching a network of personal webservers
WWW '03 Proceedings of the 12th international conference on World Wide Web
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Mapping data in peer-to-peer systems: semantics and algorithmic issues
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Evaluating GUESS and Non-Forwarding Peer-to-Peer Search
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Ad Hoc, self-supervising peer-to-peer search networks
ACM Transactions on Information Systems (TOIS)
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Locating data sources in large distributed systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Associative search in peer to peer networks: Harnessing latent semantics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the international workshop on Workshop on multimedia information retrieval
Exploiting semantic proximities for content search over p2p networks
Computer Communications
Zone indexing: Optimizing the balance between searching and indexing in a loosely structured overlay
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
The popularity of peer-to-peer search networks continues to grow, even as limitations to the scalability of existing systems become apparent. We propose a simple model for search networks, called the Search/Index Links (SIL) model, which can be used to analyze the scalability, search latency and fault tolerance of search networks. The model describes two kinds of links: search links, over which content searches are routed, and index links, over which content indexes are replicated. The combination of routing and indexing in the same network is extremely useful for building scalable, efficient search networks. While the SIL model can be used to examine existing networks, it can also be used to discover new organizations by defining desirable (or undesirable) properties of SIL graphs and then examining the topologies that exhibit (or lack) those properties. We define one such undesirable property, which we call redundancy, and show how it can be prevented by avoiding specific topological features. Using analytical and simulation results, we argue that one new organization discovered via our analysis, parallel search clusters, is superior to existing supemode networks in many cases: for example, in a network with 10,000 nodes, our analysis shows that the average node in a supernode network is up to 16 times more loaded than the average node in a cluster network. At the same time, a cluster network has better fault tolerance than, and similar search latency to, a supernode network.