https://doi.org/10.1140/epjb/e2004-00113-2
Packet transport along the shortest pathways in scale-free networks
School of Physics, Seoul National University NS50, Seoul 151-747, Korea
Corresponding author: a cmghim@phya.snu.ac.kr
Received:
27
October
2003
Revised:
4
February
2004
Published online:
14
May
2004
We investigate a problem of data packet transport between a pair of
vertices on scale-free networks without loops or with a small number
of loops. By introducing load of a vertex as accumulated sum
of a fraction of data packets traveling along the shortest pathways
between every pair of vertices, it is found that the load distribution
follows a power law with an exponent δ. It is found for
the Barabási-Albert-type model that the exponent δ
changes abruptly from 
for tree structure to 
as the number of loops increases. The load exponent seems to be insensitive
to different values of the degree exponent γ as long as 
.
PACS: 89.75.Fb – Structures and organization in complex systems / 05.65.+b – Self-organized systems / 02.10.Ox – Combinatorics; graph theory
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2004
