Routing metric based on node degree for load-balancing in large-scale networks

Hitomi Tamura, Masato Uchida, Masato Tsuru, Jun'Ichi Shimada, Takeshi Ikenaga, Yuji Oie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 mapping 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.

Original languageEnglish
Title of host publicationProceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011
Pages519-523
Number of pages5
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011 - Munich, Bavaria, Germany
Duration: 2011 Jul 182011 Jul 21

Other

Other11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011
CountryGermany
CityMunich, Bavaria
Period11/7/1811/7/21

Fingerprint

Resource allocation
Complex networks
Topology

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Tamura, H., Uchida, M., Tsuru, M., Shimada, JI., Ikenaga, T., & Oie, Y. (2011). Routing metric based on node degree for load-balancing in large-scale networks. In Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011 (pp. 519-523). [6004205] https://doi.org/10.1109/SAINT.2011.96

Routing metric based on node degree for load-balancing in large-scale networks. / Tamura, Hitomi; Uchida, Masato; Tsuru, Masato; Shimada, Jun'Ichi; Ikenaga, Takeshi; Oie, Yuji.

Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011. 2011. p. 519-523 6004205.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tamura, H, Uchida, M, Tsuru, M, Shimada, JI, Ikenaga, T & Oie, Y 2011, Routing metric based on node degree for load-balancing in large-scale networks. in Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011., 6004205, pp. 519-523, 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011, Munich, Bavaria, Germany, 11/7/18. https://doi.org/10.1109/SAINT.2011.96
Tamura H, Uchida M, Tsuru M, Shimada JI, Ikenaga T, Oie Y. Routing metric based on node degree for load-balancing in large-scale networks. In Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011. 2011. p. 519-523. 6004205 https://doi.org/10.1109/SAINT.2011.96
Tamura, Hitomi ; Uchida, Masato ; Tsuru, Masato ; Shimada, Jun'Ichi ; Ikenaga, Takeshi ; Oie, Yuji. / Routing metric based on node degree for load-balancing in large-scale networks. Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011. 2011. pp. 519-523
@inproceedings{11d8939ec3194acdad0b12c2d3898921,
title = "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 mapping 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.",
author = "Hitomi Tamura and Masato Uchida and Masato Tsuru and Jun'Ichi Shimada and Takeshi Ikenaga and Yuji Oie",
year = "2011",
doi = "10.1109/SAINT.2011.96",
language = "English",
isbn = "9780769544236",
pages = "519--523",
booktitle = "Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011",

}

TY - GEN

T1 - Routing metric based on node degree for load-balancing in large-scale networks

AU - Tamura, Hitomi

AU - Uchida, Masato

AU - Tsuru, Masato

AU - Shimada, Jun'Ichi

AU - Ikenaga, Takeshi

AU - Oie, Yuji

PY - 2011

Y1 - 2011

N2 - 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 mapping 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.

AB - 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 mapping 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.

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

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

U2 - 10.1109/SAINT.2011.96

DO - 10.1109/SAINT.2011.96

M3 - Conference contribution

AN - SCOPUS:80053026681

SN - 9780769544236

SP - 519

EP - 523

BT - Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011

ER -