Improving Fault Resilience and Reconstruction of Overlay Multicast Tree Using Leaving Time of Participants
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32797
Improving Fault Resilience and Reconstruction of Overlay Multicast Tree Using Leaving Time of Participants

Authors: Bhed Bahadur Bista

Abstract:

Network layer multicast, i.e. IP multicast, even after many years of research, development and standardization, is not deployed in large scale due to both technical (e.g. upgrading of routers) and political (e.g. policy making and negotiation) issues. Researchers looked for alternatives and proposed application/overlay multicast where multicast functions are handled by end hosts, not network layer routers. Member hosts wishing to receive multicast data form a multicast delivery tree. The intermediate hosts in the tree act as routers also, i.e. they forward data to the lower hosts in the tree. Unlike IP multicast, where a router cannot leave the tree until all members below it leave, in overlay multicast any member can leave the tree at any time thus disjoining the tree and disrupting the data dissemination. All the disrupted hosts have to rejoin the tree. This characteristic of the overlay multicast causes multicast tree unstable, data loss and rejoin overhead. In this paper, we propose that each node sets its leaving time from the tree and sends join request to a number of nodes in the tree. The nodes in the tree will reject the request if their leaving time is earlier than the requesting node otherwise they will accept the request. The node can join at one of the accepting nodes. This makes the tree more stable as the nodes will join the tree according to their leaving time, earliest leaving time node being at the leaf of the tree. Some intermediate nodes may not follow their leaving time and leave earlier than their leaving time thus disrupting the tree. For this, we propose a proactive recovery mechanism so that disrupted nodes can rejoin the tree at predetermined nodes immediately. We have shown by simulation that there is less overhead when joining the multicast tree and the recovery time of the disrupted nodes is much less than the previous works. Keywords

Keywords: Network layer multicast, Fault Resilience, IP multicast

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1060060

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1342

References:


[1] L. Lao, J.-H. Cui, M. Gerla, and S. Chen, "A scalable overlay multicast architecture for large-scale applications," IEEE Trans. Parallel Distrib. Syst., vol. 18, no. 4, pp. 449-459, 2007.
[2] Y. Zhu, M.-Y. Wu, and W. Shu, "Comparison study and evaluation of overlay multicast networks," in Proceedings of the 2003 International Conference on Multimedia and Expo (ICME -03), 2003, pp. 493-496.
[3] Y.-h. Chu, S. G. Rao, and H. Zhang, "A case for end system multicast (keynote address)," in SIGMETRICS -00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. New York, NY, USA: ACM, 2000, pp. 1-12.
[4] B. Williamson, Developing IP Multicast Networks Volume I. Cisco Press, 2000.
[5] L. H. Sahasrabuddhe and B. Mukhergee, "Multicast routing algorithms and protocols: A tutorial," IEEE Network, vol. 14, no. 1, pp. 90-102, Jan/Feb 2000.
[6] C. Diot, B. N. Levine, B. Lyles, H. Kassem, and D. Balensiefen, "Deployment issues for the ip multicast service and architecture," IEEE Network, vol. 14, no. 1, pp. 78-88, Jan/Feb 2000.
[7] S. Birrer and F. E. Bustamante, "A comparison of resilient overlay multicast approaches," IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, vol. 25, no. 9, pp. 1695-1705, Dec. 2007.
[8] M. Guo and M. H. Ammar, "Scalable live video streaming to cooperative clients using time shifting and video patching," in Proc. IEEE INFOCOM 2004. Hong Kong: IEEE, 11 2004, pp. 1501-1511.
[9] S. Birrer, D. Lu, F. E. Bustamante, Y. Qiao, and P. Dinda, "Fatnemo: Building a resilient multi-source multicast fat-tree," in Proc. Ninth Int-l Workshop Web Content Caching and Distribution (WCW 2004). LNCS, Sept. 2004, pp. 182-196.
[10] V. N. Padmanabhan, H. J. Wang, P. A. Chou, and K. Sripanidkulchai, "Distributing streaming media content using cooperative networking," in NOSSDAV -02: Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video. New York, NY, USA: ACM, 2002, pp. 177-186.
[11] D. A. Tran, K. A. Hua, and T. T. Do, "A peer-to-peer architecture for media streaming," IEEE J. Selected Areas in Comm. (JSAC), vol. 22, no. 1, pp. 121-133, Jan. 2004.
[12] K. Sripanidkulchai, B. Maggs, and H. Zhang, "An analysis of live streaming workloads on the internet," in IMC -04: Proceedings of the 4th ACM SIGCOMM conference on Internet measurement. NewYork, NY, USA: ACM, 2004, pp. 41-54.
[13] K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang, "The feasibility of supporting large-scale live streaming applications with dynamic application end-points," in SIGCOMM -04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications. New York, NY, USA: ACM, 2004, pp. 107-120.
[14] M. Bawa, H. Deshpande, and H. Garcia-Molina, "Transience of peers & streaming media," SIGCOMM Comput. Commun. Rev., vol. 33, no. 1, pp. 107-112, 2003.
[15] S. Banerjee, S. Lee, B. Bhattacharjee, and A. Srinivasan, "Resilient multicast using overlays," SIGMETRICS Perform. Eval. Rev., vol. 31, no. 1, pp. 102-113, 2003.
[16] Y. Tian, D. Wu, G. Sun, and K.-W. Ng, "Improving stability for peer-topeer multicast overlays by active measurements," J. Syst. Archit., vol. 54, no. 1-2, pp. 305-323, 2008.
[17] PPLive, .
[18] Z. Fei and M. Yang, "A proactive tree recovery mechanism for resilient overlay multicast," IEEE/ACM Trans. Netw., vol. 15, no. 1, pp. 173-186, 2007.
[19] G. Tan and S. A. Jarvis, "Improving the fault resilience of overlay multicast for media streaming," IEEE Trans. Parallel Distrib. Syst., vol. 18, no. 6, pp. 721-734, 2007.