The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
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
Sampling regular graphs and a peer-to-peer network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Peer-to-peer systems for discovering resources in a dynamic grid
Parallel Computing
ACM Transactions on Computer Systems (TOCS)
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Stochastic analysis of the interplay between object maintenance and churn
Computer Communications
Building resilient low-diameter peer-to-peer topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Building heterogeneous peer-to-peer networks: protocol and analysis
IEEE/ACM Transactions on Networking (TON)
Resilience of structured P2P systems under churn: The reachable component method
Computer Communications
A randomized algorithm for the joining protocol in dynamic distributed networks
Theoretical Computer Science
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
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)
The flip markov chain and a randomising P2P protocol
Proceedings of the 28th ACM symposium on Principles of distributed computing
A proposed P2PSIP framework for extreme emergency situations in a wireless environment
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
A Robust Algorithm for the Membership Management of Super-Peer Overlay
MMNS 2009 Proceedings of the 12th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Wired-Wireless Multimedia Networks and Services Management
PHAC: an environment for distributed collaborative applications on P2P networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
How do superpeer networks emerge?
INFOCOM'10 Proceedings of the 29th conference on Information communications
Reliable broadcasting in random networks and the effect of density
INFOCOM'10 Proceedings of the 29th conference on Information communications
Rumor spreading on random regular graphs and expanders
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
In-degree dynamics of large-scale P2P systems
ACM SIGMETRICS Performance Evaluation Review
A unique design for high-performance decentralized resources locating: a topological perspective
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Unstructured peer-to-peer networks: topological properties and search performance
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
A policy for electing super-nodes in unstructured p2p networks
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Design and analysis of a bio-inspired search algorithm for peer to peer networks
Self-star Properties in Complex Information Systems
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Proceedings of the 2013 Research in Adaptive and Convergent Systems
| Hi-index | 0.07 |
Peer-to-peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke points with inadequate bandwidth. We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. These properties are crucial for efficient search and data exchange. An important feature of our protocol is that it operates without global knowledge of all the nodes in the network.