Advanced SearchSearch Tips
Overlay Multicast considering Fast Path Recovery
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Overlay Multicast considering Fast Path Recovery
Gu, Myeong-Mo; Kim, Bong-Gi;
  PDF(new window)
The rapid reconstruction of a transfer path is caused by frequent secession of nodes in many applications using overlay multicast. For this, however, many studies have been proposed, but a study of fast path recovery is required. This paper proposes a new method for fast path recovery to improve the path reconstruction time and for stable path maintain caused by the sudden secession of the parent node on overlay multicast. The proposed method uses the virtual transfer path and the candidate parent node for the fast path recovery. All nodes exchange periodically the RTT (Round Trip Time) information between the other nodes of similar position itself and neighboring node. All nodes have a candidate parent node list, and each node stores the exchanged RTT information on the list. Each node constructs the virtual transfer path to reduce the recovery time after deciding a candidate parent node that is one of them by the RTT order. In this way, when the parent node is seceded, all nodes can recover the transfer path quickly using the virtual transfer path. The simulation result showed that the recovery time of the proposed method is an average 30% faster than the known method.
Candidate Parent;Fast Path Recovery;IP Multicast;Overlay Multicast;RTT;
 Cited by
Arjan Durresi and Raj Jain, "Source Adaptive Net work Driven Layered Multicast," Invited submission to Computer Communications, pp. 15, June 2003.

Shuju Wu and Banerjee, S., "Improving the Performance of Overlay Multicast with Dynamic Adaptation," Consumer Communications and Networking Conference, First IEEE, pp. 152-157, CCNC 2004.

J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole Jr, "Overcast: Reliable Multicasting with an Overlay Network," In Proceedings of the Fourth Symposium on Operating System Design and Implementation(OSDI), pp. 197-212, October 2000.

Z. Li and P. Mohapatra, "Hostcast: A new overlay multicasting protocol," in Proceeding of IEEE International Conference on Communications, 2003.

De Nian Yang, and Wanjiun Liao,"On Bandwidth Efficient Overlay Multicast,," IEEE Trans on PDS, Vol. 18 No. 11, 2007.

L. Ramaswamy, B. Gedik and Ling Liu, "A Dis tributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks," IEEE Trans on PDS, Vol. 16 No. 9, 2005.

Hemant Gupta, and Rashmi Sharma, "Improvement in the arrangement of Overlay Multicast Networks in terms of Financially," International Journal of Application or Innovation in Engineering & Management (IJAIEM), Volume 1, Issue 1, September 2012.

K.-T. Rho, J.-J. Kang, "Route Optimization Scheme in Nested NEMO Environment based on Prefix Delegation," The Journal of The Institute of Internet, Broadcasting and Communication (IIBC), vol. 8, no. 5, pp. 95-103, 2008.

J.-H. Lee, J.-W. Cho, J.-Y. Lee, H.-S. Lee, S.-K. Park, "Performance Comparison of Mobile Ad Hoc Multicast Routing Protocols," The Journal of The Institute of Internet, Broadcasting and Communication (IIBC), vol. 8, no. 5, pp. 173-179, 2008.

Le The Dung, Beongku An, "A Mesh Scheme for Efficient Multicast Service in Mobile Ad-hoc Networks," The Journal of The Institute of Internet, Broadcasting and Communication (IIBC), vol. 11, no. 3, pp. 31-39, 2011.