arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.3536cs.PF
收藏

一种非工作守恒的广义处理机共享队列的分析

Analysis of a non-work conserving Generalized Processor Sharing queue

Fabrice Guillemin

摘要:

本文研究了一个由两个到达时间为Poisson、服务时间为指数的队列组成的非工作守恒的广义处理器共享(GPS)系统。利用Fayolle \emph{et al}的一般结果,我们首先建立了该系统的稳定性条件.然后,我们确定的功能方程所满足的生成函数的数量在两个队列和相关的Riemann-Hilbert问题。我们证明了解的存在性和唯一性。这使我们能够完全描述系统,特别是计算空队列概率。最后,我们推导出一个队列中的作业数的尾渐近性。

英文摘要:

We consider in this paper a non work-conserving Generalized Processor Sharing (GPS) system composed of two queues with Poisson arrivals and exponential service times. Using general results due to Fayolle \emph{et al}, we first establish the stability condition for this system. We then determine the functional equation satisfied by the generating function of the numbers of jobs in both queues and the associated Riemann-Hilbert problem. We prove the existence and the uniqueness of the solution. This allows us to completely characterize the system, in particular to compute the empty queue probability. We finally derive the tail asymptotics of the number of jobs in one queue.

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

↑