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 6th Joint Conference on Information Sciences, JCIS 2002
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
StatePublished - Dec 1 2002
EventProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States
Duration: Mar 8 2002Mar 13 2002

Publication series

NameProceedings of the Joint Conference on Information Sciences
Volume6

Other

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

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'A Delay-Scaling Multicast Algorithm with Multiple QoS Criteria'. Together they form a unique fingerprint.

Cite this