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

Traffic Equations for Fluid Networks with Overflows

S. Fleuren, H. M. Jansen, E. Lefeber, Y. Nazarathy

英文摘要:

Many real life queueing networks have finite buffers with overflows. To understand the behavior of such networks, we consider traffic equations that generalize the traffic equations of classic open queueing networks where some nodes are potentially overloaded. We present a novel, efficient algorithm for solving the equations for overflow networks together with a sufficient condition for existence and uniqueness of solutions. Our analysis also sharpens results of traffic equations for classic open queueing networks.

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

↑