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 - Dec 1 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
CountryIran, Islamic Republic of
CityKish Island
Period3/9/083/11/08

Fingerprint

Heuristic algorithms
Quality of service
Bandwidth
Communication
Telecommunication links
Costs
Computational complexity

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Mahdavi, M., Forsati, R., & Movaghar, A. (2008). Bandwidth-delay constrained least cost multicast routing for multimedia communication. In Advances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers (pp. 737-740). (Communications in Computer and Information Science; Vol. 6 CCIS). https://doi.org/10.1007/978-3-540-89985-3_92
Mahdavi, Mehrdad ; Forsati, Rana ; Movaghar, Ali. / Bandwidth-delay constrained least cost multicast routing for multimedia communication. Advances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers. 2008. pp. 737-740 (Communications in Computer and Information Science).
@inproceedings{0a37201cd75c4e5581649ecd36aecb73,
title = "Bandwidth-delay constrained least cost multicast routing for multimedia communication",
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.",
author = "Mehrdad Mahdavi and Rana Forsati and Ali Movaghar",
year = "2008",
month = "12",
day = "1",
doi = "10.1007/978-3-540-89985-3_92",
language = "English (US)",
isbn = "3540899847",
series = "Communications in Computer and Information Science",
pages = "737--740",
booktitle = "Advances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers",

}

Mahdavi, M, Forsati, R & Movaghar, A 2008, Bandwidth-delay constrained least cost multicast routing for multimedia communication. in Advances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers. Communications in Computer and Information Science, vol. 6 CCIS, pp. 737-740, 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, Iran, Islamic Republic of, 3/9/08. https://doi.org/10.1007/978-3-540-89985-3_92

Bandwidth-delay constrained least cost multicast routing for multimedia communication. / Mahdavi, Mehrdad; Forsati, Rana; Movaghar, Ali.

Advances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers. 2008. p. 737-740 (Communications in Computer and Information Science; Vol. 6 CCIS).

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

TY - GEN

T1 - Bandwidth-delay constrained least cost multicast routing for multimedia communication

AU - Mahdavi, Mehrdad

AU - Forsati, Rana

AU - Movaghar, Ali

PY - 2008/12/1

Y1 - 2008/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=78449249731&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78449249731&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89985-3_92

DO - 10.1007/978-3-540-89985-3_92

M3 - Conference contribution

AN - SCOPUS:78449249731

SN - 3540899847

SN - 9783540899846

T3 - Communications in Computer and Information Science

SP - 737

EP - 740

BT - Advances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers

ER -

Mahdavi M, Forsati R, Movaghar A. Bandwidth-delay constrained least cost multicast routing for multimedia communication. In Advances in Computer Science and Engineering - 13th International CSI Computer Conference, CSICC 2008, Revised Selected Papers. 2008. p. 737-740. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-540-89985-3_92