Topology-aware overlay networks for group communication
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Compact, adaptive placement schemes for non-uniform requirements
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
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
Observations on the Dynamic Evolution of Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Survivable Monitoring in Dynamic Networks
IWIA '04 Proceedings of the Second IEEE International Information Assurance Workshop (IWIA'04)
The price of validity in dynamic networks
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Constructing a Balanced, (log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ad Hoc, self-supervising peer-to-peer search networks
ACM Transactions on Information Systems (TOIS)
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol
IEEE Transactions on Parallel and Distributed Systems
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Distributed random digraph transformations for peer-to-peer networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Survivable Monitoring in Dynamic Networks
IEEE Transactions on Mobile Computing
SIL: a model for analyzing scalable peer-to-peer search networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A mathematical programming formulation of optimal cache expiration dates in content networks
LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
The price of validity in dynamic networks
Journal of Computer and System Sciences
Self-configuration protocols for P2P networks
Web Intelligence and Agent Systems
Efficient Approximate Query Processing in Peer-to-Peer Networks
IEEE Transactions on Knowledge and Data Engineering
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The promise, and limitations, of gossip protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
C2: a new overlay network based on CAN and Chord
International Journal of High Performance Computing and Networking
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Combinatorial and computational properties of a diameter constrained network reliability model
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Efficiently Handling Dynamics in Distributed Link Based Authority Analysis
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
WSEAS TRANSACTIONS on COMMUNICATIONS
An optimal overlay topology for routing peer-to-peer searches
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Investigating the existence and the regularity of Logarithmic Harary Graphs
Theoretical Computer Science
Gossip-based aggregation of trust in decentralized reputation systems
Autonomous Agents and Multi-Agent Systems
Gossip-based aggregation of trust in decentralized reputation systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Computer Networks: The International Journal of Computer and Telecommunications Networking
Agents and peer-to-peer computing: a promising combination of paradigms
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
A simple constructing approach to build P2P global computing overlay network
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Future directions in distributed computing
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
A self-organization mechanism based on cross-entropy method for P2P-like applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Theory of communication networks
Algorithms and theory of computation handbook
Distance-constraint reachability computation in uncertain graphs
Proceedings of the VLDB Endowment
Evaluation of p2p systems under different churn models: why we should bother
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Understanding the session durability in peer-to-peer storage system
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
A statistical study of today’s gnutella
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Quickly routing searches without having to move content
IPTPS'05 Proceedings of the 4th 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
An optimal overlay topology for routing peer-to-peer searches
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Revisiting botnet models and their implications for takedown strategies
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Fast distributed computation in dynamic networks via random walks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Fast byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Storage and search in dynamic peer-to-peer networks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. 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 fragmentation into disconnected pieces separated by choke-points with inadequate bandwidth.In this paper we propose a simple scheme for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. It does so with no global knowledge of all the nodes in the network. In the most common P2P application to date (search), these properties are important.