Abstract
In this paper, we present a new approximation algorithm called OPSAM (Optimal Path Selection Algorithm for Multicast) for the static multicast routing problem and the newly defined mobile multicast routing problem. Given a graph with the cost and the delay associated to each edge, a source node, a destination node set, and a delay time limit, the first problem requires finding a multicast tree such that the total cost is not only minimized, but also the delay along any path from the source to a destination does not exceed its limit. OPSAM first extracts plural path candidates for each destination to satisfy the delay constraint simultaneously. Then, it iteratively selects better paths among candidates for finding a low-cost tree within a short computation time. The performance of OPSAM is verified through simulations in Waxman model and Tiers model, where OPSAM is better than the best existing algorithm BSMA, especially for Tiers model instances. The second problem requires finding a sequence of multicast trees to follow changes of mobile user locations, such that the sum of total tree costs and the difference between two consecutive trees is minimized. The simulation results show the performance of OPSAM is better than BSMA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
V. P. Kompella, J. C. Pasquale and G. C. Polyzos, “Multicast routing for multimedia communication”, IEEE/ACM Trans. Networking, Vol. 1, No. 3, pp. 286–292(1993).
R. Sriram, G. Manimaran and C. Siva Ram Murthy, “Algorithms for delay-constrained low-cost multicast tree construction”, Computer Commun., Vol. 21, pp. 1693–1706(1998).
M. Parsa, Q. Zhu and J. J. Garcia-Luna-Aceves, “An iterative algorithm for delay-constrained minimum-cost multicasting”, IEEE/ACM Trans. Networking, Vol. 6, No. 4, pp. 461–474(1998).
X. Jia, “A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks”, IEEE/ACM Trans. Networking, Vol. 6, No. 6, pp. 828–837(1998).
Q. Zhang and Yiu-Wing Leung, “An orthogonal genetic algorithm for multimedia multicast routing”, IEEE Trans. Evolutionary Computation, Vol. 3, No. 1, pp. 53–62(1999).
B. M. Waxman, “Routing of multipoint connections”, IEEE J. Select. Areas. Commun., Vol. 6, pp. 1617–1622(1988).
K. L. Calvert, M. B. Doar and E. W. Zegura, “Modeling Internet Topology”, IEEE Commun. Magazine, June, pp. 160–163(1997).
M. B. Doar, “A Better Model for Generating Test Networks”, Proc. GLOBECOM’ 96 (1996).
H. F. Salama, D. S. Reeves and Y. Viniotis, “Evaluation of multicast routing algorithms for real-time communication on high-speed networks”, IEEE J. Select. Areas. Commun., Vol. 15, No. 3, pp. 332–345(1997).
T. Baba, N. Funabiki, and S. Nishikawa, “A proposal of a greedy neural network for route assignments in multihop radio networks”, IEICE Trans., Vol. J81-D-I, No. 6, pp700–707(1998).
T. H. Cormen, C. H. Leiserson and R. L. Rivest, “Introduction to algorithms”, MIT press(1990).
M. B. Doar, “A Random Network Topology Generator”, http://www.pobox.com/~doar/.
C.-C. Tseng, K.-H. Chi, and T.-L. Huang, “A new locality-based IP multicasting scheme for mobile hosts”, Computer Communications, Vol. 24, pp. 486–495(2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tajima, S., Fujii, M., Funabiki, N., Yokohira, T., Tsunemura, K., Higashino, T. (2002). An Optimal Path Selection Algorithm for Static and Mobile Multicast Routing Problems. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_18
Download citation
DOI: https://doi.org/10.1007/3-540-45803-4_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44256-1
Online ISBN: 978-3-540-45803-6
eBook Packages: Springer Book Archive