Peer-to-peer systems have evolved as a means to share large amounts of data among autonomous nodes. A central issue in this context is locating nodes with data matching a user query. In this paper, we consider building peer-to-peer systems with small-world properties, that is, connecting the nodes to each other so that: (i) the distance between any two nodes is small and (ii) relevant nodes are connected to each other. Relevance between nodes is defined based on the probability that the two nodes match similar queries. We propose decentralized procedures for constructing small worlds based on routing indexes that describe the content of neighboring nodes. Our experimental results show that small-world peer-to-peer systems built with these procedures increase recall, that is, the percentage of relevant results returned.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- On Constructing Small Worlds in Unstructured Peer-to-Peer Systems
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA