Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Looking up data in P2P systems
Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Observations on the Dynamic Evolution of Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Efficient, Self-Contained Handling of Identity in Peer-to-Peer Systems
IEEE Transactions on Knowledge and Data Engineering
On zone-balancing of peer-to-peer networks: analysis of random node join
Proceedings of the joint international conference on Measurement and modeling of computer systems
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
The Different Dimensions of Dynamicity
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
To Unify Structured and Unstructured P2P Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
TYPHOON: mobile distributed hash tables
Journal of Parallel and Distributed 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
Peer-to-peer networks based on random transformations of connected regular undirected graphs
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)
Separating durability and availability in self-managed storage
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Century papers at the first quarter-century milestone
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Efficient and decentralized PageRank approximation in a peer-to-peer web search network
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On unbiased sampling for unstructured peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Cashmere: resilient anonymous routing
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Super nodes positioning for P2P IP telephony over wireless ad-hoc networks
Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
Stochastic analysis of the interplay between object maintenance and churn
Computer Communications
Stochastic maintenance of overlays in structured P2P systems
Computer Communications
MuON: Epidemic based mutual anonymity in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
C2: a new overlay network based on CAN and Chord
International Journal of High Performance Computing and Networking
NBDT: an efficient P2P indexing scheme for web service discovery
International Journal of Web Engineering and Technology
Building a reliable P2P system out of unreliable P2P clients: the case of KAD
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Conditional busy and free queue systems with variable servers' number
MATH'05 Proceedings of the 8th WSEAS International Conference on Applied Mathematics
Poisson counting process with variable servers' number
MATH'05 Proceedings of the 8th WSEAS International Conference on Applied Mathematics
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Proceedings of the 2nd international conference on Scalable information systems
Resilience of structured P2P systems under churn: The reachable component method
Computer Communications
Designing less-structured P2P systems for the expected high churn
IEEE/ACM Transactions on Networking (TON)
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Future Generation Computer Systems
A randomized algorithm for the joining protocol in dynamic distributed networks
Theoretical Computer Science
Efficiently Handling Dynamics in Distributed Link Based Authority Analysis
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
An analytical study of a structured overlay in the presence of dynamic membership
IEEE/ACM Transactions on Networking (TON)
Random Subsets of the Interval and P2P Protocols
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Practical Approach to Network Size Estimation for Structured Overlays
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
On static and dynamic partitioning behavior of large-scale P2P networks
IEEE/ACM Transactions on Networking (TON)
Node isolation model and age-based neighbor selection in unstructured P2P networks
IEEE/ACM Transactions on Networking (TON)
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Dynamic Web Service discovery architecture based on a novel peer based overlay network
Journal of Systems and Software
P2P Networking and Applications
P2P Networking and Applications
On unbiased sampling for unstructured peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
A Distributed Shared Memory Architecture for Occasionally Connected Mobile Environments
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
On content delivery network implementation
Computer Communications
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Resolving the Noxious Effect of Churn on Internet Coordinate Systems
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
On the self-organization of a hybrid peer-to-peer system
Journal of Network and Computer Applications
Estimating churn in structured P2P networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Oscar: small-world overlay for realistic key distributions
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
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
Redundant data composition of peers in P2P streaming systems using Cauchy Reed-Solomon codes
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Peer-to-peer video-on-demand with scalable video coding
Computer Communications
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
Performance comparison of erasure codes for different churn models in P2P storage systems
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Theory of communication networks
Algorithms and theory of computation handbook
An adaptive stabilization framework for distributed hash tables
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
D1HT: a distributed one hop hash table
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
In-degree dynamics of large-scale P2P systems
ACM SIGMETRICS Performance Evaluation Review
Uniformity of improved versions of chord
ICICA'10 Proceedings of the First international conference on Information computing and applications
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Churn resilience of peer-to-peer group membership: a performance analysis
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Automatically generalized ontology system for peer-to-peer networks
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Survive under high churn in structured P2P systems: evaluation and strategy
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Understanding the session durability in peer-to-peer storage system
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Building efficient super-peer overlay network for DHT systems
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
SChord: handling churn in chord by exploiting node session time
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Reliable multicast and its probabilistic model for job submission in peer-to-peer grids
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
SkipTree: a scalable range-queryable distributed data structure for multidimensional data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Programming an amorphous computational medium
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A statistical theory of chord under churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Core persistence in peer-to-peer systems: relating size to lifetime
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Evaluating the accuracy of captured snapshots by peer-to-peer crawlers
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Bounding communication cost in dynamic load balancing of distributed hash tables
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Improving data availability in chord p2p system
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Using lightweight modeling to understand chord
ACM SIGCOMM Computer Communication Review
A peer-to-peer expressway over Chord
Mathematical and Computer Modelling: An International Journal
Revisiting botnet models and their implications for takedown strategies
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Connectivity in eventually quiescent dynamic distributed systems
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Systolic routing in an optical ring with logarithmic shortcuts
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Towards efficient replication of documents in chord: case (r,s) erasure codes
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
A generalized algorithm for publish/subscribe overlay design and its fast implementation
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.02 |
In this paper, we give a theoretical analysis of peer-to-peer (P2P) networks operating in the face of concurrent joins and unexpected departures. We focus on Chord, a recently developed P2P system that implements a distributed hash table abstraction, and study the process by which Chord maintains its distributed state as nodes join and leave the system. We argue that traditional performance measures based on run-time are uninformative for a continually running P2P network, and that the rate at which nodes in the network need to participate to maintain system state is a more useful metric. We give a general lower bound on this rate for a network to remain connected, and prove that an appropriately modified version of Chord's maintenance rate is within a logarithmic factor of the optimum rate.