A GRASP heuristic for the delay-constrained multicast routing problem

Telecommunication Systems

Volumn 32, Issue 1, 2006, Pages 55-69

  Skorin Kapov, Nina ^a   Kos, Mladen ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Constrained steiner tree; GRASP; Multicast; QoS

Indexed keywords

ALGORITHMS; BANDWIDTH; MULTICASTING; QUALITY OF SERVICE; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

CONSTRAINED STEINER TREE; DELAY-CONSTRAINED MULTICAST ROUTING (DCMR); GRASP;

HEURISTIC METHODS;

EID: 33744521791     PISSN: 10184864     EISSN: 15729451     Source Type: Journal    
DOI: 10.1007/s11235-006-8202-2     Document Type: Article

References (13)

1. T.H. Cormen, C.E. Leiserson and R.L. Revest, Introduction to Algorithms, (Cambridge: MIT Press, 1997).
2. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, (San Francisco Freeman, 1979).
3. B.K. Haberman and G. Rouskas, Cost, Delay, and Delay Variation Concious Multicast Routing, Technical Report TR/97/03, North Carolina State University (1997).
4. T. Koch, A. Martin and S. Voß, SteinLib: An updated library on steiner tree problems in graphs. (2001) Available online at: http://elib.zib.de/steinlib.
5. V.P. Kompella, J.C. Pasquale and G.C. Plyzos, Multicast routing problems, IEEE/ACM Trans. on Networking 1(3) (1993) 286-292.
6. S.L. Martins et al., Greedy randomized adaptive search procedures for the Steiner problem in graphs, in Randomization Methods in Algorithmic Design, Volume 43 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. (Eds.), P.M. Pardalos, S. Rajasejaran and J.Rolim (American Mathematical Society 1999).
7. S.L. Martins et al., A parallel GRASP for the steiner tree problem in graphs using a hybrid local search strategy, Journal of Global Optimization, 17 (2000) 267-283.
8. M.G.C. Resende and C.C. Ribeiro, Greedy randomized search procedures. In Handbook of Metaheuristics (Eds.), F. Glover and G. Kochenberger, (Kluwer Academic Publishers 2003).
9. C.C. Ribeiro, E. Uchoa and R.F. Werneck, A hybrid GRASP with perturbations for the Steiner problem in graphs, INFORMS Journal on Computing 14(2002) 228-246.
10. N. Skorin-Kapov and M. Kos, The application of steiner trees to delay/constrained multicast routing: A tabu search approach, in: Proc. Of Contel2003-Conference on Telecommunications, (Zagreb 2003).
11. Q. Zhang and Y.W. Leung, An orthogonal genetic algorithm for multimedia multicast routing, IEEE Trans. on Evolutionary Computation 3(1) (1999) 53-61.
12. X. Zhou, C. Chen and G. Zhu, A genetic algorithm for multicasting routing problem, in: Proceedings of International Conference on Communication Technologies (ICCT2000), (Beijing, 2000).
13. Q. Zhu, M. Parsa and J.J. Garcia-Luna-Aceves, A source based algorithm for delay-constrained minimum-cost multicasting, in: Proceedings of IEEE INFOCOM, (Boston, MA 1995).