复杂网络加边扩容策略研究  

Effective strategy of adding links for maximizing traffic capacity of complex networks

作　　者：赵焱鑫 李黎[1] 王小明[1] 

机构地区：[1]陕西师范大学计算机科学学院,西安710062

出　　处：《计算机应用研究》2015年第6期1839-1841,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(61173094;61373083;61303092);陕西省自然基础研究计划资助项目(2014JQ8305)

摘　　要：网络扩容策略是近年来复杂网络的研究热点,目前针对网络删边扩容研究已经颇为成熟,但加边扩容的研究还较为匮乏。根据网络容量与网络节点介数的最大值成反比的结论,提出了一种复杂网络加边扩容的策略,并与最低度添加边和最长最短路径添加边策略进行分析比较。实验表明:在添加边数目相同的条件下,提出的添加边策略不仅能有效减少网络平均最短路径,还可以最大化提高网络的容量。The strategies to improve the traffic capacity of networks have become one of the hot topics in the field of complex networks recently. By far, the strategies to enhance the traffic capacity via removing links have been researched a great deal in previous studies while strategies to improve the traffic capacity via adding links have been considered rarely. This paper pro- posed an efficient strategy to enhance traffic capacity via the process of links increment based on the theory that the maximum node betweenness was inversely proportional to the traffic capacity of networks. The obtained results indicate that the proposed strategy of adding links can not only effectively reduce the average shortest path, but also mostly enhance the traffic capacity of networks compared with the lowest degree strategy and the longest shortest path strategy when the same number of links are added.

关 键 词：复杂网络 加边扩容 网络容量 介数 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]