Abstract
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed method, Prüfer number is used for genotype representation. Some novel heuristic algorithms are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed GA-based algorithm in comparison with other existing heuristic and GA-based algorithms by the result of simulation. This proposed algorithm has overcome all of the previous algorithms in the literatures.
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
S. L. Hakimi: Steiner problem in graphs and its implications, Networks, Vol. 1, (1971) 113–133.
R. Karp: Reducibility among combinatorial problems, in: R. E. Miller, J. W. Thatcher, Complexity of computer computations, Plenum Press, New York, (1972) 85–103.
M. Parsa, Q. Zhu, J.J. Garcia-Luna-Aceves: An iterative algorithm for delay-constrained minimum-cost multicasting, IEEE/ACM Transactions on Networking, Vol. 6, No. 4, (1998) 461–474.
V.P. Kompella, J.C. Pasquale, G.C. Polyzos: Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, Vol. 1, No. 3, (1993) 286–292.
R. Widyono: The design and evaluation of routing algorithms for real-time channels, Technical Reports TR-94-024, Tenet Group, Dept. of EECS, University of California at Berkeley, (1994).
A. G. Waters: A new heuristic for ATM multicast routing, 2nd IFIP Workshop on Performance Modeling and Evaluation of ATM networks, (1994).
L. Kou, G. Markowsky L. Berman: A fast algorithm for steiner trees, Acta Informatica, Vol. 15, (1981) 141–145.
V. Rayward-smith: The computation of nearly minimal steiner trees in graphs, International Journal of Mathematical Education in Science and Technology, Vol. 14, No. 1, (1983) 15–23.
H. Takahashi, A. Matsuyama: An approximate solution for the Steiner problem in graphs, Mathematica Japonica, Vol. 22, No. 6, (1980) 573–577.
E. Gelenbe, A. Ghanwani, V. Srinivasan: Improved neural heuristics for multicast routing, IEEE Journal of selected Area in Communication, Vol. 15, No. 2, (1997) 147–155.
Q. Sun, H. Langendörfer: An efficient delay-constrained multicast routing algorithm, Journal of High-Speed Networks, Vol. 7, No. 1, (1998) 43–55.
H.F. Salama, D.S. Reeves, Y. Viniotis: Evaluation of multicast routing algorithms for realtime communication on high-speed networks, IEEE Journal on Selected Areas in Communications, Vol. 15, No. 3, (1997) 332–345.
J. Hesser, R. Männer, O. Stucky: Optimization of Steiner trees using genetic algorithms, Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA, (1989) 231–236.
B.A. Julstrom: A genetic algorithm for the rectilinear Steiner problem, Proceedings of the 5th International Conference on Genetic Algorithms, (1993) 474–480.
A. Kapsalis, V.J. Rayward-Smith, G.D. Smith: Solving the graphical Steiner tree problem using genetic algorithms, Journal of the Operational Research Society, Vol. 44, No. 4, (1993) 397–406.
H. Esbensen: Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm, Networks, Vol. 26, (1995) 173–185.
Y. Leung, G. Li, Z.B. Xu: A genetic algorithm for the multiple destination routing problems, IEEE Transactions on Evolutionary Computation, Vol. 2, No. 4, (1998) 150–161.
Q. Sun: A genetic algorithm for delay-constrained minimum-cost multicasting, Technical Report, IBR, TU Braunschweig, Butenweg, 74/75, 38106, Braunschweig, Germany, (1999).
F. Xiang, L. Junzhou, W. Jieyi, G. Guanqun: QoS routing based on genetic algorithm, Computer Communications, Vol. 22, (1999) 1394–1399.
C.P. Ravikumar, R. Bajpai: Source-based delay-bounded multicasting in multimedia networks, Computer Communications, Vol. 21, (1998) 126–132.
Q. Zhang, Y.W. Lenug: An orthogonal genetic algorithm for multimedia multicast routing, IEEE Transactions on Evolutionary Computation, Vol. 3, No. 1, (1999) 53–62.
J. J. Wu, R. H. Hwang, H. I. Lu: Multicast routing with multiple QoS constraints in ATM networks, Information Sciences, Vol. 124, (2000) 29–57.
Z. Wang, B. Shi, E. Zhao: Bandwidth-delay-constrainted least-cost multicast routing based on heuristic genetic algorithm, Computer Communications, Vol. 24, (2001) 685–692.
G. Zhou, M. Gen: An effective genetic algorithm approach to the quadratic minimum spanning tree problem, Computers and operations research, Vol. 25, No. 3, (1998) 229–247.
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
Haghighat, A.T., Faez, K., Dehghan, M., Mowlaei, A., Ghahremani, Y. (2002). A Genetic Algorithm for Steiner Tree Optimization with Multiple Constraints Using Prüfer Number. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_32
Download citation
DOI: https://doi.org/10.1007/3-540-36087-5_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00028-0
Online ISBN: 978-3-540-36087-2
eBook Packages: Springer Book Archive