Node degree-aware link cost for traffic load-distribution in large-scale networks

Hitomi Tamura, Mario Köppen, Masato Uchida, Masato Tsuru, Yuji Oie

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

1 Citation (Scopus)

Abstract

Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in parts of a network, thereby distributing the traffic load in the network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. Therefore, we should consider an appropriate definition of "distance" in networks with the topological features of the network instead of traffic demands. Recent studies have demonstrated a scale-free property of network topology, and node outbound degree distribution is an important factor in the scale-free networks. This paper proposes a new definition of "distance" between two arbitrary communication nodes in the Internet by using node degree information for avoiding congestion in the network. Some simulation results show that the proposed scheme can distribute traffic load from high degree nodes to other nodes, and thus provides robustness of networks.

Original languageEnglish
Title of host publicationProceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011
Pages299-304
Number of pages6
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011 - Fukuoka, Japan
Duration: 2011 Nov 302011 Dec 2

Other

Other3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011
CountryJapan
CityFukuoka
Period11/11/3011/12/2

Fingerprint

Complex networks
Topology
Internet
Communication
Costs

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications

Cite this

Tamura, H., Köppen, M., Uchida, M., Tsuru, M., & Oie, Y. (2011). Node degree-aware link cost for traffic load-distribution in large-scale networks. In Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011 (pp. 299-304). [6132815] https://doi.org/10.1109/INCoS.2011.126

Node degree-aware link cost for traffic load-distribution in large-scale networks. / Tamura, Hitomi; Köppen, Mario; Uchida, Masato; Tsuru, Masato; Oie, Yuji.

Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011. 2011. p. 299-304 6132815.

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

Tamura, H, Köppen, M, Uchida, M, Tsuru, M & Oie, Y 2011, Node degree-aware link cost for traffic load-distribution in large-scale networks. in Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011., 6132815, pp. 299-304, 3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011, Fukuoka, Japan, 11/11/30. https://doi.org/10.1109/INCoS.2011.126
Tamura H, Köppen M, Uchida M, Tsuru M, Oie Y. Node degree-aware link cost for traffic load-distribution in large-scale networks. In Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011. 2011. p. 299-304. 6132815 https://doi.org/10.1109/INCoS.2011.126
Tamura, Hitomi ; Köppen, Mario ; Uchida, Masato ; Tsuru, Masato ; Oie, Yuji. / Node degree-aware link cost for traffic load-distribution in large-scale networks. Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011. 2011. pp. 299-304
@inproceedings{e5ec5f0b2364429fac95e5231ca764ca,
title = "Node degree-aware link cost for traffic load-distribution in large-scale networks",
abstract = "Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in parts of a network, thereby distributing the traffic load in the network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. Therefore, we should consider an appropriate definition of {"}distance{"} in networks with the topological features of the network instead of traffic demands. Recent studies have demonstrated a scale-free property of network topology, and node outbound degree distribution is an important factor in the scale-free networks. This paper proposes a new definition of {"}distance{"} between two arbitrary communication nodes in the Internet by using node degree information for avoiding congestion in the network. Some simulation results show that the proposed scheme can distribute traffic load from high degree nodes to other nodes, and thus provides robustness of networks.",
author = "Hitomi Tamura and Mario K{\"o}ppen and Masato Uchida and Masato Tsuru and Yuji Oie",
year = "2011",
doi = "10.1109/INCoS.2011.126",
language = "English",
isbn = "9780769545790",
pages = "299--304",
booktitle = "Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011",

}

TY - GEN

T1 - Node degree-aware link cost for traffic load-distribution in large-scale networks

AU - Tamura, Hitomi

AU - Köppen, Mario

AU - Uchida, Masato

AU - Tsuru, Masato

AU - Oie, Yuji

PY - 2011

Y1 - 2011

N2 - Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in parts of a network, thereby distributing the traffic load in the network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. Therefore, we should consider an appropriate definition of "distance" in networks with the topological features of the network instead of traffic demands. Recent studies have demonstrated a scale-free property of network topology, and node outbound degree distribution is an important factor in the scale-free networks. This paper proposes a new definition of "distance" between two arbitrary communication nodes in the Internet by using node degree information for avoiding congestion in the network. Some simulation results show that the proposed scheme can distribute traffic load from high degree nodes to other nodes, and thus provides robustness of networks.

AB - Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in parts of a network, thereby distributing the traffic load in the network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. Therefore, we should consider an appropriate definition of "distance" in networks with the topological features of the network instead of traffic demands. Recent studies have demonstrated a scale-free property of network topology, and node outbound degree distribution is an important factor in the scale-free networks. This paper proposes a new definition of "distance" between two arbitrary communication nodes in the Internet by using node degree information for avoiding congestion in the network. Some simulation results show that the proposed scheme can distribute traffic load from high degree nodes to other nodes, and thus provides robustness of networks.

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

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

U2 - 10.1109/INCoS.2011.126

DO - 10.1109/INCoS.2011.126

M3 - Conference contribution

AN - SCOPUS:84857166297

SN - 9780769545790

SP - 299

EP - 304

BT - Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011

ER -