小世界网络中拥塞的扩展
Scaling of Congestion in Small World Networks
摘要:
在这份报告中,我们表明,在一个平面指数增长的网络组成的$N$节点,拥塞规模为$O(N^2/\log(N))$独立的流量如何可能被路由。这与平坦多项式增长网络中拥塞的$O(N^{3/2})$缩放形成对比。我们还表明,没有平面性条件,在一个小世界网络的拥塞可以规模低至$O(N^{1+ε})$,任意小的$ε$。这些极端的结果表明,小世界属性本身不能提供指导的网络中的拥塞程度和其他特征需要更好的解决方案。最后,我们调查的缩放下的测地流,也就是说,当流路由的最短路径的基础上的链路度量的拥塞。在这里,我们证明,如果链接的权重缩放任意小或大的乘数,那么拥塞可能会发生相当大的变化。然而,如果我们约束的链路权重乘数有界远离零和无穷大,那么变化的拥塞,由于这样的非线性可以忽略不计。
英文摘要:
In this report we show that in a planar exponentially growing network consisting of $N$ nodes, congestion scales as $O(N^2/\log(N))$ independently of how flows may be routed. This is in contrast to the $O(N^{3/2})$ scaling of congestion in a flat polynomially growing network. We also show that without the planarity condition, congestion in a small world network could scale as low as $O(N^{1+ε})$, for arbitrarily small $ε$. These extreme results demonstrate that the small world property by itself cannot provide guidance on the level of congestion in a network and other characteristics are needed for better resolution. Finally, we investigate scaling of congestion under the geodesic flow, that is, when flows are routed on shortest paths based on a link metric. Here we prove that if the link weights are scaled by arbitrarily small or large multipliers then considerable changes in congestion may occur. However, if we constrain the link-weight multipliers to be bounded away from both zero and infinity, then variations in congestion due to such remetrization are negligible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。