基于流量加权Betweenness提高网络容量的方法  

Method for Improving Network Capacity Based on Traffic-weighted Betweenness

作　　者：范晶[1] 张国强[1] 张国清[1] 

机构地区：[1]中国科学院计算技术研究所

出　　处：《系统仿真学报》2008年第17期4708-4711,4715,共5页Journal of System Simulation

基　　金：国家自然科学基金项目(60673168);国家863项目(2006AA01Z207)

摘　　要：在节点的发包速率和转发包速率都和节点度相关的流量模型中,研究了在基于跳数的最短路径路由策略下网络的容量问题。将Betweenness的概念进行了扩展,提出流量加权Betweenness的概念,使之更准确地描述在每个节点的发包速率各不相同的情况下节点可能承载的流量。并据此推导出适合于该流量模型的网络容量计算公式,同时指出在基于BA算法构造的scale-free网络中,在流量加权Betweenness值处在前5%至10%和前10%至15%的节点间加边的方法能显著提高容量。最后,通过仿真实验验证了该公式的正确性和该方法的有效性。The capacity of the network was discussed in the traffic model in which the packet creation and delivering rates at a node were assumed to depend on the degree of the node, with the hop-based shortest path routing algorithm as routing strategy. The concept, Betweenness, is extended here and Traffic-weighted Betweenness proposed here is a more accurate measure of the message traffic a node will support. A new formula is deduced to compute network capacity in this model according to Traffic-weighted Betweenness. Meanwhile, it suggests that adding some shortcuts in the scale-free networks between the nodes with the top 5%-10% values of Traffic-weighted Betweenness and the nodes with the top 10%-15% values of Traffic-weighted Betweenness can balance load among the core nodes and increase the capacity of the network substantially. Finally, the formula and the method are proved to be right and effective through simulations.

关 键 词：流量加权Betweenness 网络拓扑 网络容量 无标度网络 拥塞 

分 类 号：TN393[电子电信—物理电子学]