In this paper, we describe a routing method for path on SDH Network with digital cross-connect control, which is implemented in an automated path provisioning function. Excessive concentration of assigned time slots at particular links results in longer restoration time, which is needed to switch or reroute paths on failure link. We propose an optimization method to provision the shortest route considering deconcentration of time slots assigned on each link. After defining LP-based formulation for path routing, we carried out computer simulation study for restoration performance on sample networks, assuming each restoration process for paths on failure link is executed one after another. Mean restoration time by our proposed method has reduced to a great extent compared to a basic routing method. It has been proven that the proposed method can realize effective use of resources and faster restoration time, and can be utilized in commercial systems.
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.
Copy
Daisuke TANIGUCHI, Takeshi NOJIMA, Toshio KOGA, Fukashi KAMIKAWA, "A Practical Automated Path Provisioning Method Reducing Restoration Time" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 12, pp. 2495-2502, December 1998, doi: .
Abstract: In this paper, we describe a routing method for path on SDH Network with digital cross-connect control, which is implemented in an automated path provisioning function. Excessive concentration of assigned time slots at particular links results in longer restoration time, which is needed to switch or reroute paths on failure link. We propose an optimization method to provision the shortest route considering deconcentration of time slots assigned on each link. After defining LP-based formulation for path routing, we carried out computer simulation study for restoration performance on sample networks, assuming each restoration process for paths on failure link is executed one after another. Mean restoration time by our proposed method has reduced to a great extent compared to a basic routing method. It has been proven that the proposed method can realize effective use of resources and faster restoration time, and can be utilized in commercial systems.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_12_2495/_p
Copy
@ARTICLE{e81-b_12_2495,
author={Daisuke TANIGUCHI, Takeshi NOJIMA, Toshio KOGA, Fukashi KAMIKAWA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Practical Automated Path Provisioning Method Reducing Restoration Time},
year={1998},
volume={E81-B},
number={12},
pages={2495-2502},
abstract={In this paper, we describe a routing method for path on SDH Network with digital cross-connect control, which is implemented in an automated path provisioning function. Excessive concentration of assigned time slots at particular links results in longer restoration time, which is needed to switch or reroute paths on failure link. We propose an optimization method to provision the shortest route considering deconcentration of time slots assigned on each link. After defining LP-based formulation for path routing, we carried out computer simulation study for restoration performance on sample networks, assuming each restoration process for paths on failure link is executed one after another. Mean restoration time by our proposed method has reduced to a great extent compared to a basic routing method. It has been proven that the proposed method can realize effective use of resources and faster restoration time, and can be utilized in commercial systems.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Practical Automated Path Provisioning Method Reducing Restoration Time
T2 - IEICE TRANSACTIONS on Communications
SP - 2495
EP - 2502
AU - Daisuke TANIGUCHI
AU - Takeshi NOJIMA
AU - Toshio KOGA
AU - Fukashi KAMIKAWA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1998
AB - In this paper, we describe a routing method for path on SDH Network with digital cross-connect control, which is implemented in an automated path provisioning function. Excessive concentration of assigned time slots at particular links results in longer restoration time, which is needed to switch or reroute paths on failure link. We propose an optimization method to provision the shortest route considering deconcentration of time slots assigned on each link. After defining LP-based formulation for path routing, we carried out computer simulation study for restoration performance on sample networks, assuming each restoration process for paths on failure link is executed one after another. Mean restoration time by our proposed method has reduced to a great extent compared to a basic routing method. It has been proven that the proposed method can realize effective use of resources and faster restoration time, and can be utilized in commercial systems.
ER -