Traffic Properties for Stochastic Routing on Scale-Free Networks
-
- HAYASHI Yukio
- Japan Advanced Institute of Science and Technology
-
- ONO Yasumasa
- Japan Advanced Institute of Science and Technology
Search this article
Abstract
For realistic scale-free networks, we investigate the traffic properties of stochastic routing inspired by a zero-range process known in statistical physics. By parameters α and δ, this model controls degree-dependent hopping of packets and forwarding of packets with higher performance at more busy nodes. Through a theoretical analysis and numerical simulations, we derive the condition for the concentration of packets at a few hubs. In particular, we show that the optimal α and δ are involved in the trade-off between a detour path for α < 0 and long wait at hubs for α > 0; In the low-performance regime at a small δ, the wandering path for α < 0 better reduces the mean travel time of a packet with high reachability. Although, in the high-performance regime at a large δ, the difference between α > 0 and α < 0 is small, neither the wandering long path with short wait trapped at nodes (α = -1), nor the short hopping path with long wait trapped at hubs (α = 1) is advisable. A uniformly random walk (α = 0) yields slightly better performance. We also discuss the congestion phenomena in a more complicated situation with packet generation at each time step.
Journal
-
- IEICE Transactions on Communications
-
IEICE Transactions on Communications E94-B (5), 1311-1322, 2011
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390282679352939904
-
- NII Article ID
- 10029504763
-
- NII Book ID
- AA10826261
-
- ISSN
- 17451345
- 09168516
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- IRDB
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed