Node Degree Based Routing Metric for Traffic Load Distribution in the Internet

Jun'ichi SHIMADA  Hitomi TAMURA  Masato UCHIDA  Yuji OIE  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E96-D   No.2   pp.202-212
Publication Date: 2013/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E96.D.202
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on The Internet Architectures, Protocols, and Applications for Diversified Futures)
Category: 
Keyword: 
traffic load distribution,  routing metric,  node degree,  p-norm,  stress centrality,  

Full Text: PDF>>
Buy this Article




Summary: 
Congestion inherently occurs on the Internet due to traffic concentration on certain nodes or links of networks. The traffic concentration is caused by inefficient use of topological information of networks in existing routing protocols, which reduces to inefficient mapping between traffic demands and network resources. Actually, the route with minimum cost, i.e., number of hops, selected as a transmission route by existing routing protocols would pass through specific nodes with common topological characteristics that could contribute to a large improvement in minimizing the cost. However, this would result in traffic concentration on such specific nodes. Therefore, we propose a measure of the distance between two nodes that is suitable for reducing traffic concentration on specific nodes. To consider the topological characteristics of the congestion points of networks, we define node-to-node distance by using a generalized norm, p-norm, of a vector of which elements are degrees of intermediate nodes of the route. Simulation results show that both the maximum Stress Centrality (SC) and the coefficient of variation of the SC are minimized in some network topologies by selecting transmission routes based on the proposed measure of node-to-node distance.