On the performance of STAR: An efficient delay-bound, low-cost multicast algorithm

Shu Li, R. Melhem, T. F. Znati

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


Multicast networking is poised to play a prominent role in the future deployment of multimedia applications. Multimedia applications are usually resource intensive, have stringent quality of service requirements, and in many cases involve large multicast groups. Multicasting enables these applications to scale to a large number of users without overloading the network and server resources. This paper focuses on the design and analysis of a new heuristic for building low-cost, delay-bounded multicast trees to support multimedia applications. The approach used by the proposed heuristic to "optimize" the multicast tree limits its paths computation to paths which originate from the multicast destinations instead of all pairs of paths, as is the case in other well-known algorithms. Moreover, the path finding procedure, based on Dijkstra's algorithm, results in the selection of better paths than those discovered the k-shortest path based procedures. The simulation results show that the proposed heuristic outperforms on average other known heuristics.

Original languageEnglish
Title of host publicationProceedings - 35th Annual Simulation Symposium, SS 2002
PublisherIEEE Computer Society
Number of pages9
ISBN (Electronic)0769515525
Publication statusPublished - 2002
Externally publishedYes
Event35th Annual Simulation Symposium, SS 2002 - San Diego, United States
Duration: Apr 14 2002Apr 18 2002

Publication series

NameProceedings - Simulation Symposium
ISSN (Print)1080-241X


Conference35th Annual Simulation Symposium, SS 2002
Country/TerritoryUnited States
CitySan Diego


  • Algorithm design and analysis
  • Application software
  • Bandwidth
  • Buildings
  • Computational modeling
  • Delay
  • Jitter
  • Multicast algorithms
  • Quality of service
  • Routing

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'On the performance of STAR: An efficient delay-bound, low-cost multicast algorithm'. Together they form a unique fingerprint.

Cite this