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

基于中心极限定理的大型乘积型网络的渐近性和标度性

Asymptotics and scalings for large product-form networks via the Central Limit Theorem

Guy Fayolle, Jean-Marc Lasgouttes

摘要:

当$n$和$m_n$同时变大时,分析了具有$n$队列和$m_n$客户端的封闭BCMP网络的渐近行为.我们的方法依赖于Berry-Esseen型近似来在中心极限定理。我们构建临界序列$m^0_n$,这是必要的和足够的饱和和非饱和的制度之间的网络区分。这些结果的几个应用。结果表明,一些队列可以作为瓶颈,从而限制了系统的全局效率。

英文摘要:

The asymptotic behaviour of a closed BCMP network, with $n$ queues and $m_n$ clients, is analyzed when $n$ and $m_n$ become simultaneously large. Our method relies on Berry-Esseen type approximations coming in the Central Limit Theorem. We construct critical sequences $m^0_n$, which are necessary and sufficient to distinguish between saturated and non-saturated regimes for the network. Several applications of these results are presented. It is shown that some queues can act as bottlenecks, limiting thus the global efficiency of the system.

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

↑