Bandwidth-delay constrained least cost multicast routing for multimedia communication

Mehrdad Mahdavi, Rana Forsati, Ali Movaghar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A new meta-heuristic algorithm is proposed for constructing multicast trees in real-time multimedia applications such that satisfies two important Quality of Service (QoS) constraints. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree. We evaluate the performance and efficiency of the proposed method with a modified version of the BSMA algorithm which is the best known deterministic heuristic algorithm to delay-constrained multicast problem. Simulation results reveal that the proposed algorithm can achieve a smaller average tree costs than modified BSMA with a much smaller running time for relatively large networks.

Original languageEnglish (US)
Title of host publicationAdvances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers
Pages737-740
Number of pages4
DOIs
StatePublished - 2008
Event13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008 - Kish Island, Iran, Islamic Republic of
Duration: Mar 9 2008Mar 11 2008

Publication series

NameCommunications in Computer and Information Science
Volume6 CCIS
ISSN (Print)1865-0929

Other

Other13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008
Country/TerritoryIran, Islamic Republic of
CityKish Island
Period3/9/083/11/08

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Mathematics

Cite this