On Approximating a Multicast Routing Tree with Multiple Quality-of-Service Constraints

Jun HUANG; Yoshiaki TANAKA; Yan MA

doi:10.1587/transcom.E95.B.2005

On Approximating a Multicast Routing Tree with Multiple Quality-of-Service Constraints

Jun HUANG, Yoshiaki TANAKA, Yan MA

Full Text Views

0

Share
Cite this

Summary :

Multicast routing with Quality-of-Service (QoS) guarantees is the key to efficient content distribution and sharing. Developing QoS-aware multicast routing algorithm is an important open topic. This paper investigates QoS-aware multicast routing problem with K constraints where K > 2. The contributions made in this paper include a heuristic that employs the concept of nonlinear combination to extend the existing well-known algorithm for fast computation of a QoS multicast tree, and a Fully Polynomial Time Approximation Scheme (FPTAS) to approximate a multicast routing tree with QoS guarantees. The theoretical analyses and simulations conducted on both algorithms show that the algorithms developed in this paper are general and flexible, thus are applicable to the various networking systems.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.6 pp.2005-2012

Publication Date: 2012/06/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.2005

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Jun HUANG, Yoshiaki TANAKA, Yan MA, "On Approximating a Multicast Routing Tree with Multiple Quality-of-Service Constraints" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 6, pp. 2005-2012, June 2012, doi: 10.1587/transcom.E95.B.2005.
Abstract: Multicast routing with Quality-of-Service (QoS) guarantees is the key to efficient content distribution and sharing. Developing QoS-aware multicast routing algorithm is an important open topic. This paper investigates QoS-aware multicast routing problem with K constraints where K > 2. The contributions made in this paper include a heuristic that employs the concept of nonlinear combination to extend the existing well-known algorithm for fast computation of a QoS multicast tree, and a Fully Polynomial Time Approximation Scheme (FPTAS) to approximate a multicast routing tree with QoS guarantees. The theoretical analyses and simulations conducted on both algorithms show that the algorithms developed in this paper are general and flexible, thus are applicable to the various networking systems.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.2005/_p

Copy

@ARTICLE{e95-b_6_2005,
author={Jun HUANG, Yoshiaki TANAKA, Yan MA, },
journal={IEICE TRANSACTIONS on Communications},
title={On Approximating a Multicast Routing Tree with Multiple Quality-of-Service Constraints},
year={2012},
volume={E95-B},
number={6},
pages={2005-2012},
abstract={Multicast routing with Quality-of-Service (QoS) guarantees is the key to efficient content distribution and sharing. Developing QoS-aware multicast routing algorithm is an important open topic. This paper investigates QoS-aware multicast routing problem with K constraints where K > 2. The contributions made in this paper include a heuristic that employs the concept of nonlinear combination to extend the existing well-known algorithm for fast computation of a QoS multicast tree, and a Fully Polynomial Time Approximation Scheme (FPTAS) to approximate a multicast routing tree with QoS guarantees. The theoretical analyses and simulations conducted on both algorithms show that the algorithms developed in this paper are general and flexible, thus are applicable to the various networking systems.},
keywords={},
doi={10.1587/transcom.E95.B.2005},
ISSN={1745-1345},
month={June},}

Copy

TY - JOUR
TI - On Approximating a Multicast Routing Tree with Multiple Quality-of-Service Constraints
T2 - IEICE TRANSACTIONS on Communications
SP - 2005
EP - 2012
AU - Jun HUANG
AU - Yoshiaki TANAKA
AU - Yan MA
PY - 2012
DO - 10.1587/transcom.E95.B.2005
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2012
AB - Multicast routing with Quality-of-Service (QoS) guarantees is the key to efficient content distribution and sharing. Developing QoS-aware multicast routing algorithm is an important open topic. This paper investigates QoS-aware multicast routing problem with K constraints where K > 2. The contributions made in this paper include a heuristic that employs the concept of nonlinear combination to extend the existing well-known algorithm for fast computation of a QoS multicast tree, and a Fully Polynomial Time Approximation Scheme (FPTAS) to approximate a multicast routing tree with QoS guarantees. The theoretical analyses and simulations conducted on both algorithms show that the algorithms developed in this paper are general and flexible, thus are applicable to the various networking systems.
ER -