Abstract
End System Multicasting (ESM) is fast becoming a feasible alternative to IP multicasting. ESM approaches can be broadly classified into two main categories: (i) Tree first approaches, where an overlay tree is constructed on the physical network, (ii) Mesh first approaches, where a mesh is constructed on the physical network and then a tree is created on the constructed mesh. In this paper, we propose a generic Mesh Tree Interaction (MTI) mechanism, which combines the management efficiency of the mesh first approaches and the performance benefits of the tree first approaches. To achieve this, MTI uses the concept of mesh and enables interactions between the mesh and the underlying multicast tree. Our simulation studies show that MTI results in significant improvement in the quality (average delay metric) of the multicast tree.
This research was supported in part by the NSF under grant ANI-0240433
Chapter PDF
Similar content being viewed by others
References
S. Deering, “Multicast Routing in Internetworks and extended lans,” in Proc. SIGGCOM, pp. 55–64, Aug. 1988.
C. Diot, B.N. Levine, B. Lyles, H. Kassem, and D. Balensiefen, “Deployment issues for the IP multicast service and architecture,” IEEE Network, pp.78–88, Jan./Feb. 2000.
P. Francis, “Yoid: Your own Internet Distribution,” www.aciri.org/yoid, Apr. 2000.
Y.-H. Chu, S. G. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet using an Overlay Multicasting Architecture,” in Proc. SIGGCOM, Aug. 2001.
S. Banerjee, B. Bhattacharya, and C. Kommareddy, “Scalable Application Layer Multicast,” in Proc. SIGGCOM, Aug. 2002.
D. Pendarakis, S. Shi, D. Verma, and M. Waldgovel, “ALMI: An Application Level Multicast Infrastructure,” in Proc. USENIX Symp. on Internet Technologies and Systems, Mar. 2001.
M. Castro, P. Druschel, A. M. Kermarrec, and A. Rowstron, “SCRIBE: A Large-scale and decentralized application-level multicast infrastructure,” in IEEE JSAC, vol. 20, no 8. , Oct. 2002.
N. Deo and S. L. Hakimi, “The shortest Generalized Hamiltonian Tree,” in Proc. Annual Allerton Conference, pp. 879–888, 1968.
G. Zhou and M. Gen, “Application to Degree Constrained Minimum Spanning Tree Problem using Genetic Algorithm,” in Engineering Design and Automation, vol. 3, no. 2, pp. 157–165, 1997.
G. Korsatzand D. Pelleg, “Generating Low-Degree 2-Spanners” in SIAM Journal on Computing, vol. 27, no. 5, pp. 1438–1456, Oct. 1998.
UCB/LBNL/VINT Network Simulator — ns (version 2), Available at www.isi.edu/nsnam/ns.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakrabarti, A., Manimaran, G. (2004). A Case for Mesh-Tree-Interaction in End System Multicasting. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive