Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
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
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
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
ACM Transactions on Computer Systems (TOCS)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Exploiting Semantic Proximity in Peer-to-Peer Content Searching
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
Performance and Dependability of Structured Peer-to-Peer Overlays
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A Robust Protocol for Building Superpeer Overlay Topologies
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
OpenDHT: a public DHT service and its uses
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Indexing data-oriented overlay networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
ACM Transactions on Computer Systems (TOCS)
Decentralized Ranking in Large-Scale Overlay Networks
SASOW '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops
Small-world networks: from theoretical bounds to practical systems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
P2P VoD using the self-organizing gradient overlay network
Proceedings of the second international workshop on Self-organizing architectures
A middleware for gossip protocols
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
StAN: exploiting shared interests without disclosing them in gossip-based publish/subscribe
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Design and implementation of a generic library for P2P streaming
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
Overlay management for fully distributed user-based collaborative filtering
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Application of random walks to decentralized recommender systems
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Modeling gossip-based content dissemination and search in distributed networking
Computer Communications
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Gozar: NAT-friendly peer sampling with one-hop distributed NAT traversal
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
OAZE: A network-friendly distributed zapping system for peer-to-peer IPTV
Computer Networks: The International Journal of Computer and Telecommunications Networking
Decentralized proactive resource allocation for maximizing throughput of P2P Grid
Journal of Parallel and Distributed Computing
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
Choosing partners based on availability in P2P networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Design and implementation of a P2P Cloud system
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Simulating large-scale dynamic random graphs in OMNeT++
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Designing extreme distributed systems: challenges and opportunities
Proceedings of the 8th international ACM SIGSOFT conference on Quality of Software Architectures
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A gossip-based mutual exclusion algorithm for cloud environments
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
Bio-Inspired P2P Systems: The Case of Multidimensional Overlay
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
PolderCast: fast, robust, and scalable architecture for P2P topic-based pub/sub
Proceedings of the 13th International Middleware Conference
An unstructured termination detection algorithm using gossip in cloud computing environments
ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems
Pervasive and Mobile Computing
Cloud driven design of a distributed genetic programming platform
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
Reducing server load in MMOG via P2P gossip
Proceedings of the 11th Annual Workshop on Network and Systems Support for Games
Peer-to-peer architectures for massively multiplayer online games: A Survey
ACM Computing Surveys (CSUR)
Towards an adaptive publish/subscribe approach supporting transitions
AIMS'13 Proceedings of the 7th IFIP WG 6.6 international conference on Autonomous Infrastructure, Management, and Security: emerging management mechanisms for the future internet - Volume 7943
Computer Networks: The International Journal of Computer and Telecommunications Networking
Real-time data dissemination in mobile peer-to-peer networks
Journal of Systems and Software
A self-similar super-peer overlay construction scheme for super large-scale P2P applications
Information Systems Frontiers
| Hi-index | 0.00 |
Large-scale overlay networks have become crucial ingredients of fully-decentralized applications and peer-to-peer systems. Depending on the task at hand, overlay networks are organized into different topologies, such as rings, trees, semantic and geographic proximity networks. We argue that the central role overlay networks play in decentralized application development requires a more systematic study and effort towards understanding the possibilities and limits of overlay network construction in its generality. Our contribution in this paper is a gossip protocol called T-Man that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. The protocol is fast, robust, and very simple. It is also highly configurable as the desired topology itself is a parameter in the form of a ranking method that orders nodes according to preference for a base node to select them as neighbors. The paper presents extensive empirical analysis of the protocol along with theoretical analysis of certain aspects of its behavior. We also describe a practical application of T-Man for building Chord distributed hash table overlays efficiently from scratch.