Abstract
A solution to reduce the cost of multicast paths is presented, where the traffic is split over multiple paths to obtain an overall lower cost. Optimal conditions for this split operation are provided and two different algorithms are presented. The methods were shown to work on problems with many different types of simultaneous multicast traffic. Various experiments were conducted and the results showed that the new multicasting was fairly effective on the end-to-end quality of services.
This research was supported by Brain Korea 21 grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications, Prentice-Hall (1993)
Ammar, M.K., Cheung, S.Y., Scoglio, C.M.: Routing multipoint connections using virtual paths in an ATM networks, IEEE INFOCOM’ 93 (1993) 98–105
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, Wiley (1993)
Erickson, R. E., Monma, C. L., Veinott, A. F.: Send-and-split method for minimumconcave-cost network flows, Mathematics of Operations Research 12 (1987)
Garey, M.R, Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freedman and Company (1979)
Han, S.P.: A gobally convergent method for nonlinear programming, Journal of Optimization Theory and Applications 22 (1977) 297–309
Huitema, C.: Routing in the Internet, Prentice Hall (1995)
Kim, S.B.: An optimal VP-based multicast routing in ATM networks, IEEE INFOCOM’ 96 (1996) 1302–1309
Kleinrock, L.: Queueing Systems(Volume II): Computer Applications, Wiley (1976)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication, IEEE/ACM Transaction on Networking 1 (1993) 286–292
Kosiur, D.: IP Multicasting, Wiley, (1998)
Leung, Y.-W., Yang, B.-T: Lower bound for multimedia multicast routing, IEE Proc.-Commm. 145 (1998) 87–90
Mangasarian, O.L.: Nonlinear Programming Algorithm, Lecture Notes, Department of Computer Science, University of Wisconsin-Madison (1986)
Park, K., Shin, Y.-S.: Iterative bundle-based decomposition for large-scale nonseparable convex optimization, European Journal of Operational Research 111 (1998) 598–616
Parsa, M., Zhu, Q.: Garcia-Luna-Aceves, J.J., An iterative algorithm for delayconstrained minimum-cost multicasting, IEEE/ACM Transaction on Networking 6 (1998)
Rouskas, G. N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints, IEEE INFOCOM’ 96 (1996) 353–360
Schwartz, M.: Telecommunication Networks: Protocols, Modeling and Analysis, Addison Wesley (1988)
Takahashi, H., Matsuyama, A.: An approximation solution for the Steiner problem in graphs, Math. Japonica 24 (1980) 573–577
Waxman, B.M.: Routing of multipoint connections, IEEE Journal on Selected Areas in Communications 6 (1988) 1617–1622
Winter, P.: Steiner problem in networks: A survey, Networks 17 (1987) 129–167
Wong, R.T.: A dual ascent approach for Steiner tree problem on a directed graph, Mathematical Programming 28 (1984) 271–284
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, K., Yong-Sik, S., Hyun-Chan, L. (2001). Multicast Routing by Multiple Tree Routes. In: Marsan, M.A., Bianco, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2001. Lecture Notes in Computer Science, vol 1989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44554-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-44554-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41512-1
Online ISBN: 978-3-540-44554-8
eBook Packages: Springer Book Archive