Low-cost, bounded-delay multicast routing for QoS-based networks

Tawfig Alrabiah, Taieb F. Znati

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

4 Citations (Scopus)

Abstract

Development of efficient multicasting algorithms which support a wide range of quality of service requirements is crucial to the successful deployment of multimedia applications. In this paper we present a new class of low-cost, bounded delay multicast heuristics for integrated service networks. The heuristics use various techniques to find the solution to the multicast problem, if one exists. These heuristics are described and shown to be cycle free and of complexity O(zn2) where z is the number of multicast nodes and n is the number of nodes in the network. We also show that if no delay bound was violated during the construction of the tree, the proposed heuristics give an approximation that does not exceed in average the cost of the optimal solution by more than 5%.

Original languageEnglish
Title of host publicationProceedings - 7th International Conference on Computer Communications and Networks, ICCCN 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages304-311
Number of pages8
ISBN (Electronic)0818690143, 9780818690143
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event7th International Conference on Computer Communications and Networks, ICCCN 1998 - Lafayette, United States
Duration: Oct 15 1998Oct 15 1998

Publication series

NameProceedings - 7th International Conference on Computer Communications and Networks, ICCCN 1998
Volume1998-October

Conference

Conference7th International Conference on Computer Communications and Networks, ICCCN 1998
Country/TerritoryUnited States
CityLafayette
Period10/15/9810/15/98

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'Low-cost, bounded-delay multicast routing for QoS-based networks'. Together they form a unique fingerprint.

Cite this