Parallel program design: a foundation
Parallel program design: a foundation
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Elements of network protocol design
Elements of network protocol design
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
On name resolution in peer-to-peer networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Atomic Data Access in Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Correct implementation of network protocols
Correct implementation of network protocols
Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Failure recovery for structured p2p networks: protocol design and performance under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
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
A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
On unbiased sampling for unstructured peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Correctness of gossip-based membership under message loss
Proceedings of the 28th ACM symposium on Principles of distributed computing
Proving assertions about parallel programs
Journal of Computer and System Sciences
Decentralized, connectivity-preserving, and cost-effective structured overlay maintenance
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Dependable peer-to-peer systems withstanding dynamic adversarial churn
Dependable Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Connectivity in eventually quiescent dynamic distributed systems
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Dynamic networks: models and algorithms
ACM SIGACT News
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Topology maintenance, or how to handle the possibly concurrent joining and leaving of nodes, is a central problem for structured peer-to-peer networks. A good topology maintenance protocol should run efficiently, fully maintain the topology, and should not unduly restrict concurrency. In this paper, we present such a protocol for a multi-ring topology called Ranch. The protocol is efficient: for each join or leave, it uses a logarithmic number of messages with high probability. The protocol fully maintains Ranch after joins and leaves, and allows for a high degree of concurrency. To our knowledge, this is the first maintenance protocol that enjoys all of these properties for a structured peer-to-peer network topology.