On approximating a multicast routing tree with multiple Quality-of-Service constraints

Jun Huang, Yoshiaki Tanaka, Yan Ma

    Research output: Contribution to journalArticle

    4 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)2005-2012
    Number of pages8
    JournalIEICE Transactions on Communications
    VolumeE95-B
    Issue number6
    DOIs
    Publication statusPublished - 2012 Jun

    Fingerprint

    Quality of service
    Trees (mathematics)
    Routing algorithms
    Polynomials

    Keywords

    • Approximation algorithm
    • Heuristic
    • Multicast tree
    • Nonlinear combination
    • QoS routing

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Networks and Communications
    • Software

    Cite this

    On approximating a multicast routing tree with multiple Quality-of-Service constraints. / Huang, Jun; Tanaka, Yoshiaki; Ma, Yan.

    In: IEICE Transactions on Communications, Vol. E95-B, No. 6, 06.2012, p. 2005-2012.

    Research output: Contribution to journalArticle

    @article{68fcdeafe31a4b2db7054f59861b8996,
    title = "On approximating a multicast routing tree with multiple Quality-of-Service constraints",
    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 = "Approximation algorithm, Heuristic, Multicast tree, Nonlinear combination, QoS routing",
    author = "Jun Huang and Yoshiaki Tanaka and Yan Ma",
    year = "2012",
    month = "6",
    doi = "10.1587/transcom.E95.B.2005",
    language = "English",
    volume = "E95-B",
    pages = "2005--2012",
    journal = "IEICE Transactions on Communications",
    issn = "0916-8516",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "6",

    }

    TY - JOUR

    T1 - On approximating a multicast routing tree with multiple Quality-of-Service constraints

    AU - Huang, Jun

    AU - Tanaka, Yoshiaki

    AU - Ma, Yan

    PY - 2012/6

    Y1 - 2012/6

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

    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.

    KW - Approximation algorithm

    KW - Heuristic

    KW - Multicast tree

    KW - Nonlinear combination

    KW - QoS routing

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

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

    U2 - 10.1587/transcom.E95.B.2005

    DO - 10.1587/transcom.E95.B.2005

    M3 - Article

    AN - SCOPUS:84861826176

    VL - E95-B

    SP - 2005

    EP - 2012

    JO - IEICE Transactions on Communications

    JF - IEICE Transactions on Communications

    SN - 0916-8516

    IS - 6

    ER -