ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking
Summary :
We propose a new QOS routing algorithm for finding a path that guarantees several quality of service (QOS) parameters requested by users, for ATM networks. It is known that a routing problem is NP-complete, if the number of additive QOS parameters, such as delay and cost, are more than or equal to two. Although a number of heuristic algorithms have been proposed recently to solve this problem, the appropriate choice of routing algorithms is still an open issue. In this paper, we propose a new heuristic routing algorithm, while being compliant with PNNI routing and signaling specification in the ATM Forum. The performance of algorithms is evaluated by simulation with a various network topologies and loading scenarios. This simulation results demonstrate that the proposed scheme improves the performance while reducing computational complexity.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E79-B No.8 pp.999-1007
- Publication Date
- 1996/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section INVITED PAPER (Special Issue on Multimedia on Demand)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Atsushi IWATA, Rauf IZMAILOV, Duan-Shin LEE, Bhaskar SENGUPTA, G. RAMAMURTHY, Hiroshi SUZUKI, "ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking" in IEICE TRANSACTIONS on Communications,
vol. E79-B, no. 8, pp. 999-1007, August 1996, doi: .
Abstract: We propose a new QOS routing algorithm for finding a path that guarantees several quality of service (QOS) parameters requested by users, for ATM networks. It is known that a routing problem is NP-complete, if the number of additive QOS parameters, such as delay and cost, are more than or equal to two. Although a number of heuristic algorithms have been proposed recently to solve this problem, the appropriate choice of routing algorithms is still an open issue. In this paper, we propose a new heuristic routing algorithm, while being compliant with PNNI routing and signaling specification in the ATM Forum. The performance of algorithms is evaluated by simulation with a various network topologies and loading scenarios. This simulation results demonstrate that the proposed scheme improves the performance while reducing computational complexity.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e79-b_8_999/_p
Copy
@ARTICLE{e79-b_8_999,
author={Atsushi IWATA, Rauf IZMAILOV, Duan-Shin LEE, Bhaskar SENGUPTA, G. RAMAMURTHY, Hiroshi SUZUKI, },
journal={IEICE TRANSACTIONS on Communications},
title={ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking},
year={1996},
volume={E79-B},
number={8},
pages={999-1007},
abstract={We propose a new QOS routing algorithm for finding a path that guarantees several quality of service (QOS) parameters requested by users, for ATM networks. It is known that a routing problem is NP-complete, if the number of additive QOS parameters, such as delay and cost, are more than or equal to two. Although a number of heuristic algorithms have been proposed recently to solve this problem, the appropriate choice of routing algorithms is still an open issue. In this paper, we propose a new heuristic routing algorithm, while being compliant with PNNI routing and signaling specification in the ATM Forum. The performance of algorithms is evaluated by simulation with a various network topologies and loading scenarios. This simulation results demonstrate that the proposed scheme improves the performance while reducing computational complexity.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking
T2 - IEICE TRANSACTIONS on Communications
SP - 999
EP - 1007
AU - Atsushi IWATA
AU - Rauf IZMAILOV
AU - Duan-Shin LEE
AU - Bhaskar SENGUPTA
AU - G. RAMAMURTHY
AU - Hiroshi SUZUKI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E79-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 1996
AB - We propose a new QOS routing algorithm for finding a path that guarantees several quality of service (QOS) parameters requested by users, for ATM networks. It is known that a routing problem is NP-complete, if the number of additive QOS parameters, such as delay and cost, are more than or equal to two. Although a number of heuristic algorithms have been proposed recently to solve this problem, the appropriate choice of routing algorithms is still an open issue. In this paper, we propose a new heuristic routing algorithm, while being compliant with PNNI routing and signaling specification in the ATM Forum. The performance of algorithms is evaluated by simulation with a various network topologies and loading scenarios. This simulation results demonstrate that the proposed scheme improves the performance while reducing computational complexity.
ER -
English
