TY - JOUR
T1 - Improving reliability for application-layer multicast overlays
AU - Tian, Ye
AU - Shen, Hong
AU - Ng, Kam Wing
N1 - Funding Information:
The authors would like to thank the anonymous reviewers for their constructive comments. This work is supported in part by the National Natural Science Foundation of China under grants 60533020 and 60772034, and the Chinese Academy of Sciences “100 Talents” Project.
PY - 2010
Y1 - 2010
N2 - Reliability of tree-like multicast overlays caused by nodes' abrupt failures is considered as one of the major problems for the Internet application-layer media streaming service [1]. In this paper, we address this problem by designing a distributed and light-weighted protocol named the instantaneous reliability oriented protocol (IRP). Unlike most of existing empirical solutions, we first define the overlay reliability problem formally, and propose a protocol containing a node joining algorithm (IRP-Join), a node preemption algorithm (IRP-Preempt), and a node switching algorithm (IRP-Switch) for reactively constructing and repairing the overlay, as well as proactively maintaining the overlay. With the formal problem presentation, we set up a paradigm for solving the overlay reliability problem by theoretically proving the effectiveness of our algorithms. Moreover, by comparing IRP with existing solutions via simulation-based experiments and real-world deployment, we show that IRP achieves a better reliability, while incurs fewer structural adjustments on the multicast overlay, thus, providing a superior overall performance.
AB - Reliability of tree-like multicast overlays caused by nodes' abrupt failures is considered as one of the major problems for the Internet application-layer media streaming service [1]. In this paper, we address this problem by designing a distributed and light-weighted protocol named the instantaneous reliability oriented protocol (IRP). Unlike most of existing empirical solutions, we first define the overlay reliability problem formally, and propose a protocol containing a node joining algorithm (IRP-Join), a node preemption algorithm (IRP-Preempt), and a node switching algorithm (IRP-Switch) for reactively constructing and repairing the overlay, as well as proactively maintaining the overlay. With the formal problem presentation, we set up a paradigm for solving the overlay reliability problem by theoretically proving the effectiveness of our algorithms. Moreover, by comparing IRP with existing solutions via simulation-based experiments and real-world deployment, we show that IRP achieves a better reliability, while incurs fewer structural adjustments on the multicast overlay, thus, providing a superior overall performance.
KW - Reliability
KW - algorithm/protocol design and analysis
KW - multicast
UR - http://www.scopus.com/inward/record.url?scp=77954310775&partnerID=8YFLogxK
U2 - 10.1109/TPDS.2009.166
DO - 10.1109/TPDS.2009.166
M3 - Article
AN - SCOPUS:77954310775
SN - 1045-9219
VL - 21
SP - 1103
EP - 1116
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
IS - 8
M1 - 5374385
ER -