Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Patricia tries again revisited
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SIAM Journal on Computing
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
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
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Heights in Generalized Tries and PATRICIA Tries
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
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
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Load balancing and density dependent jump Markov processes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Efficient, Proximity-Aware Load Balancing for Structured P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
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
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Messor: load-balancing through a swarm of autonomous agents
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
IEEE Journal on Selected Areas in Communications
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
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Resilient and efficient load balancing in distributed hash tables
Journal of Network and Computer Applications
On static and dynamic partitioning behavior of large-scale P2P networks
IEEE/ACM Transactions on Networking (TON)
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
A structured peer-to-peer system with integrated index and storage load balancing
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Dynamic zone-balancing of topology-aware peer-to-peer networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Shaping opportunistic networks
Computer Communications
Web search results caching service for structured P2P networks
Future Generation Computer Systems
| Hi-index | 0.00 |
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-to-peer (P2P) research [1], [2], [6], [19], [31], [36]. To bring analytical understanding into the various peer-join mechanisms, we study how zone-balancing decisions made during the initial sampling of the peer space affect the resulting zone sizes and derive several asymptotic results for the maximum and minimum zone sizes that hold with high probability.