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
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Computer Networking: A Top-Down Approach (4th Edition)
Computer Networking: A Top-Down Approach (4th Edition)
An efficient network-wide broadcasting based on hop-limited shortest-path trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We propose a simple mechanism for supporting routing control in unstructured P2P systems. In the proposal, each node keeps the information on the hop-limited shortest path trees whose roots are located around the neighbor. Here, the hop-limited tree means the one that is made of nodes within a certain number of hops (say n hops) from the root. When a node receives a unicast message, it transmits the message to the upstream neighbor on the shortest-path tree rooted at the message destination only if the destination is located within the n-hop radius. Otherwise, it generates duplicates of the original message and forwards them to downstream neighbors on the shortest-path tree rooted at the message source. The information of upstream and downstream neighbors on the shortest path trees is stored in the message forwarding or the routing tables, which are constructed and updated in a fully distributed fashion. Numerical examples show that our proposal can largely reduce the number of queries generated in a file search.