Minimum-cost QoS multicast and unicast routing in communication networks

Research output: Contribution to journalArticle

56 Citations (Scopus)

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 2003

Fingerprint

Telecommunication networks
Quality of service
Costs
Approximation algorithms
Heuristic algorithms

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
  • Computer Networks and Communications

Cite this

Minimum-cost QoS multicast and unicast routing in communication networks. / Xue, Guoliang.

In: IEEE Transactions on Communications, Vol. 51, No. 5, 05.2003, p. 817-824.

Research output: Contribution to journalArticle

@article{426266fdd399490c858d8f2020563184,
title = "Minimum-cost QoS multicast and unicast routing in communication networks",
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.",
keywords = "Communication networks, Minimum-cost delay-constrained end-to-end routing, Minimum-cost delay-constrained multicast trees",
author = "Guoliang Xue",
year = "2003",
month = "5",
doi = "10.1109/TCOMM.2003.811420",
language = "English (US)",
volume = "51",
pages = "817--824",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Minimum-cost QoS multicast and unicast routing in communication networks

AU - Xue, Guoliang

PY - 2003/5

Y1 - 2003/5

N2 - 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.

AB - 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.

KW - Communication networks

KW - Minimum-cost delay-constrained end-to-end routing

KW - Minimum-cost delay-constrained multicast trees

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

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

U2 - 10.1109/TCOMM.2003.811420

DO - 10.1109/TCOMM.2003.811420

M3 - Article

AN - SCOPUS:0037701239

VL - 51

SP - 817

EP - 824

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 5

ER -