Minimum-cost QoS multicast and unicast routing in communication networks

Research output: Contribution to journalArticle

57 Scopus citations

Abstract

In this paper, we study the minimum-cost quality-of-service multicast and unicast routing problems in communication networks. For the multicast problem, we present an efficient approximation algorithm to find a balance between a minimum-cost multicast tree and a minimum-delay multicast tree, with a probably good performance under the condition that link delay and link cost are identical. For the unicast problem, we present an efficient primal-dual heuristic algorithm to find a path which balances path cost and path delay, together with an error bound. The lack of a probably good performance for the second algorithm is complemented by computational results on randomly generated networks. Our algorithm finds optimal solutions in more than 80% of the cases and finds close to optimal solutions in all other cases, while using much less time.

Original languageEnglish (US)
Pages (from-to)817-824
Number of pages8
JournalIEEE Transactions on Communications
Volume51
Issue number5
DOIs
StatePublished - May 1 2003

Keywords

  • Communication networks
  • Minimum-cost delay-constrained end-to-end routing
  • Minimum-cost delay-constrained multicast trees

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Minimum-cost QoS multicast and unicast routing in communication networks'. Together they form a unique fingerprint.

  • Cite this