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

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

*この研究の対応する著者

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011
ページ299-304
ページ数6
DOI
出版ステータスPublished - 2011 12月 1
外部発表はい
イベント3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011 - Fukuoka, Japan
継続期間: 2011 11月 302011 12月 2

出版物シリーズ

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

Other

Other3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011
国/地域Japan
CityFukuoka
Period11/11/3011/12/2

ASJC Scopus subject areas

  • 人工知能
  • コンピュータ ネットワークおよび通信

フィンガープリント

「Node degree-aware link cost for traffic load-distribution in large-scale networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル