Traffic properties for extended random walks on scale-free networks

スポンサーリンク

概要

• 論文の詳細を見る

• On scale-free networks, we investigate traffic properties of stochastic routings inspired by a zero-range process with tunable parameters $\alpha$ and $\delta$, in which, at each time step, a packet jumps out of its resident node $i$ stochastically at a given rate $m_{(i)}^{\delta - 1}$ for the occupied queue length $m_{(i)}$, and then comes into a neighboring node $j$ chosen with probability proportionally to the $\alpha$-power $K_{j}^{\alpha}$ of the degree $K_{j}$. Through an approximative analysis and numerical simulations, we confirm the phase transition between the condensation at hubs in $0 \leq \delta < \delta_{c}$ and the uncondensation over a wide range of $\delta > \delta_{c} \approx (1 + \alpha)/2 \geq 0$ for $\alpha < 0$ in both cases with/without the realistic nearest-neighbor search into a terminal node at the last step. In the case with the search, we have new results; In the low-performance regime at a small $\delta$, the wandering path for $\alpha < 0$ better reduces the mean travel time of a packet with a high reachability. Although, in the high-performance regime at a large $\delta$, the difference for $\alpha > 0$ and $\alpha < 0$ is small, neither the wandering long path with a short waiting trapped at a node ($\alpha = -1$), nor the short hopping path with a long waiting trapped at hubs ($\alpha = 1$) becomes a good strategy. An uniformly random walk ($\alpha = 0$) yields slightly better performance. On the fundamental traffic properties, we discuss the congestion phenomena with packet generations.

• 一般社団法人情報処理学会の論文
• 2010-02-25

著者

• Yasumasa Ono

  Japan Advanced Institute Of Science And Technology

• Ono Yasumasa

  Japan Advanced Inst. Of Sci. And Technol.

• Yukio Hayashi

  Japan Advanced Institute of Science and Technology

関連論文

• Traffic properties for extended random walks on scale-free networks
• Traffic properties for stochastic routing on scale-free networks

スポンサーリンク