Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Protecting Free Expression Online with Freenet
IEEE Internet Computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
Symmetric replication for structured peer-to-peer systems
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Routing protocols have always been the backbone of modern networks. The introduction, however, of new topologies, such as Peer-to-Peer (P2P) and ad-hoc networks, have increased demands for efficient algorithms that can provide fault-tolerant operation under highly-distributed environments. In this paper, we provide proof for a novel routing protocol, the 'Umbrella' protocol, which can operate efficiently under constantly changing environments. The novelty of our scheme is based on a fixed-sized Distributed Hash Table (DHT), which allows for increased scalability. We mainly focus on content distribution and provide algorithms and a number of extensions for successful publishing and retrieval of keywords on top of an overlay network.