arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0705.0425cs.NI
收藏

具有超指数服务时间的批处理机共享

Batch Processor Sharing with Hyper-Exponential Service Time

Natalia Osipova

摘要:

研究了服务时间服从超指数分布且成批到达过程为泊松过程的批处理机共享(BPS)排队模型。研究BPS的主要目标之一是其在基于大小的调度中应用的可能性,该调度用于区分互联网中的短流和长流。在超指数服务时间分布的情况下,我们找到了BPS队列的期望条件响应时间的解析表达式。我们表明,预期的条件响应时间是一个凹函数的服务时间。将所得结果应用于服务时间服从超指数分布的两级处理器共享(TLPS)模型,得到了TLPS模型的期望响应时间的表达式. TLPS调度规则可以应用于TCP/IP网络中基于大小的区分和Web服务器请求处理。

英文摘要:

We study Batch Processor-Sharing (BPS) queuing model with hyper-exponential service time distribution and Poisson batch arrival process. One of the main goals to study BPS is the possibility of its application in size-based scheduling, which is used in differentiation between Short and Long flows in the Internet. In the case of hyper-exponential service time distribution we find an analytical expression of the expected conditional response time for the BPS queue. We show, that the expected conditional response time is a concave function of the service time. We apply the received results to the Two Level Processor-Sharing (TLPS) model with hyper-exponential service time distribution and find the expression of the expected response time for the TLPS model. TLPS scheduling discipline can be applied to size-based differentiation in TCP/IP networks and Web server request handling.

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

↑