Routing Metric Based on Node Degree for Load-Balancing in Large-Scale Networks

Abstract

Traffic Engineering (TE) is required for reducing highly-loaded links/nodes in a part of networks, thereby reducing the traffic concentration in a part of network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. However, most of the existing TE schemes are not aware of underlying network topology; Indeed, they try to dynamically map traffic demands to network resources in response to traffic trends in a short period of time. The paper addresses the issue of network congestion due to inefficient map ping between traffic demand and network resources. We propose a new routing metric to allocate forwarding route from source node to its destinations for effective use of network resources in scale-free networks. We show that the best routing metric is p-norm based on node degrees along a path to destination node. Furthermore, we investigate the impact of the parameter, p, on congestion level of each link, and show the best parameter p to minimize the maximum stress centrality in a network.