For Manuscript Submission, Check or Review Login please go to Submission Websites List.
For the academic login, please select your country in the dropdown list. You will be redirected to verify your credentials.
Traffic Dynamics in Scale-Free NetworksFekete A.a · Vattay G.a · Kocarev L.b
aCollegium Budapest, Institute for Advanced Studies, Budapest, Hungary; bUniversity of California, San Diego, Institute for Nonlinear Sciences, La Jolla, Calif., USA Corresponding Author
Collegium Budapest, Institute for Advanced Studies
Szentháromság u. 2.
HU–1014 Budapest (Hungary)
Tel. +36 1 224 8338, Fax +36 1 224 8310, E-Mail firstname.lastname@example.org
We study traffic dynamics in growing scale-free networks. Both the scale-free structure of the network and the adaptive nature of the dynamics which controls traffic in the network are considered in the model. The model is investigated with computer simulations and analytically for the case of a scale-free tree. For the scale-free tree, an exact formula and its power law approximation of the complementary cumulative distribution function of link load (edge betweenness) is presented. We examine whether the scaling properties of the network affect the performance of the transport mechanism and estimate the average number of competing transport mechanisms at bottlenecks. We find that bottlenecks tend to appear on the periphery of the network as the performance increases. Various bandwidth allocation strategies are compared. We show that the best performance is achieved when capacity is distributed proportionally to the expected load of links. We demonstrate that it is necessary to study both the topology and the dynamics of the transport mechanism to understand the whole system.
© 2006 S. Karger AG, Basel