有效提高Internet传输性能的社团结构改善策略

doi:10.3969/j.issn.1000-436x.2013.04.021

通信学报 ›› 2013, Vol. 34 ›› Issue (4): 171-179.doi: 10.3969/j.issn.1000-436x.2013.04.021

有效提高Internet传输性能的社团结构改善策略

蔡君^1,²,余顺争²

¹ 广东技术师范学院电子与信息学院，广东广州 510665
² 中山大学电子与信息工程系，广东广州 510006

出版日期:2013-04-25 发布日期:2017-07-17
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;国家高技术研究发展计划(“863”计划)基金资助项目;国家自然科学基金—广东联合基金资助项目;广东省自然科学基金资助项目

Improving community structure strategy for efficiently enhancing Internet transmission performance

Jun CAI^1,²,Shun-zheng YU²

¹ School of Electronic and Information,Guang Dong Polytechnic Normal University,Guangzhou 510665,China
² Department of Electronics and Communication Engineering,Sun Yat-Sen University,Guangzhou 510006,China

Online:2013-04-25 Published:2017-07-17
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National High Technology Research Development Program of China;The Key Program of NSFC Guangdong Joint—Funds;The Natural Science Foundation of Guangdong Province

摘要/Abstract

摘要：

提出一种增添能最有效减弱网络社团特性的边以提高 Internet 网络传输性能的策略，即减弱社团结构策略（WCS策略），并基于光逻辑链路可以提供与实际物理链路相当的高性能，以实现WCS策略的Internet网络的拓扑重构。在伪随机网络、具有社团结构的无标度人工网络和实际 Internet 网络上分别进行了基于全局最短路径路由和局部路由的实验。实验结果表明，利用 WCS 策略在社团之间少量边的添加，就能实现网络负载能力和平均最短路径的大幅改善。

关键词: 复杂网络, 社团特性, 信息传输, 模块度

Abstract:

An efficient weakening community structure strategy (WCS) by adding links to the existing networks was propose,which could enhance Internet transmission performance.Internet topology reconstruction could be realized by WCS strategy,because lightpaths that represent logical links between nodes could achieve the same high performance as physical links by means of optically bypassing intermediate nodes.The performance of the proposed strategy was investigated in pseudo random networks with community structure scale-free network with community structure and Internet,topology respectively,for both local routing strategy and global shortest-path routing strategy.The experimental results show that the traffic capacity of networks and the average shortest path are considerably improved by adding a few links among communities.

Key words: complex network, community structure, information transfer, modularity

蔡君,余顺争. 有效提高Internet传输性能的社团结构改善策略[J]. 通信学报, 2013, 34(4): 171-179.

Jun CAI,Shun-zheng YU. Improving community structure strategy for efficiently enhancing Internet transmission performance[J]. Journal on Communications, 2013, 34(4): 171-179.

图/表 13

图1

图2

图3

图4

图5

图6

图7

图8

图9

图10

图11

图12

图13

参考文献 27

[1]	NEWMAN M E J . Detecting community structure in networks[J]. The European Physical Journal B, 2004,38(2): 321-330.
[2]	BOCCALETTI S , LATORA V , MORENO Y , et al. Complex networks:structure and dynamics[J]. Physics Reports, 2006,424(4-5): 175-308.
[3]	LUN L , DAVID A , WALTER W , et al. A first-principles approach to understanding the Internet's router-level topology[A]. Proceedings of the 2004 Conference on Applications,Technologies,Arc itectures,and Protocols for Computer Communications[C]. New York, 2004. 3-14.
[4]	ERIKSEN K A , SIMONSEN I , MASLOV S , et al. Modularity and extreme edges of the Internet[J]. Physical Review Letters, 2003,90(14): 1487011-1487014.
[5]	李涛，斐文江，王少平．无标度复杂网络负载传输优化策略[J]．物理学报， 2009,58(9):5903-5910. LI T , PEI W J , WANG S P . Optimal traffic routing strategy on scale-free complex networks[J]. ACTA Physica Sinica, 2009,58(9):5903-5910.
[6]	PU C L , ZHOU S Y , WANG K , et al. Efficient and robust routing on scale-free networks[J]. Physical A:Statistical Mechanics and Its Applications, 2012,391(3): 866-871.
[7]	DANON L , ARENAS A , DIAZ-GUILERA A . Impact of community structure on information trafer[J]. Physical Review E, 2008,77(3): 0361031-0361036.
[8]	邵斐，蒋国平 . 基于社团结构的负载传输优化策略[J]．物理学报， 2011,60(7):0789021-0789027. FEI S , JIANG G P . Optimal traffic routing strategy based on community structure[J]. ACTA Physica Sinica, 2011,60(7):0789021-0789027.
[9]	TOROCZKAI Z , BASSLER K E . Network dynamics:jamming is limited in scale-free systems[J]. Nature, 2004,428(716): 716-716.
[10]	ARENAS A , DIAZ-GUILERA A , GUIMERA R . Communication in networks with hierarchical branching[J]. Physical Review Letters, 2001,86(14): 3196-3199.
[11]	ZHAO L , LAI Y C , PARK K , YE N . Onset of traffic congestion in complex networks[J]. Physica Review E, 2005,71(2): 0261251-0261258.
[12]	GUIMERA R , DIAZ-GUILERA A , VEGA-REDONDO F , et al. Optimal network topologies for local search with congestion[J]. Physical Review Letters, 2002,89(24): 2487011-2487014.
[13]	LIU Z , HU M B , JIANG R , et al. Method to enhance traffic capacity for scale-free networks[J]. Physical Review E, 2007,76(3): 0371011-0371014.
[14]	WEI H , TOMMY W S C . An efficient strategy for enhancing traffic capacity by removing links in scale-free networks[J]. Journal of Statistical Mechanics:Theory and Experiment, 2010,2010(1): 2-12.
[15]	BRZEZINSKI A , MODIANO E . Achieving 100% throughput in reconfigurable optical networks[J]. Networking,IEEE/ACM Transactions on, 2008,16(4): 970-983.
[16]	GUIMERA R , ARENASB A , DIAZ-GUILERA A . Communication and optimal hierarchical networks[J]. Physica A:Statistical Mechanics and its Applications, 2001,299(1-2): 247-252.
[17]	YIN C Y , WANG B H , WANG W X , et al. Efficient routing on a scale-free networks based on local information[J]. Physics Letters, 2006,351(4/5): 220-224.
[18]	NEWMAN M E J , GIRVAN M . Finding and evaluating community structure in networks[J]. Physical Review E, 2004,69(2): 0261131-02611315.
[19]	GUIMERA R , AMARAL L . Cartography of complex networks:modules and universal roles[J]. Journal of Statistical Mechanics:Theory and Experiment, 2005,2005(2): 1-13.
[20]	SANTO F . Community detection in graphs[J]. Physics Reports, 2010,486(3/5): 75-174.
[21]	NGUYEN N P , DINH T N , XUAN Y , et al. Adaptive algorithms for detecting community structure in dynamic social networks[A]. Proceedings of the IEEE INFOCOM[C]. Shanghai,China, 2011. 2282-2290.
[22]	杨博, 刘大有等．复杂网络聚类方法[J]. 软件学报, 2009,20(1):54-66. YANG B , LIU D Y , et al. Complex network clustering algorithms[J]. Journal of Software, 2009,20(1):54-66.
[23]	NEWMAN M E J . Fast algorithm for detecting community structure in networks[J]. Physical Review E, 2004,69(6): 0661331-0661335.
[24]	HOLME P , KIM B J , YOON C N , et al. Attack vulnerability of complex networks[J]. Physical Review E, 2002,65(5): 0561091-05610914.
[25]	XIE Z , LI X , WANG X F . A new community-based evolving network model[J]. Physical A:Statistical Mechanics and Its Applications, 2007,384(2): 725-732.
[26]	WANG W X , WANG B H , YIN C Y , et al. Traffic dynamics based on local routing protocol on a scale-free network[J]. Physical Review E, 2006,73(2): 0261111-0261117.
[27]	PRIYA M , DMITRI K , MARINA F , et al. The Internet AS-level to-pology:three data sources and one definitive metric[J]. ACM SIG-COMM Computer Communication Review, 2006,36(1): 17-26.

有效提高Internet传输性能的社团结构改善策略

Improving community structure strategy for efficiently enhancing Internet transmission performance

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 13

参考文献 27

相关文章 15

Metrics

推荐阅读 0

[1]	闫文浩, 姜子敬, 黄欣, 朱淑娟, 丁群. 广义二维多项式混沌映射及其在信息传输中的应用[J]. 通信学报, 2022, 43(9): 80-89.
[2]	孙雁飞, 尹嘉峥, 亓晋, 胡筱旋, 陈梦婷, 董振江. 基于动态图嵌入的车联网拓扑控制[J]. 通信学报, 2022, 43(6): 133-142.
[3]	顾秋阳, 吴宝, 池仁勇. 基于高阶路径相似度的复杂网络链路预测方法[J]. 通信学报, 2021, 42(7): 61-69.
[4]	顾秋阳, 吴宝, 孙兆洋, 池仁勇. 基于改进灰狼优化的复杂网络重要节点识别算法[J]. 通信学报, 2021, 42(6): 72-83.
[5]	韩涛, 贺威, 代俊, 左勇, 杨旸, 葛晓虎. 基于无标度网络的车联网连通性研究[J]. 通信学报, 2021, 42(4): 100-108.
[6]	朱近康, 柴名扬, 周武旸. 面向B5G/6G的三三三网络体系架构和优化学习机制[J]. 通信学报, 2021, 42(4): 62-75.
[7]	张胜,戴维凯,吴锋,蓝文祥. 基于分形特性的复杂网络全局效率估计方法[J]. 通信学报, 2020, 41(7): 204-212.
[8]	吴翼腾,于洪涛,黄瑞阳,李华巍. 采用组合方法进行链路预测的理论极限研究[J]. 通信学报, 2020, 41(6): 34-50.
[9]	刘树新,李星,陈鸿昶,王凯. 基于资源传输匹配度的复杂网络链路预测方法[J]. 通信学报, 2020, 41(6): 70-79.
[10]	项英倬,徐正国,游凌. 基于节点通信行为时序的指控信息流挖掘算法[J]. 通信学报, 2019, 40(9): 51-60.
[11]	李凤华,陈天柱,王震,张林杰,史国振,郭云川. 复杂网络环境下跨网访问控制机制[J]. 通信学报, 2018, 39(2): 1-10.
[12]	陈晶,万云. 社交网络中基于模块度最大化的标签传播算法的研究[J]. 通信学报, 2017, 38(2): 25-33.
[13]	邓琨,李文平,余法红,张健沛. 基于多核心标签传播的复杂网络重叠社区识别方法[J]. 通信学报, 2017, 38(2): 53-66.
[14]	张洛什,王大伟,薛一波. 基于流感知的复杂网络应用识别模型[J]. 通信学报, 2015, 36(3): 161-169.
[15]	刘君,乔建志. 复杂网络中k-核与网络聚集系数的关联性研究[J]. 通信学报, 2015, 36(1): 224-229.