Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized algorithms
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
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
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Proceedings of the 27th International Conference on Very Large Data Bases
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
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Scalable, distributed data structures for internet service construction
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - 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
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
On de Bruijn Routing in Distributed Hash Tables: There and Back Again
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
ICN: Interest-Based Clustering Network
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
A scheme for load balancing in heterogenous distributed hash tables
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)
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient file search in non-DHT P2P networks
Computer Communications
ACM Transactions on Computer Systems (TOCS)
EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management
Computer Communications
Statistical structures for Internet-scale data management
The VLDB Journal — The International Journal on Very Large Data Bases
Building a scalable P2P network with small routing delay
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Achieving and maintaining cost-optimal operation of a hierarchical DHT system
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Self-optimizing DHTs using request profiling
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing deterministic routing topologies is presented. Using this technique, classical parallel interconnection networks can be adapted to handle the dynamic nature of participants in peer-to-peer networks. A unified picture of randomized routing topologies is also presented. Two new protocols are described which improve average latency as a function of out-degree. One of the protocols can be shown to be optimal with high probability. Finally, routing networks for distributed hashing are revisited from a systems perspective and several open design problems are listed.