Degree-optimal routing for P2P systems

DOI10.1007/S00224-007-9074-XMaRDI QIDQ841622zbMATH OpenOpenAlexFDO

Authors Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano

Publication date 18 September 2009

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-007-9074-x

zbMATH Keywords

greedy routingpeer-to-peeroverlay network

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Routing networks for distributed hash tables
• Fault-tolerant routing in peer-to-peer systems
• Shortest-path routing in randomized DHT-based peer-to-peer systems
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1559581 (Why is no real title available?)
• scientific article; zbMATH DE number 1931791 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 6469145 (Why is no real title available?)
• D2B: A de Bruijn based content-addressable network
• Degree-optimal routing for P2P systems
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Novel architectures for P2P applications: the continuous-discrete approach
• Structural Information and Communication Complexity

Cited in

(8)

• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Degree-optimal routing for P2P systems
• Using uncertainty DHT to solve non-transitive connectivity problems in overlay network
• A novel constant degree and constant congestion DHT scheme for peer-to-peer networks
• Navigable small-world networks with few random bits
• Psu: a novel low-latency constant-degree overlay network
• Shortest-path routing in randomized DHT-based peer-to-peer systems
• On the complexity of greedy routing in ring-based peer-to-peer networks

Describes a project that uses

Uses Software

• Pastry

This page was built for publication: Degree-optimal routing for P2P systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841622)