{"title":"Node Degree-Aware Link Cost for Traffic Load-Distribution in Large-Scale Networks","authors":"H. Tamura, M. Köppen, M. Uchida, M. Tsuru, Y. Oie","doi":"10.1109/INCoS.2011.126","DOIUrl":null,"url":null,"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.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2011.126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
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.
TE (Traffic Engineering)是一种减少网络中部分高负载链路/节点的技术,从而分散网络中的流量负荷。为了有效地利用网络资源,将流量需求有效地映射到网络资源是非常重要的。因此,我们应该根据网络的拓扑特征而不是流量需求来考虑网络中“距离”的适当定义。近年来的研究表明网络拓扑具有无标度特性,节点出站度分布是影响无标度网络的重要因素。为了避免网络拥塞,本文利用节点度信息,提出了互联网中任意两个通信节点之间的距离的新定义。仿真结果表明,该方案可以将高节点的流量负载分散到其他节点,从而提高了网络的鲁棒性。