Design Algorithm for Virtual Path Based ATM Networks

Byung Han RYU; Hiroyuki OHSAKI; Masayuki MURATA; Hideo MIYAHAEA

Design Algorithm for Virtual Path Based ATM Networks

Byung Han RYU, Hiroyuki OHSAKI, Masayuki MURATA, Hideo MIYAHAEA

Full Text Views

0

Share
Cite this

Summary :

An ATM network design algorithm is treated as a resource allocation problem. As an effective way to facilitate a coexistence of traffic with its diverse characteristics and different quality of service (QOS) requirements in ATM networks, a virtual path (VP) concept has been proposed. In attempting to design the VP (Virtual Path)-based ATM network, it requires to consider a network topology and traffic pattern generated from users for minimizing a network construction cost while satisfying QOS requirements such as cell / call loss probabilities and cell delay times. In this paper, we propose a new heuristic design algorithm for the VP-based ATM network under QOS constraints. A minimum bandwidth required to transfer a given amount of traffic is first obtained by utilizing an equivalent bandwidth method. After all the routes of VPs are temporarily established by means of the shortest paths, we try to minimize the network cost through the alternation of VP route, the separation of a single VP into several VPs, and the introduction of VCX nodes. To evaluate our design algorithm, we consider two kinds of traffic; voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in the cost-effective VP-based ATM network.

Publication: IEICE TRANSACTIONS on Communications Vol.E79-B No.2 pp.97-107

Publication Date: 1996/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Communication Networks and Services

Cite this

Copy

Byung Han RYU, Hiroyuki OHSAKI, Masayuki MURATA, Hideo MIYAHAEA, "Design Algorithm for Virtual Path Based ATM Networks" in IEICE TRANSACTIONS on Communications, vol. E79-B, no. 2, pp. 97-107, February 1996, doi: .
Abstract: An ATM network design algorithm is treated as a resource allocation problem. As an effective way to facilitate a coexistence of traffic with its diverse characteristics and different quality of service (QOS) requirements in ATM networks, a virtual path (VP) concept has been proposed. In attempting to design the VP (Virtual Path)-based ATM network, it requires to consider a network topology and traffic pattern generated from users for minimizing a network construction cost while satisfying QOS requirements such as cell / call loss probabilities and cell delay times. In this paper, we propose a new heuristic design algorithm for the VP-based ATM network under QOS constraints. A minimum bandwidth required to transfer a given amount of traffic is first obtained by utilizing an equivalent bandwidth method. After all the routes of VPs are temporarily established by means of the shortest paths, we try to minimize the network cost through the alternation of VP route, the separation of a single VP into several VPs, and the introduction of VCX nodes. To evaluate our design algorithm, we consider two kinds of traffic; voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in the cost-effective VP-based ATM network.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e79-b_2_97/_p

Copy

@ARTICLE{e79-b_2_97,
author={Byung Han RYU, Hiroyuki OHSAKI, Masayuki MURATA, Hideo MIYAHAEA, },
journal={IEICE TRANSACTIONS on Communications},
title={Design Algorithm for Virtual Path Based ATM Networks},
year={1996},
volume={E79-B},
number={2},
pages={97-107},
abstract={An ATM network design algorithm is treated as a resource allocation problem. As an effective way to facilitate a coexistence of traffic with its diverse characteristics and different quality of service (QOS) requirements in ATM networks, a virtual path (VP) concept has been proposed. In attempting to design the VP (Virtual Path)-based ATM network, it requires to consider a network topology and traffic pattern generated from users for minimizing a network construction cost while satisfying QOS requirements such as cell / call loss probabilities and cell delay times. In this paper, we propose a new heuristic design algorithm for the VP-based ATM network under QOS constraints. A minimum bandwidth required to transfer a given amount of traffic is first obtained by utilizing an equivalent bandwidth method. After all the routes of VPs are temporarily established by means of the shortest paths, we try to minimize the network cost through the alternation of VP route, the separation of a single VP into several VPs, and the introduction of VCX nodes. To evaluate our design algorithm, we consider two kinds of traffic; voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in the cost-effective VP-based ATM network.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Design Algorithm for Virtual Path Based ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 97
EP - 107
AU - Byung Han RYU
AU - Hiroyuki OHSAKI
AU - Masayuki MURATA
AU - Hideo MIYAHAEA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E79-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 1996
AB - An ATM network design algorithm is treated as a resource allocation problem. As an effective way to facilitate a coexistence of traffic with its diverse characteristics and different quality of service (QOS) requirements in ATM networks, a virtual path (VP) concept has been proposed. In attempting to design the VP (Virtual Path)-based ATM network, it requires to consider a network topology and traffic pattern generated from users for minimizing a network construction cost while satisfying QOS requirements such as cell / call loss probabilities and cell delay times. In this paper, we propose a new heuristic design algorithm for the VP-based ATM network under QOS constraints. A minimum bandwidth required to transfer a given amount of traffic is first obtained by utilizing an equivalent bandwidth method. After all the routes of VPs are temporarily established by means of the shortest paths, we try to minimize the network cost through the alternation of VP route, the separation of a single VP into several VPs, and the introduction of VCX nodes. To evaluate our design algorithm, we consider two kinds of traffic; voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in the cost-effective VP-based ATM network.
ER -