Quickly Converging Renumbering in Network with Hierarchical Link-State Routing Protocol

Kenji FUJIKAWA; Hiroaki HARAI; Motoyuki OHMORI; Masataka OHTA

doi:10.1587/transinf.2015EDP7197

Quickly Converging Renumbering in Network with Hierarchical Link-State Routing Protocol

Kenji FUJIKAWA, Hiroaki HARAI, Motoyuki OHMORI, Masataka OHTA

Full Text Views

0

Share
Cite this

Summary :

We have developed an automatic network configuration technology for flexible and robust network construction. In this paper, we propose a two-or-more-level hierarchical link-state routing protocol in Hierarchical QoS Link Information Protocol (HQLIP). The hierarchical routing easily scales up the network by combining and stacking configured networks. HQLIP is designed not to recompute shortest-path trees from topology information in order to achieve a high-speed convergence of forwarding information base (FIB), especially when renumbering occurs in the network. In addition, we propose a fixed-midfix renumbering (FMR) method. FMR enables an even faster convergence when HQLIP is synchronized with Hierarchical/Automatic Number Allocation (HANA). Experiments demonstrate that HQLIP incorporating FMR achieves the convergence time within one second in the network where 22 switches and 800 server terminals are placed, and is superior to Open Shortest Path First (OSPF) in terms of a convergence time. This shows that a combination of HQLIP and HANA performs stable renumbering in link-state routing protocol networks.

Publication: IEICE TRANSACTIONS on Information Vol.E99-D No.6 pp.1553-1562

Publication Date: 2016/06/01

Publicized: 2016/03/14

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2015EDP7197

Type of Manuscript: PAPER

Category: Information Network

Authors

Kenji FUJIKAWA
  National Institute of Information and Communications Technology
Hiroaki HARAI
  National Institute of Information and Communications Technology
Motoyuki OHMORI
  Tottori University
Masataka OHTA
  Tokyo Institute of Technology

Keyword

HQLIP, HANA, renumbering, convergence time, link-state routing protocol

Cite this

Copy

Kenji FUJIKAWA, Hiroaki HARAI, Motoyuki OHMORI, Masataka OHTA, "Quickly Converging Renumbering in Network with Hierarchical Link-State Routing Protocol" in IEICE TRANSACTIONS on Information, vol. E99-D, no. 6, pp. 1553-1562, June 2016, doi: 10.1587/transinf.2015EDP7197.
Abstract: We have developed an automatic network configuration technology for flexible and robust network construction. In this paper, we propose a two-or-more-level hierarchical link-state routing protocol in Hierarchical QoS Link Information Protocol (HQLIP). The hierarchical routing easily scales up the network by combining and stacking configured networks. HQLIP is designed not to recompute shortest-path trees from topology information in order to achieve a high-speed convergence of forwarding information base (FIB), especially when renumbering occurs in the network. In addition, we propose a fixed-midfix renumbering (FMR) method. FMR enables an even faster convergence when HQLIP is synchronized with Hierarchical/Automatic Number Allocation (HANA). Experiments demonstrate that HQLIP incorporating FMR achieves the convergence time within one second in the network where 22 switches and 800 server terminals are placed, and is superior to Open Shortest Path First (OSPF) in terms of a convergence time. This shows that a combination of HQLIP and HANA performs stable renumbering in link-state routing protocol networks.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.2015EDP7197/_p

Copy

@ARTICLE{e99-d_6_1553,
author={Kenji FUJIKAWA, Hiroaki HARAI, Motoyuki OHMORI, Masataka OHTA, },
journal={IEICE TRANSACTIONS on Information},
title={Quickly Converging Renumbering in Network with Hierarchical Link-State Routing Protocol},
year={2016},
volume={E99-D},
number={6},
pages={1553-1562},
abstract={We have developed an automatic network configuration technology for flexible and robust network construction. In this paper, we propose a two-or-more-level hierarchical link-state routing protocol in Hierarchical QoS Link Information Protocol (HQLIP). The hierarchical routing easily scales up the network by combining and stacking configured networks. HQLIP is designed not to recompute shortest-path trees from topology information in order to achieve a high-speed convergence of forwarding information base (FIB), especially when renumbering occurs in the network. In addition, we propose a fixed-midfix renumbering (FMR) method. FMR enables an even faster convergence when HQLIP is synchronized with Hierarchical/Automatic Number Allocation (HANA). Experiments demonstrate that HQLIP incorporating FMR achieves the convergence time within one second in the network where 22 switches and 800 server terminals are placed, and is superior to Open Shortest Path First (OSPF) in terms of a convergence time. This shows that a combination of HQLIP and HANA performs stable renumbering in link-state routing protocol networks.},
keywords={},
doi={10.1587/transinf.2015EDP7197},
ISSN={1745-1361},
month={June},}

Copy

TY - JOUR
TI - Quickly Converging Renumbering in Network with Hierarchical Link-State Routing Protocol
T2 - IEICE TRANSACTIONS on Information
SP - 1553
EP - 1562
AU - Kenji FUJIKAWA
AU - Hiroaki HARAI
AU - Motoyuki OHMORI
AU - Masataka OHTA
PY - 2016
DO - 10.1587/transinf.2015EDP7197
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2016
AB - We have developed an automatic network configuration technology for flexible and robust network construction. In this paper, we propose a two-or-more-level hierarchical link-state routing protocol in Hierarchical QoS Link Information Protocol (HQLIP). The hierarchical routing easily scales up the network by combining and stacking configured networks. HQLIP is designed not to recompute shortest-path trees from topology information in order to achieve a high-speed convergence of forwarding information base (FIB), especially when renumbering occurs in the network. In addition, we propose a fixed-midfix renumbering (FMR) method. FMR enables an even faster convergence when HQLIP is synchronized with Hierarchical/Automatic Number Allocation (HANA). Experiments demonstrate that HQLIP incorporating FMR achieves the convergence time within one second in the network where 22 switches and 800 server terminals are placed, and is superior to Open Shortest Path First (OSPF) in terms of a convergence time. This shows that a combination of HQLIP and HANA performs stable renumbering in link-state routing protocol networks.
ER -