Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Uniform generation of random regular graphs of moderate degree
Journal of Algorithms
The process group approach to reliable distributed computing
Communications of the ACM
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The asymptotic number of labeled graphs with n vertices, q edges, and no isolated vertices
Journal of Combinatorial Theory Series A
ACM Transactions on Computer Systems (TOCS)
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
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
The giant component threshold for random regular graphs with edge faults
Theoretical Computer Science
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Enabling conferencing applications on the internet using an overlay muilticast architecture
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Gossip versus Deterministically Constrained Flooding on Small Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
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
Lightweight Probabilistic Broadcast
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Generating random regular graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Resilient multicast using overlays
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed 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
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
End-Host Multicast Communication Using Switch-Trees Protocols
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Scattercast: an adaptable broadcast distribution framework
Multimedia Systems
Generating Random Regular Graphs Quickly
Combinatorics, Probability and Computing
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
IEEE Transactions on Dependable and Secure Computing
Evaluating unstructured peer-to-peer lookup overlays
Proceedings of the 2006 ACM symposium on Applied computing
Structure management for scalable overlay service construction
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Defending financial infrastructures through early warning systems: the intelligence cloud approach
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Correctness of gossip-based membership under message loss
Proceedings of the 28th ACM symposium on Principles of distributed computing
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Correctness of Gossip-Based Membership under Message Loss
SIAM Journal on Computing
XL peer-to-peer pub/sub systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This paper presents Araneola (Araneola means ''little spider'' in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully distributed manner, while incurring constant load (in terms of message and space complexity) on each node. For a tunable parameter k=3, Araneola constructs and dynamically maintains a basic overlay structure in which each node's degree is either k or k+1, and roughly 90% of the nodes have degree k. Empirical evaluation shows that Araneola's basic overlay achieves three important mathematical properties of k-regular random graphs (i.e., random graphs in which each node has exactly k neighbors) with N nodes: (i) its diameter grows logarithmically with N; (ii) it is generally k-connected; and (iii) it remains highly connected following random removal of linear-size subsets of edges or nodes. The overlay is constructed and maintained at a low cost: each join, leave, or failure is handled locally, and entails the sending of only about 3k messages in total, independent of N. Moreover, this cost decreases as the churn rate increases. The low degree of Araneola's basic overlay structure allows for allocating plenty of additional bandwidth for specific application needs. In this paper, we give an example for such a need - communicating with nearby nodes; we enhance the basic overlay with additional links chosen according to geographic proximity and available bandwidth. We show that this approach, i.e., a combination of random and nearby links, reduces the number of physical hops messages traverse without hurting the overlay's robustness, as compared with completely random Araneola overlays (in which all the links are random) with the same average node degree. Given Araneola's overlay, we sketch out several message dissemination techniques that can be implemented on top of this overlay. We present a full implementation and evaluation of a gossip-based multicast scheme, with up to 10,000 nodes. We show that compared with a (non-overlay-based) gossip-based multicast protocol, gossiping over Araneola achieves substantial improvements in load, reliability, and latency.