Decorrelation of networked communication flow via load-dependent routing weights

被引：4

作者：

Scholz, Jan ^{[1
,2
]}

Krause, Wolfram ^{[3
]}

Greiner, Martin ^{[4
]}

机构：

[1] Goethe Univ Frankfurt, Frankfurt Inst Adv Studies, D-60438 Frankfurt, Germany

[2] Goethe Univ Frankfurt, Frankfurt Int Grad Sch Sci, D-60438 Frankfurt, Germany

[3] EWE, D-26655 Westerstede, Germany

[4] Siemens AG, Corp Res & Technol, Informat & Commun, D-81730 Munich, Germany

来源：

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS | 2008年 / 387卷 / 12期

关键词：

complex networks; weighted networks; traffic flow; routing; Internet;

D O I：

10.1016/j.physa.2008.01.011

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

Clever assignments of link weights are able to change communication routes in such a way that loads are distributed almost evenly across a network. This is achieved by weight assignments based on the link load. As demonstrated for scale-free as well as synthetic Internet networks, they decorrelate the loads of the nodes and links from the network structure and increase the transport capacity of the network. For various Internet scans the increase of transport capacity amounts to a factor of around five when compared to shortest-path routing. (c) 2008 Elsevier B.V. All rights reserved.

引用

页码：2987 / 3000

页数：14

共 48 条

[1] Statistical mechanics of complex networks [J].

Albert, R ;

Barabási, AL .

REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97

[2] Emergence of scaling in random networks [J].

Barabási, AL ;

Albert, R .

SCIENCE, 1999, 286 (5439) :509-512

[3] The architecture of complex weighted networks [J].

Barrat, A ;

Barthélemy, M ;

Pastor-Satorras, R ;

Vespignani, A .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 (11) :3747-3752

[4]

BARRAT A, 2004, PHYS REV LETT

[5] Comment on "Universal behavior of load distribution in scale-free networks" -: art. no. 189803 [J].

Barthélemy, M .

PHYSICAL REVIEW LETTERS, 2003, 91 (18)

[6] Betweenness centrality in large complex networks [J].

Barthélemy, M .

EUROPEAN PHYSICAL JOURNAL B, 2004, 38 (02) :163-168

[7] A faster algorithm for betweenness centrality [J].

Brandes, U .

JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177

[8] Optimal paths in disordered complex networks [J].

Braunstein, LA ;

Buldyrev, SV ;

Cohen, R ;

Havlin, S ;

Stanley, HE .

PHYSICAL REVIEW LETTERS, 2003, 91 (16)

[9]

*CAIDA MACR TOP PR, CAIDA SKITT AS LINKS

[10]

Cancho RFI, 2003, LECT NOTES PHYS, V625, P114

← 1 2 3 4 5 →