Route Determination Method for Fast Network Restoration in Functionally Distributed Transport Networking

Kouji SUGISONO; Hirofumi YAMAZAKI; Hideaki IWATA; Atsushi HIRAMATSU

doi:10.1587/transcom.E95.B.2315

Route Determination Method for Fast Network Restoration in Functionally Distributed Transport Networking

Kouji SUGISONO, Hirofumi YAMAZAKI, Hideaki IWATA, Atsushi HIRAMATSU

Full Text Views

0

Share
Cite this

Summary :

A packet network architecture called “functionally distributed transport networking” is being studied, where control elements (CEs) are separated from the forwarding elements (FEs) of all routers in a network, and a centralized CE manages the control functions for all FEs. A crucial issue to be addressed in this network architecture is the occurrence of bottlenecks in the CE performance, and rapid network restoration after failures is the main problem to be solved. Thus, we propose here a fast backup route determination method suitable for this network architecture, and we also show the practicality of this architecture. Most failures can be categorized as single-node or single-link failures. The proposed method prepares backup routes for all possible single-node failures in advance and computes backup routes for single-link failures after the failure occurs. The number of possible single-node failures is much less than that of possible single-link failures, and the preparation of backup routes for single-node failures is practical under the memory requirements. Two techniques are used in computing backup routes for single-link failures in order to reduce the computation time. One is to calculate only the routes affected by the link failure. The other is to use an algorithm to compute backup routes for single-link failures based on preplanned backup routes for single-node failures. To demonstrate the practicality of our method, we evaluated the amount of memory and computation time needed to prepare backup routes for all single-node failures, and we carried out simulations with various network topologies to evaluate the route computation time required for a single-link failure.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.7 pp.2315-2322

Publication Date: 2012/07/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.2315

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Kouji SUGISONO, Hirofumi YAMAZAKI, Hideaki IWATA, Atsushi HIRAMATSU, "Route Determination Method for Fast Network Restoration in Functionally Distributed Transport Networking" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 7, pp. 2315-2322, July 2012, doi: 10.1587/transcom.E95.B.2315.
Abstract: A packet network architecture called “functionally distributed transport networking” is being studied, where control elements (CEs) are separated from the forwarding elements (FEs) of all routers in a network, and a centralized CE manages the control functions for all FEs. A crucial issue to be addressed in this network architecture is the occurrence of bottlenecks in the CE performance, and rapid network restoration after failures is the main problem to be solved. Thus, we propose here a fast backup route determination method suitable for this network architecture, and we also show the practicality of this architecture. Most failures can be categorized as single-node or single-link failures. The proposed method prepares backup routes for all possible single-node failures in advance and computes backup routes for single-link failures after the failure occurs. The number of possible single-node failures is much less than that of possible single-link failures, and the preparation of backup routes for single-node failures is practical under the memory requirements. Two techniques are used in computing backup routes for single-link failures in order to reduce the computation time. One is to calculate only the routes affected by the link failure. The other is to use an algorithm to compute backup routes for single-link failures based on preplanned backup routes for single-node failures. To demonstrate the practicality of our method, we evaluated the amount of memory and computation time needed to prepare backup routes for all single-node failures, and we carried out simulations with various network topologies to evaluate the route computation time required for a single-link failure.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.2315/_p

Copy

@ARTICLE{e95-b_7_2315,
author={Kouji SUGISONO, Hirofumi YAMAZAKI, Hideaki IWATA, Atsushi HIRAMATSU, },
journal={IEICE TRANSACTIONS on Communications},
title={Route Determination Method for Fast Network Restoration in Functionally Distributed Transport Networking},
year={2012},
volume={E95-B},
number={7},
pages={2315-2322},
abstract={A packet network architecture called “functionally distributed transport networking” is being studied, where control elements (CEs) are separated from the forwarding elements (FEs) of all routers in a network, and a centralized CE manages the control functions for all FEs. A crucial issue to be addressed in this network architecture is the occurrence of bottlenecks in the CE performance, and rapid network restoration after failures is the main problem to be solved. Thus, we propose here a fast backup route determination method suitable for this network architecture, and we also show the practicality of this architecture. Most failures can be categorized as single-node or single-link failures. The proposed method prepares backup routes for all possible single-node failures in advance and computes backup routes for single-link failures after the failure occurs. The number of possible single-node failures is much less than that of possible single-link failures, and the preparation of backup routes for single-node failures is practical under the memory requirements. Two techniques are used in computing backup routes for single-link failures in order to reduce the computation time. One is to calculate only the routes affected by the link failure. The other is to use an algorithm to compute backup routes for single-link failures based on preplanned backup routes for single-node failures. To demonstrate the practicality of our method, we evaluated the amount of memory and computation time needed to prepare backup routes for all single-node failures, and we carried out simulations with various network topologies to evaluate the route computation time required for a single-link failure.},
keywords={},
doi={10.1587/transcom.E95.B.2315},
ISSN={1745-1345},
month={July},}

Copy

TY - JOUR
TI - Route Determination Method for Fast Network Restoration in Functionally Distributed Transport Networking
T2 - IEICE TRANSACTIONS on Communications
SP - 2315
EP - 2322
AU - Kouji SUGISONO
AU - Hirofumi YAMAZAKI
AU - Hideaki IWATA
AU - Atsushi HIRAMATSU
PY - 2012
DO - 10.1587/transcom.E95.B.2315
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2012
AB - A packet network architecture called “functionally distributed transport networking” is being studied, where control elements (CEs) are separated from the forwarding elements (FEs) of all routers in a network, and a centralized CE manages the control functions for all FEs. A crucial issue to be addressed in this network architecture is the occurrence of bottlenecks in the CE performance, and rapid network restoration after failures is the main problem to be solved. Thus, we propose here a fast backup route determination method suitable for this network architecture, and we also show the practicality of this architecture. Most failures can be categorized as single-node or single-link failures. The proposed method prepares backup routes for all possible single-node failures in advance and computes backup routes for single-link failures after the failure occurs. The number of possible single-node failures is much less than that of possible single-link failures, and the preparation of backup routes for single-node failures is practical under the memory requirements. Two techniques are used in computing backup routes for single-link failures in order to reduce the computation time. One is to calculate only the routes affected by the link failure. The other is to use an algorithm to compute backup routes for single-link failures based on preplanned backup routes for single-node failures. To demonstrate the practicality of our method, we evaluated the amount of memory and computation time needed to prepare backup routes for all single-node failures, and we carried out simulations with various network topologies to evaluate the route computation time required for a single-link failure.
ER -