Abstract
We present a new paradigm for multicasting. Our paradigm combines two ideas: a simple distributed algorithm for automatically numbering network links with a small amount of numbers, and a novel forwarding method. We describe our paradigm in detail and discuss its benefits and drawbacks qualitatively and quantitatively.
Chapter PDF
Similar content being viewed by others
References
Jokela, P., Zahemszky, A., Rothenberg, C.E., Arianfar, S., Nikander, P.: LIPSIN: line speed publish/subscribe inter-networking. In: Proc. of SIGCOMM (2009)
Letchford, A.N., Lysgaard, J., Eglese, R.W.: A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. J. of the Operational Research Society 58(12), 1642–1651, 10 (2007)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15(2), 141–145 (1981)
Chen, W.-T., Sheu, P.-R., Chang, Y.-R.: Efficient multicast source routing scheme. Computer Communications 16(10), 662–666 (1993)
Yum, T.-S.P., Chen, M.S.: Multicast source routing in packet-switched networks. IEEE Transactions on Communications 42(234), 1212–1215 (1994)
Zhang, X., Wei, J.Y., Qiao, C.: Constrained Multicast Routing in WDM Networks with Sparse Light Splitting. J. of Lightwave Technology 18(12), 1917–1927 (2000)
Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32(3), 207–232 (1998)
Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: Solving the prize-collecting Steiner tree problem to optimality. In: Proc. of ALENEX workshop. SIAM, Philadelphia (2005)
Sharma, V., Hellstrand, F.: Framework for Multi-Protocol Label Switching (MPLS)-based Recovery, RFC 3469 (2003)
Doar, M., Leslie, I.: How Bad is Naive Multicast Routing? In: Proc. of INFOCOM (1993)
Barenboim, L., Elkin, M.: Distributed (Δ + 1)-coloring in linear (in Δ) time. In: Proc. of the 41st Symposium on Theory of Computing (2009)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD)Â 1(1) (2007)
Zhao, J., Zhu, P., Lu, X., Xuan, L.: Does the Average Path Length Grow in the Internet? In: Proc. of ICOIN (2007)
Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an internetwork. In: Proc. of INFOCOM (1996)
Yang, B., Mohapatra, P.: Edge router multicasting with MPLS traffic engineering. In: Proc. of ICON (2002)
Boudani, A., Cousin, B.: A New Approach to Construct Multicast Trees in MPLS Networks. In: Proc. of ISCC (2002)
Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Holopainen, V., Kantola, R., Taira, T., Lamminen, OP. (2010). Automatic Link Numbering and Source Routed Multicast. In: Stiller, B., De Turck, F. (eds) Mechanisms for Autonomous Management of Networks and Services. AIMS 2010. Lecture Notes in Computer Science, vol 6155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13986-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-13986-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13985-7
Online ISBN: 978-3-642-13986-4
eBook Packages: Computer ScienceComputer Science (R0)