Stable Renumbering in Link-State Routing Protocol Network

摘要

We have developed automatic network configuration technology for flexible and robust network construction. A link-state routing protocol HQLIP and an address allocation protocol HANA are the components. HQLIP achieves the fast convergence time of the forwarding tables, when renumbering occurs in the network, since it is designed not to reconfigure topology information in case of renumbering. In addition, we propose a Fixed-Midfix Renumbering (FMR) method that achieves faster convergence time. FMR can be available when HQLIP is employed with HANA at the same time. We showed that HQLIP with FMR is superior to OSPF in convergence time through experiments, and that combination of HQLIP and HANA realizes stable renumbering in link-state protocol networks.