Acta Metallurgica Sinica(English letters) ›› 2009, Vol. 16 ›› Issue (6): 72-77.doi: 10.1016/S1005-8885(08)60291-5

• Networks • Previous Articles     Next Articles

Load balance in hierarchical routing network

HUA Yi-qiang, LIU Ai-bo, LU Yue-ming, LI Hui, JI Yue-feng   

  1. 1. Key Laboratory of Information Photonics and Optical Communications, Ministry of Education,
    Beijing University of Posts and Telecommunications, Beijing 100876, China
    2. Cisco Systems, Inc. China, Beijing 100022, China
  • Received:2008-05-06 Revised:1900-01-01 Online:2009-12-30
  • Contact: HUA Yi-qiang


In this article, the problem of load balance in hierarchical routing network is studied. Since conventional shortest path first (SPF) algorithm over aggregated topology in hierarchical routing network may result in worse routing performance, a traffic sharing path selection algorithm and a variable weight scheme are put forward for hierarchical routing network, which can equilibrate the utilities of link resources and reduce the blocking probability of connections with the improvement on survivability. Simulations are conducted to evaluate proposed variable weight and traffics balance (VWTB) algorithm, which combines traffic sharing and variable weight. From the simulation results, it can be found that the proposed VWTB algorithm can balance the traffics and equilibrate the utilities of link resources significantly.

Key words:

hierarchical routing;load balance;variable weight;traffic sharing