Neem: Network-Friendly Epidemic Multicast (original) (raw)
Related papers
Efficient epidemic-style protocols for reliable and scalable multicast
2000
Epidemic-style (gossip-based) techniques have recently emerged as a scalable class of protocols for peer-to-peer reliable multicast dissemination in large process groups. These protocols provide probabilistic guarantees on relia-bility and scalability. However, popular implementations of epidemic-style dissemination are reputed to suffer from two major drawbacks: (a) (Network Overhead) when de-ployed on a WAN-wide or VPN-wide scale they generate a large number
Efficient epidemic multicast in heterogeneous networks
2006
The scalability and resilience of epidemic multicast, also called probabilistic or gossip-based multicast, rests on its symmetry: Each participant node contributes the same share of bandwidth thus spreading the load and allowing for redundancy. On the other hand, the symmetry of gossiping means that it does not avoid nodes or links with less capacity. Unfortunately, one cannot naively avoid such symmetry without also endangering scalability and resilience.
Epidemic-based reliable and adaptive multicast for mobile ad hoc networks
Computer Networks, 2009
Mobile ad hoc networks Reliable multicast Adaptive Epidemic Bio-inspired Protocol design and analysis a b s t r a c t An emerging approach to distributed systems exploits the self-organization, autonomy and robustness of biological epidemics. In this article, we propose a novel bio-inspired protocol: EraMobile (Epidemic-based Reliable and Adaptive Multicast for Mobile ad hoc networks). We also present extensive performance analysis results for it. EraMobile supports group applications that require high reliability. The protocol aims to deliver multicast data reliably with minimal network overhead, even under adverse network conditions. With an epidemic-based multicast method, it copes with dynamic and unpredictable topology changes due to mobility. Our epidemic mechanism does not require maintaining any tree-or mesh-like structure for multicasting. It requires neither a global nor a partial view of the network, nor does it require information about neighboring nodes and group members. In addition, it substantially lowers overhead by eliminating redundant data transmissions. Another distinguishing feature is its ability to adapt to varying node densities. This lets it deliver data reliably in both sparse networks (where network connectivity is prone to interruptions) and dense networks (where congestion is likely). We describe the working principles of the protocol and study its performance through comparative and extensive simulations in the ns-2 network simulator.
Controlled Epidemic Routing for Multicasting in Delay Tolerant Networks
2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems, 2008
Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. DTN multicasting is a desirable feature for applications where some form of group communication is needed. The topological impairments experienced within a DTN pose unique challenges for designing effective DTN multicasting protocols. In this paper, we examine multicasting in DTNs using controlled flooding schemes. Specifically, we analyze basic multicast routing schemes for fundamental performance metrics such as message delivery ratio, message delay, and buffer occupancy. Further, we study the effects of different controlled Epidemic routing schemes using TTL and message expiration times. We provide analytical results for performance metrics and perform extensive evaluations of our proposed methods. Our experiments show that our analytical results are accurate and that with careful protocol parameter selection it is possible to achieve high delivery rates for various system scenarios.
Message Buffering in Epidemic Data Dissemination
2006 International Symposium on Computer Networks, 2006
In reliable group communication, epidemic or probabilistic protocols gained popularity due to their scalability to large number of peers and robustness against network failures. Reliability properties of these protocols are ensured via probabilistic guarantees. A key issue to consider when offering reliability is the buffer space used by individual peers of the group. Our aim is to optimize the buffer space while providing reliability in epidemic data dissemination protocols. We introduce a novel randomized model and compare it with a hashbased approach for buffer management. The effect of short and long term buffering of peers and the buffer size on delivery latency and reliability are considered. We compute the performance measures through simulations of large-scale application scenarios.
University of California at San Diego, La …, 1999
Rumor mongering (also known as gossip) is an epidemiological protocol that implements broadcasting with a reliability that can be very high. Rumor mongering is attractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the numb e r o f f a i l u r e s i n a r u n. However, rumor mongering uses random selection for communications. We study the impact of using random selection in this paper. We present a protocol that super cially resembles rumor mongering but is deterministic. We show that this new protocol has most of the same attractions as rumor mongering. The one attraction that rumor mongering has|namely graceful degradation|comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet and small wide area network of Ethernets.
Emergent structure in unstructured epidemic multicast
2007
Abstract In epidemic or gossip-based multicast protocols, each node simply relays each message to some random neighbors, such that all destinations receive it at least once with high probability. In sharp contrast, structured multicast protocols explicitly build and use a spanning tree to take advantage of efficient paths, and aim at having each message received exactly once. Unfortunately, when failures occur, the tree must be rebuilt.
Computer Networks, 2006
Transport level multicast protocols providing reliability and scalability properties are certainly essential building blocks for several distributed group applications. We consider the effect of reliable multicast transport mechanisms on traffic characteristics and hence network performance. Although self-similarity property of unicast traffic, in particular TCP, has been analyzed extensively, multicast traffic has not been incorporated from this perspective. In this study, we focus on traffic characterization of transport level reliable multicasting. In particular, we concentrate on two scalable and reliable multicast protocols as case studies, namely Bimodal Multicast and Scalable Reliable Multicast (SRM), and analyze the traffic generated by them. Our study consists of a complete simulation analysis supported by theoretical work, which shows that self-similarity is protocol dependent. We demonstrate that the Markovian character of Bimodal Multicast's epidemic loss recovery distinguishes an inherently superior protocol. It discretely feeds well-behaved traffic and copes with the existing self-similarity. On the other hand, the feedback controlled loss recovery mechanism of SRM triggers self-similarity. Drawing upon both theoretical and simulation analysis, our results substantiate that transport level can induce long-range dependence even in the absence of application/user level causes.
A simulation study of the performance of multicast protocols
1996
We have chosen to study multicast protocols because of their applicability to a growing number of network applications. We have designed and implemented a simulation system to study multicast protocols without the need for a dedicated testbed network, and used the simulator to study two simple multicast protocols, the stop and wait and block acknowledgment protocols. We found that these protocols outperform equivalent unicast protocols for small number of receivers in error-free conditions. The block acknowledgment protocol shows higher throughput with larger window sizes, but has greater latency. Both protocols, however, deteriorate quickly as the number of receivers and failure rate of the underlying-network grow. This deterioration is caused by a rising collision rate among receivers sending acknowledgments which in turn aggravates network congestion. Throughput of both protocols is improved by using randomly timed acknowledgments to reduce the collision rate; however, this techn...
A scalable reliable multicast transport protocol with advanced buffer management
2016
Many reliable multicast transport protocols have been proposed to achieve efficient scalabilities and reliabilities in the field of multicast transmission. Tree-based reliable multicast schemes are one of those protocols, which divide the multicast tree into sub-trees and allocate a single node ( known as repair node ) in each sub-tree to do the task of loss packet recovery. The repair node, in each sub-tree is used to buffer and retransmit the loss packets. There is a great deal of problems in buffering packets waiting for a long time until they get positive acknowledgments from all children receivers of the repair node’s sub-tree. The problem gets even worse when the number of children receivers under the repair node increase over a certain limit or during heavy transmission. In that case, a buffer overflow will certainly occur which creates network congestion, also the throughput, scalability and in general, the performance of the system will be greatly decreased. This work intro...