Route Optimization Using the FDL Path in Hybrid Switching Networks

Young Chul PARK; Chong Kwan UN; Sang Chul LEE

Route Optimization Using the FDL Path in Hybrid Switching Networks

Young Chul PARK, Chong Kwan UN, Sang Chul LEE

Full Text Views

0

Cite this

Summary :

In this paper, we study an algorithm of route optimization using the first-derivative length (FDL) path in a hybrid-switching network with movable-boundary for heterogeneous traffics, and investigate the interactions among four different classes of traffics in a time division multiplexing (TDM) network. This algorithm has some desirable properties compared with the gradient projection method or the flow deviation method. That is, it requires no initial specification of traffic flow, and the convexity of the objective function is not required. The numerical results show that the solution is close to the optimal solution and this method yields a substantial improvement in convergence time over the gradient projection method.

Publication: IEICE TRANSACTIONS on Communications Vol.E74-B No.12 pp.4007-4016

Publication Date: 1991/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Network Control)

Category

Authors

Young Chul PARK
Chong Kwan UN
Sang Chul LEE

Keyword

Cite this

Copy

Young Chul PARK, Chong Kwan UN, Sang Chul LEE, "Route Optimization Using the FDL Path in Hybrid Switching Networks" in IEICE TRANSACTIONS on Communications, vol. E74-B, no. 12, pp. 4007-4016, December 1991, doi: .
Abstract: In this paper, we study an algorithm of route optimization using the first-derivative length (FDL) path in a hybrid-switching network with movable-boundary for heterogeneous traffics, and investigate the interactions among four different classes of traffics in a time division multiplexing (TDM) network. This algorithm has some desirable properties compared with the gradient projection method or the flow deviation method. That is, it requires no initial specification of traffic flow, and the convexity of the objective function is not required. The numerical results show that the solution is close to the optimal solution and this method yields a substantial improvement in convergence time over the gradient projection method.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e74-b_12_4007/_p

Copy

@ARTICLE{e74-b_12_4007,
author={Young Chul PARK, Chong Kwan UN, Sang Chul LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Route Optimization Using the FDL Path in Hybrid Switching Networks},
year={1991},
volume={E74-B},
number={12},
pages={4007-4016},
abstract={In this paper, we study an algorithm of route optimization using the first-derivative length (FDL) path in a hybrid-switching network with movable-boundary for heterogeneous traffics, and investigate the interactions among four different classes of traffics in a time division multiplexing (TDM) network. This algorithm has some desirable properties compared with the gradient projection method or the flow deviation method. That is, it requires no initial specification of traffic flow, and the convexity of the objective function is not required. The numerical results show that the solution is close to the optimal solution and this method yields a substantial improvement in convergence time over the gradient projection method.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Route Optimization Using the FDL Path in Hybrid Switching Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 4007
EP - 4016
AU - Young Chul PARK
AU - Chong Kwan UN
AU - Sang Chul LEE
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E74-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1991
AB - In this paper, we study an algorithm of route optimization using the first-derivative length (FDL) path in a hybrid-switching network with movable-boundary for heterogeneous traffics, and investigate the interactions among four different classes of traffics in a time division multiplexing (TDM) network. This algorithm has some desirable properties compared with the gradient projection method or the flow deviation method. That is, it requires no initial specification of traffic flow, and the convexity of the objective function is not required. The numerical results show that the solution is close to the optimal solution and this method yields a substantial improvement in convergence time over the gradient projection method.
ER -