Journal of Computer and System Sciences
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
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
Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
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
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
The hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
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
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
An overlay network for replica placement within a P2P VoD network
International Journal of High Performance Computing and Networking
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Distributed and Oblivious Heap
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
A DoS-resilient information system for dynamic data management
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A family of collusion resistant symmetric key protocols for authentication
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
SkewCCC+: a heterogeneous distributed hash table
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Re-Chord: a self-stabilizing chord overlay network
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Corona: a stabilizing deterministic message-passing skip list
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Content distribution in heterogenous video-on-demand p2p networks with ARIMA forecasts
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
IRIS: a robust information system against insider dos-attacks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Corona: A stabilizing deterministic message-passing skip list
Theoretical Computer Science
Hi-index | 0.00 |
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for these systems. While a large collection of scalable peer-to-peer overlay networks has been proposed in recent years, many fundamental questions have remained open. Some of these are: Is it possible to design deterministic peer-to-peer overlay networks with properties comparable to randomized peer-to-peer systems? How can peers of non-uniform bandwidth be organized in an overlay network?We propose a dynamic overlay network called Pagoda that provides solutions to both of these problems. The Pagoda network has a constant degree, a logarithmic diameter, and a 1/logarithmic expansion, and therefore matches the properties of the best randomized overlay networks known so far. However, in contrast to these networks, the Pagoda is deterministic and therefore guarantees these properties. The Pagoda can be used to organize both nodes with uniform bandwidth and nodes with non-uniform bandwidth. For nodes with uniform bandwidth, any node insertion or deletion can be executed with logarithmic work, and for nodes with non-uniform bandwidth, any node insertion and deletion can be executed with polylogarithmic work. Moreover, the Pagoda overlay network can route arbitrary multicast problems with a congestion that is within a logarithmic factor of what a best possible overlay network of logarithmic degree for that particular multicast problem can achieve, even though the Pagoda is a constant degree network. This holds even for nodes of arbitrary non-uniform bandwidths. We also show that the Pagoda network can be used for efficient data management.