An efficient algorithm for bandwidth-delay constrained least cost multicast routing

Rana Forsati, Mehrdad Mahdavi, Abolfazl Torghy Haghighat, Azadeh Ghariniyat

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

9 Citations (Scopus)

Abstract

The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. 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. In this paper we describe a new representation, called node parent index (NPI) representation, for representing trees and describe harmony operations accord to this representation. The presented algorithm is based on the harmony search (HS) algorithm and finds near-optimal solutions in polynomial time. We evaluate the performance and efficiency of the proposed method with a modified version of the bounded shortest multicast algorithm (BSMA) 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 publicationIEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008
Pages1641-1645
Number of pages5
DOIs
StatePublished - Sep 22 2008
EventIEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008 - Niagara Falls, ON, Canada
Duration: May 4 2008May 7 2008

Publication series

NameCanadian Conference on Electrical and Computer Engineering
ISSN (Print)0840-7789

Other

OtherIEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008
CountryCanada
CityNiagara Falls, ON
Period5/4/085/7/08

Fingerprint

Bandwidth
Quality of service
Costs
HIgh speed networks
Trees (mathematics)
Heuristic algorithms
Telecommunication links
Computational complexity
Polynomials

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Forsati, R., Mahdavi, M., Haghighat, A. T., & Ghariniyat, A. (2008). An efficient algorithm for bandwidth-delay constrained least cost multicast routing. In IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008 (pp. 1641-1645). [4564820] (Canadian Conference on Electrical and Computer Engineering). https://doi.org/10.1109/CCECE.2008.4564820
Forsati, Rana ; Mahdavi, Mehrdad ; Haghighat, Abolfazl Torghy ; Ghariniyat, Azadeh. / An efficient algorithm for bandwidth-delay constrained least cost multicast routing. IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008. 2008. pp. 1641-1645 (Canadian Conference on Electrical and Computer Engineering).
@inproceedings{6299bb2f5f60451bae0116943132c5d4,
title = "An efficient algorithm for bandwidth-delay constrained least cost multicast routing",
abstract = "The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. 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. In this paper we describe a new representation, called node parent index (NPI) representation, for representing trees and describe harmony operations accord to this representation. The presented algorithm is based on the harmony search (HS) algorithm and finds near-optimal solutions in polynomial time. We evaluate the performance and efficiency of the proposed method with a modified version of the bounded shortest multicast algorithm (BSMA) 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 = "Rana Forsati and Mehrdad Mahdavi and Haghighat, {Abolfazl Torghy} and Azadeh Ghariniyat",
year = "2008",
month = "9",
day = "22",
doi = "10.1109/CCECE.2008.4564820",
language = "English (US)",
isbn = "9781424416431",
series = "Canadian Conference on Electrical and Computer Engineering",
pages = "1641--1645",
booktitle = "IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008",

}

Forsati, R, Mahdavi, M, Haghighat, AT & Ghariniyat, A 2008, An efficient algorithm for bandwidth-delay constrained least cost multicast routing. in IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008., 4564820, Canadian Conference on Electrical and Computer Engineering, pp. 1641-1645, IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008, Niagara Falls, ON, Canada, 5/4/08. https://doi.org/10.1109/CCECE.2008.4564820

An efficient algorithm for bandwidth-delay constrained least cost multicast routing. / Forsati, Rana; Mahdavi, Mehrdad; Haghighat, Abolfazl Torghy; Ghariniyat, Azadeh.

IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008. 2008. p. 1641-1645 4564820 (Canadian Conference on Electrical and Computer Engineering).

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

TY - GEN

T1 - An efficient algorithm for bandwidth-delay constrained least cost multicast routing

AU - Forsati, Rana

AU - Mahdavi, Mehrdad

AU - Haghighat, Abolfazl Torghy

AU - Ghariniyat, Azadeh

PY - 2008/9/22

Y1 - 2008/9/22

N2 - The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. 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. In this paper we describe a new representation, called node parent index (NPI) representation, for representing trees and describe harmony operations accord to this representation. The presented algorithm is based on the harmony search (HS) algorithm and finds near-optimal solutions in polynomial time. We evaluate the performance and efficiency of the proposed method with a modified version of the bounded shortest multicast algorithm (BSMA) 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 - The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. 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. In this paper we describe a new representation, called node parent index (NPI) representation, for representing trees and describe harmony operations accord to this representation. The presented algorithm is based on the harmony search (HS) algorithm and finds near-optimal solutions in polynomial time. We evaluate the performance and efficiency of the proposed method with a modified version of the bounded shortest multicast algorithm (BSMA) 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=51849090691&partnerID=8YFLogxK

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

U2 - 10.1109/CCECE.2008.4564820

DO - 10.1109/CCECE.2008.4564820

M3 - Conference contribution

AN - SCOPUS:51849090691

SN - 9781424416431

T3 - Canadian Conference on Electrical and Computer Engineering

SP - 1641

EP - 1645

BT - IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008

ER -

Forsati R, Mahdavi M, Haghighat AT, Ghariniyat A. An efficient algorithm for bandwidth-delay constrained least cost multicast routing. In IEEE Canadian Conference on Electrical and Computer Engineering, Proceedings, CCECE 2008. 2008. p. 1641-1645. 4564820. (Canadian Conference on Electrical and Computer Engineering). https://doi.org/10.1109/CCECE.2008.4564820