Node degree based routing metric for traffic load distribution in the internet

Jun'Ichi Shimada, Hitomi Tamura, Masato Uchida, Yuji Oie

Research output: Contribution to journalArticle

Abstract

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, pnorm, 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.

Original languageEnglish
Pages (from-to)202-212
Number of pages11
JournalIEICE Transactions on Information and Systems
VolumeE96-D
Issue number2
DOIs
Publication statusPublished - 2013
Externally publishedYes

Fingerprint

Routing protocols
Internet
Costs
Topology

Keywords

  • Node degree
  • P-norm
  • Routing metric
  • Stress centrality
  • Traffic load distribution

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Node degree based routing metric for traffic load distribution in the internet. / Shimada, Jun'Ichi; Tamura, Hitomi; Uchida, Masato; Oie, Yuji.

In: IEICE Transactions on Information and Systems, Vol. E96-D, No. 2, 2013, p. 202-212.

Research output: Contribution to journalArticle

Shimada, Jun'Ichi ; Tamura, Hitomi ; Uchida, Masato ; Oie, Yuji. / Node degree based routing metric for traffic load distribution in the internet. In: IEICE Transactions on Information and Systems. 2013 ; Vol. E96-D, No. 2. pp. 202-212.
@article{f4dce1536eea4feebed05b414e5bf321,
title = "Node degree based routing metric for traffic load distribution in the internet",
abstract = "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, pnorm, 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.",
keywords = "Node degree, P-norm, Routing metric, Stress centrality, Traffic load distribution",
author = "Jun'Ichi Shimada and Hitomi Tamura and Masato Uchida and Yuji Oie",
year = "2013",
doi = "10.1587/transinf.E96.D.202",
language = "English",
volume = "E96-D",
pages = "202--212",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "2",

}

TY - JOUR

T1 - Node degree based routing metric for traffic load distribution in the internet

AU - Shimada, Jun'Ichi

AU - Tamura, Hitomi

AU - Uchida, Masato

AU - Oie, Yuji

PY - 2013

Y1 - 2013

N2 - 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, pnorm, 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.

AB - 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, pnorm, 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.

KW - Node degree

KW - P-norm

KW - Routing metric

KW - Stress centrality

KW - Traffic load distribution

UR - http://www.scopus.com/inward/record.url?scp=84873336403&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873336403&partnerID=8YFLogxK

U2 - 10.1587/transinf.E96.D.202

DO - 10.1587/transinf.E96.D.202

M3 - Article

AN - SCOPUS:84873336403

VL - E96-D

SP - 202

EP - 212

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 2

ER -