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

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

Abstract

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

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

Figures/Tables 13

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

Improving community structure strategy for efficiently enhancing Internet transmission performance

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 13

References 27

Related Articles 15

Metrics

Recommended 0

[1]	Yang GAO, Hongli ZHANG. Survey on community detection method based on random walk [J]. Journal on Communications, 2023, 44(6): 198-210.
[2]	Yanfei SUN, Jiazheng YIN, Jin QI, Xiaoxuan HU, Mengting CHEN, Zhenjiang DONG. Topology control based on dynamic graph embedding in Internet of vehicles [J]. Journal on Communications, 2022, 43(6): 133-142.
[3]	Qiuyang GU, Bao WU, Renyong CHI. Link prediction method based on the similarity of high path [J]. Journal on Communications, 2021, 42(7): 61-69.
[4]	Qiuyang GU, Bao WU, Zhaoyang SUN, Renyong CHI. Key node identification algorithm for complex network based on improved grey wolf optimization [J]. Journal on Communications, 2021, 42(6): 72-83.
[5]	Jinkang ZHU, Mingyang CHAI, Wuyang ZHOU. Three-three-three network architecture and learning optimization mechanism for B5G/6G [J]. Journal on Communications, 2021, 42(4): 62-75.
[6]	Tao HAN, Wei HE, Jun DAI, Yong ZUO, Yang YANG, Xiaohu GE. Connectivity analysis of IoV based on scale-free network [J]. Journal on Communications, 2021, 42(4): 100-108.
[7]	Sheng ZHANG,Weikai DAI,Feng WU,Wenxiang LAN. Global efficiency estimation method of complex network based on fractal property [J]. Journal on Communications, 2020, 41(7): 204-212.
[8]	Yiteng WU,Hongtao YU,Ruiyang HUANG,Huawei LI. Theoretical limit of link prediction using a combination method [J]. Journal on Communications, 2020, 41(6): 34-50.
[9]	Shuxin LIU,Xing LI,Hongchang CHEN,Kai WANG. Link prediction method based on matching degree of resource transmission for complex network [J]. Journal on Communications, 2020, 41(6): 70-79.
[10]	Yingzhuo XIANG,Zhengguo XU,Ling YOU. Instruction flow mining algorithm based on the temporal sequence of node communication actions [J]. Journal on Communications, 2019, 40(9): 51-60.
[11]	Fenghua LI,Tianzhu CHEN,Zhen WANG,Linjie ZHANG,Guozhen SHI,Yunchuan GUO. Cross-network access control mechanism for complex network environment [J]. Journal on Communications, 2018, 39(2): 1-10.
[12]	Jing CHEN,Yun WAN. Research on label propagation algorithm based on modularity maximization in the social network [J]. Journal on Communications, 2017, 38(2): 25-33.
[13]	Kun DENG,Wen-ping LI,Fa-hong YU,Jian-pei ZHANG. Overlapping community detection in complex networks based on multi kernel label propagation [J]. Journal on Communications, 2017, 38(2): 53-66.
[14]	Chao-yuan CUI,Yun WU,Ping LI,Xiao-ming ZHANG. Narrowing the semantic gap in virtual machine introspection [J]. Journal on Communications, 2015, 36(8): 31-37.
[15]	Jun LIU,Jian-zhong QIAO. Research on relevance between k-core and clustering coefficient in complex network [J]. Journal on Communications, 2015, 36(1): 224-229.