Skip to main content
SpringerLink
Log in

A GRASP heuristic for the delay-constrained multicast routing problem

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

The increasing development of real-time multimedia network applications, many of which require multiple participants, has created the need for efficient multicast routing algorithms. Examples of such applications include video and tele-conferencing, video-on-demand, tele-medicine, distance education, etc. Several of them require multicasting with a certain Quality of Service (QoS) with respect to elements such as delay or bandwidth. This paper deals with Delay-Constrained Multicast Routing (DCMR) where the maximum end-to-end delay in a multicast session is bounded. The DCMR problem can be reduced to the Constrained Minimum Steiner Tree Problem in Graphs (CMStTG) which has been proven to be NP-complete. As a result, several heuristics have been developed to help solve it. In this paper, we developed a GRASP heuristic for the DCMR problem. Computational experiments on medium sized problems (50-100 nodes) from literature and comparison with existing algorithms have shown that the suggested GRASP heuristic is superior in quality for this set of problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T.H. Cormen, C.E. Leiserson and R.L. Revest, Introduction to Algorithms, (Cambridge: MIT Press, 1997).

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  Google Scholar 

  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).

Download references

Author information

Authors and Affiliations

  1. Department of Telecommunications, Faculty of Electrical Engineering and Computing, University of Zagreb, 10000, Zagreb, Croatia

    Nina Skorin-Kapov & Mladen Kos

Authors
  1. Nina Skorin-Kapov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mladen Kos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nina Skorin-Kapov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skorin-Kapov, N., Kos, M. A GRASP heuristic for the delay-constrained multicast routing problem. Telecommun Syst 32, 55–69 (2006). https://doi.org/10.1007/s11235-006-8202-2

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-006-8202-2

Keywords

Search

Navigation