Degree-optimal routing for P2P systems
From MaRDI portal
Publication:841622
DOI10.1007/S00224-007-9074-XzbMATH Open1178.68099OpenAlexW2114494416MaRDI QIDQ841622FDOQ841622
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
Recommendations
Cites Work
- Title not available (Why is that?)
- D2B: A de Bruijn based content-addressable network
- Novel architectures for P2P applications: the continuous-discrete approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
- Structural Information and Communication Complexity
- Degree-optimal routing for P2P systems
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
Uses Software
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)
