A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria

Li Chen, Guoliang Xue, Byung S. Lee

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

Abstract

A delay-scaling multicast algorithm (DSMCA) is presented for minimum-cost multicast tree construction that also considers end-to-end delays along the paths from the source to each multicast group member. This problem is known to be NP-complete. Our heuristic has a time complexity of O(D 2p 2n 2 lg n), where n is the number of nodes in the network, p is the number of destinations in the multicast session, and D is the delay constraint. Our simulation results show that DSMCA on the average produces trees with lower cost than other known heuristics.

Original languageEnglish (US)
Title of host publicationProceedings of the Joint Conference on Information Sciences
EditorsJ.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar
Pages319-323
Number of pages5
Volume6
StatePublished - 2002
EventProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States
Duration: Mar 8 2002Mar 13 2002

Other

OtherProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
CountryUnited States
CityResearch Triange Park, NC
Period3/8/023/13/02

Fingerprint

Quality of service
Costs

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Chen, L., Xue, G., & Lee, B. S. (2002). A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria. In J. H. Caulfield, S. H. Chen, H. D. Cheng, R. Duro, J. H. Caufield, S. H. Chen, H. D. Cheng, R. Duro, ... V. Honavar (Eds.), Proceedings of the Joint Conference on Information Sciences (Vol. 6, pp. 319-323)

A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria. / Chen, Li; Xue, Guoliang; Lee, Byung S.

Proceedings of the Joint Conference on Information Sciences. ed. / J.H. Caulfield; S.H. Chen; H.D. Cheng; R. Duro; J.H. Caufield; S.H. Chen; H.D. Cheng; R. Duro; V. Honavar. Vol. 6 2002. p. 319-323.

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

Chen, L, Xue, G & Lee, BS 2002, A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria. in JH Caulfield, SH Chen, HD Cheng, R Duro, JH Caufield, SH Chen, HD Cheng, R Duro & V Honavar (eds), Proceedings of the Joint Conference on Information Sciences. vol. 6, pp. 319-323, Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002, Research Triange Park, NC, United States, 3/8/02.
Chen L, Xue G, Lee BS. A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria. In Caulfield JH, Chen SH, Cheng HD, Duro R, Caufield JH, Chen SH, Cheng HD, Duro R, Honavar V, editors, Proceedings of the Joint Conference on Information Sciences. Vol. 6. 2002. p. 319-323
Chen, Li ; Xue, Guoliang ; Lee, Byung S. / A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria. Proceedings of the Joint Conference on Information Sciences. editor / J.H. Caulfield ; S.H. Chen ; H.D. Cheng ; R. Duro ; J.H. Caufield ; S.H. Chen ; H.D. Cheng ; R. Duro ; V. Honavar. Vol. 6 2002. pp. 319-323
@inproceedings{0c28917cabbd409f9fdc42dee4c34db6,
title = "A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria",
abstract = "A delay-scaling multicast algorithm (DSMCA) is presented for minimum-cost multicast tree construction that also considers end-to-end delays along the paths from the source to each multicast group member. This problem is known to be NP-complete. Our heuristic has a time complexity of O(D 2p 2n 2 lg n), where n is the number of nodes in the network, p is the number of destinations in the multicast session, and D is the delay constraint. Our simulation results show that DSMCA on the average produces trees with lower cost than other known heuristics.",
author = "Li Chen and Guoliang Xue and Lee, {Byung S.}",
year = "2002",
language = "English (US)",
isbn = "0970789017",
volume = "6",
pages = "319--323",
editor = "J.H. Caulfield and S.H. Chen and H.D. Cheng and R. Duro and J.H. Caufield and S.H. Chen and H.D. Cheng and R. Duro and V. Honavar",
booktitle = "Proceedings of the Joint Conference on Information Sciences",

}

TY - GEN

T1 - A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria

AU - Chen, Li

AU - Xue, Guoliang

AU - Lee, Byung S.

PY - 2002

Y1 - 2002

N2 - A delay-scaling multicast algorithm (DSMCA) is presented for minimum-cost multicast tree construction that also considers end-to-end delays along the paths from the source to each multicast group member. This problem is known to be NP-complete. Our heuristic has a time complexity of O(D 2p 2n 2 lg n), where n is the number of nodes in the network, p is the number of destinations in the multicast session, and D is the delay constraint. Our simulation results show that DSMCA on the average produces trees with lower cost than other known heuristics.

AB - A delay-scaling multicast algorithm (DSMCA) is presented for minimum-cost multicast tree construction that also considers end-to-end delays along the paths from the source to each multicast group member. This problem is known to be NP-complete. Our heuristic has a time complexity of O(D 2p 2n 2 lg n), where n is the number of nodes in the network, p is the number of destinations in the multicast session, and D is the delay constraint. Our simulation results show that DSMCA on the average produces trees with lower cost than other known heuristics.

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

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

M3 - Conference contribution

AN - SCOPUS:1642287586

SN - 0970789017

SN - 9780970789013

VL - 6

SP - 319

EP - 323

BT - Proceedings of the Joint Conference on Information Sciences

A2 - Caulfield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Caufield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Honavar, V.

ER -