Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
DOI10.1145/1007352.1007368zbMATH Open1192.68048OpenAlexW2160405192MaRDI QIDQ3580959FDOQ3580959
Authors: Gurmeet Singh Manku, Moni Naor, Udi Wieder 
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007368
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cited In (30)
- Neighbor selection and hitting probability in small-world graphs
- Viceroy, a scalable and dynamic emulation of the butterfly
- A model of self-avoiding random walks for searching complex networks
- Recovering the long-range links in augmented graphs
- Universal augmentation schemes for network navigability
- Degree-optimal routing for P2P systems
- D2B: A de Bruijn based content-addressable network
- Optimal routing in a small-world network
- A probabilistic analysis of Kademlia networks
- Routing complexity of faulty networks
- Navigation in spatial networks: a survey
- Depth of Field and Cautious-Greedy Routing in Social Networks
- Low-distortion inference of latent similarities from a multiplex social network
- Could any graph be turned into a small-world?
- JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness
- SKY: efficient peer-to-peer networks based on distributed Kautz graphs
- F-Chord: Improved uniform routing on Chord
- Navigable small-world networks with few random bits
- The expansion and mixing time of skip graphs with applications
- The analysis of Kademlia for random IDs
- \(D^2\)-tree: a new overlay with deterministic bounds
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
- Shortest-path routing in randomized DHT-based peer-to-peer systems
- Kleinberg's grid unchained
- Distance estimation and object location via rings of neighbors
- Greedy routing and the algorithmic small-world phenomenon
- The forgiving graph: a distributed data structure for low stretch under adversarial attack
- Greedy routing in small-world networks with power-law degrees
- Eclecticism shrinks even small worlds
- Close to optimal decentralized routing in long-range contact networks
This page was built for publication: Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580959)
