ENHANCING NETWORK PERFORMANCE BY EDGE ADDITION

被引:83
作者
Jiang, Zhongyuan [1 ]
Liang, Mangui
Guo, Dongchao
机构
[1] Beijing Jiaotong Univ, Inst Informat Sci, Beijing 100044, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2011年 / 22卷 / 11期
关键词
Edge addition; transmission efficiency; robustness; network performance; ROBUSTNESS; ALGORITHM;
D O I
10.1142/S0129183111016841
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Transmission efficiency and robustness are two important properties of various networks and a number of optimization strategies have been proposed recently. We propose a scheme to enhance the network performance by adding a small fraction of links (or edges) to the currently existing network topology, and we present four edge addition strategies for adding edges efficiently. We aim at minimizing the maximum node betweenness of any node in the network to improve its transmission efficiency, and a number of experiments on both Barabasi-Albert (BA) and Erdos-Renyi (ER) networks have confirmed the effectiveness of our four edge addition strategies. Also, we evaluate the effect of some other measure metrics such as average path length, average betweenness, robustness, and degree distribution. Our work is very valuable and helpful for service providers to optimize their network performance by adding a small fraction of edges or to make good network planning on the existing network topology incrementally.
引用
收藏
页码:1211 / 1226
页数:16
相关论文
共 27 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[3]   Improving network robustness by edge modification [J].
Beygelzimer, A ;
Grinstein, GE ;
Linsker, R ;
Rish, I .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2005, 357 (3-4) :593-612
[4]   A faster algorithm for betweenness centrality [J].
Brandes, U .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177
[5]   FINDING GOOD APPROXIMATE VERTEX AND EDGE PARTITIONS IS NP-HARD [J].
BUI, TN ;
JONES, C .
INFORMATION PROCESSING LETTERS, 1992, 42 (03) :153-159
[6]   Self-adapting network topologies in congested scenarios -: art. no. 035103 [J].
Cholvi, V ;
Laderas, V ;
López, L ;
Fernández, A .
PHYSICAL REVIEW E, 2005, 71 (03)
[7]   Optimal transport on complex networks [J].
Danila, Bogdan ;
Yu, Yong ;
Marsh, John A. ;
Bassler, Kevin E. .
PHYSICAL REVIEW E, 2006, 74 (04)
[8]   Collectively optimal routing for congested traffic limited by link capacity [J].
Danila, Bogdan ;
Sun, Yudong ;
Bassler, Kevin E. .
PHYSICAL REVIEW E, 2009, 80 (06)
[9]  
Echenique P, 2004, PHYS REV E, V70, DOI 10.1103/PhysRevE.70.056105
[10]  
ERDOS P, 1960, B INT STATIST INST, V38, P343