Making Application Layer Multicast Reliable is Feasible

Rong, Bin; Khalil, Ibrahim; Tari, Zahir

doi:10.1109/lcn.2006.322143

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lifetime of ALM nodes in overlay networks follow a power-law distribution [3].We use epidemic dynamic model to analyze ALM nodes failure statistical behavior, and model relationship between detection interval value and node failure according to hierarchical characteristics of overlay network, in order to find out more accurate scheme parameter standardized commendations.…”

Section: Introductionmentioning

confidence: 99%

A Dynamic Model of Hierarchical Application Layer Multicast Tree Node Failure Epidemic

Chen

2013

AMM

View full text Add to dashboard Cite

Failure Detection periodically detects node validity to maintain application layer network stability. The detection cycle interval value is a key parameter for detection scheme performance; there have been few studies on models of analyzing cycle interval value affecting the scheme. We propose a dynamic model of hierarchical application layer multicast tree node failure epidemic SIRS (NFE-SIRS). The NFE-SIRS analyzes statistical node failure in hierarchical application layer multicast tree structure, and models relationship between cycle interval value and detection scheme repair behavior, finally obtains the expected cycle interval value to improve detection scheme performance. Simulation shows that, the NFE-SIRS can dramatically improve detection scheme performance compared with common fixed cycle interval detection scheme.

show abstract

Section: Introductionmentioning

confidence: 99%

A Dynamic Model of Hierarchical Application Layer Multicast Tree Node Failure Epidemic

Chen

2013

AMM

View full text Add to dashboard Cite

show abstract

FaReCast: Fast, Reliable Application Layer Multicast for Flash Dissemination

Kim¹,

Mehrotra²,

Venkatasubramanian³

2010

Middleware 2010

View full text Add to dashboard Cite

Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in time-constrained flash dissemination scenarios, e.g. earthquake early warning, where time is of the essence, the tree-based ALM has a single point of failure; its reliable extensions using ack-based failure recovery protocols cannot support reliable dissemination in the timeframe needed. In this paper, we exploit path diversity, i.e. exploit the use of multiple data paths, to achieve fast and reliable data dissemination. First, we design a forest-based M2M (Multiple parents-To-Multiple children) ALM structure where every node has multiple children and multiple parents. The intuition is to enable lower dissemination latency through multiple children, while enabling higher reliability through multiple parents. Second, we design multidirectional multicasting algorithms that effectively utilize the multiple data paths in the M2M ALM structure. A key aspect of our reliable dissemination mechanism is that nodes, in addition to communicating the data to children, also selectively disseminate the data to parents and siblings. As compared to trees using traditional multicasting algorithm, we observe an 80% improvement in reliability under 20% of failed nodes with no significant increase in latency for over 99% of the nodes.

show abstract