Full-Information Lookups for Peer-to-Peer Overlays

Full-Information Lookups for Peer-to-Peer Overlays

Most peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing information at each member node must be kept small so that the bookkeeping required to respond to system membership changes is also s...

Full description

Bibliographic Details
Main Authors: Rodrigues, Rodrigo, Gupta, Anjali, Fonseca, Pedro, Liskov, Barbara H.
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2010
Subjects:
routing protocol
peer to peer
network topology
distributed data structures
Routing protocols
Network topology
Distributed systems
Distributed data structures
Distributed applications
Online Access:http://hdl.handle.net/1721.1/52415
https://orcid.org/0000-0002-5914-1866

Internet

http://hdl.handle.net/1721.1/52415
https://orcid.org/0000-0002-5914-1866

Similar Items