Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second 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
The diameter of long-range percolation clusters on finite cycles
Random Structures & Algorithms
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The diameter of a long-range percolation graph
Random Structures & Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
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
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Linked
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Brief announcement: an overview of the content-addressable network D2B
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Brief announcement: deterministic skipnet
Proceedings of the twenty-second annual symposium on Principles of distributed computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: degree: optimal deterministic routing for P2P systems
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Virtual coordinates for ad hoc and sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Routing complexity of faulty networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Close to optimal decentralized routing in long-range contact networks
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Eclecticism shrinks even small worlds
Distributed Computing - Special issue: PODC 04
A Multi-agent Mechanism for Topology Balancing in Unstructured P2P Networks
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Universal augmentation schemes for network navigability: overcoming the √n-barrier
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A doubling dimension threshold θ(loglogn) for augmented graph navigability
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the complexity of greedy routing in ring-based peer-to-peer networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Routing complexity of faulty networks
Random Structures & Algorithms
Targeted local immunization in scale-free peer-to-peer networks
Journal of Computer Science and Technology
Efficient file search in non-DHT P2P networks
Computer Communications
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the windfall of friendship: inoculation strategies on social networks
Proceedings of the 9th ACM conference on Electronic commerce
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
Recovering the Long-Range Links in Augmented Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Shortest-path routing in randomized DHT-based Peer-to-Peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
On static and dynamic partitioning behavior of large-scale P2P networks
IEEE/ACM Transactions on Networking (TON)
Universal augmentation schemes for network navigability
Theoretical Computer Science
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Proceedings of the 28th ACM symposium on Principles of distributed computing
Navigable Small-World networks with few random bits
Theoretical Computer Science
NISAN: network information service for anonymization networks
Proceedings of the 16th ACM conference on Computer and communications security
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Recovering the long-range links in augmented graphs
Theoretical Computer Science
Small worlds as navigable augmented networks: model, analysis, and validation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Depth of field and cautious-greedy routing in social networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the searchability of small-world networks with arbitrary underlying structure
Proceedings of the forty-second ACM symposium on Theory of computing
FISH: a novel peer-to-peer overlay network based on
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Scalable routing on flat names
Proceedings of the 6th International COnference
A Lower Bound for Network Navigability
SIAM Journal on Discrete Mathematics
Optimal path search in small worlds: dimension matters
Proceedings of the forty-third annual ACM symposium on Theory of computing
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Near optimal routing in a small-world network with augmented local awareness
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
How much independent should individual contacts be to form a small–world?
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Schema mappings and data exchange for graph databases
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e. g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world percolation networks. In each of these networks, a node has out-degree Θ(log n), where n denotes the total number of nodes, and greedy routing is known to take O(log n) hops on average. We establish lower-bounds for greedy routing for these networks, and analyze Neighbor-of-Neighbor (NoN)-greedy routing. The idea behind NoN, as the name suggests, is to take a neighbor's neighbors into account for making better routing decisions.The following picture emerges: Deterministic routing networks like hypercubes and Chord have diameter Θ(log n) and greedy routing is optimal. Randomized routing networks like randomized hypercubes, randomized Chord, and constructions based on small-world percolation networks, have diameter Θ(log n / log log n) with high probability. The expected diameter of Skip graphs is also Θ(log n / log log n). In all of these networks, greedy routing fails to find short routes, requiring Ω(log n) hops with high probability. Surprisingly, the NoN-greedy routing algorithm is able to diminish route-lengths to Θ(log n / log log n) hops, which is asymptotically optimal.