Over the Internet today, computing and communications environments are significantly more
complex and chaotic than classical distributed systems, lacking any centralized organization …

P2P overlay networks have attracted significant research interest due to their utility as
virtualized abstractions of complex network infrastructures, optimized to satisfy specific …

We live in a “small world,” where two arbitrary people are likely connected by a short chain
of intermediate friends. With scant information about a target individual, people can …

We propose a family of constant-degree routing networks of logarithmic diameter, with the
additional property that the addition or removal of a node to the network requires no global …

We present Symphony, a novel protocol for maintaining distributed hash tables in a wide
area network. The key idea is to arrange all participants along a ring and equip them with …

The study of complex networks has emerged over the past several years as a theme
spanning many disciplines, ranging from mathematics and computer science to the social …

Several peer-to-peer networks are based upon randomized graph topologies that permit
efficient greedy routing, eg, randomized hypercubes, randomized Chord, skip-graphs and …

Graph-based approaches are empirically shown to be very successful for the nearest
neighbor search (NNS). However, there has been very little research on their theoretical …

There are many structured P2P systems that use DHT technologies to map data items onto
the nodes in various ways for scalable routing and location. Most of the systems require O …

We analyze the properties of Small-World networks, where links are much more likely to
connect" neighbor nodes" than distant nodes. In particular, our analysis provides new results …