arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0407057math.PR
收藏

基于公平带宽共享策略的网络流模型

Fluid model for a network operating under a fair bandwidth-sharing policy

F. P. Kelly, R. J. Williams

摘要:

我们考虑一个模型的互联网拥塞控制,代表了随机变化的流量存在于网络中的带宽之间的文件传输公平地共享。我们研究了临界流体模型,当至少一个资源的平均负载等于其容量时,根据大数定律标度得到的形式极限。我们建立收敛到平衡的流体模型,并确定了不变流形。不变流形的形式给出了对夹带现象的洞察,由此某些资源的拥塞可能会阻止其他资源以其满负荷工作。

英文摘要:

We consider a model of Internet congestion control that represents the randomly varying number of flows present in a network where bandwidth is shared fairly between document transfers. We study critical fluid models obtained as formal limits under law of large numbers scalings when the average load on at least one resource is equal to its capacity. We establish convergence to equilibria for fluid models and identify the invariant manifold. The form of the invariant manifold gives insight into the phenomenon of entrainment whereby congestion at some resources may prevent other resources from working at their full capacity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑