arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.05979cs.PFcs.DM
收藏

具有任意服务器-作业能力的FCFS排队模型的乘积形式:综述

Product Forms for FCFS Queueing Models with Arbitrary Server-Job Compatibilities: An Overview

Kristen Gardner, Rhonda Righter

摘要:

近年来,许多模型,涉及不同的兼容性之间的作业和服务器之间的调度系统,或代理和资源之间的匹配系统,已被研究,并在马尔可夫假设和适当的稳定性条件下,平稳分布已被证明有产品的形式。我们调查这些结果,并显示如何在适当的详细描述的状态下,许多是推论的顺序独立队列的类似结果。我们还讨论了如何使用产品形式的结果,以确定稳态响应时间的分布。

英文摘要:

In recent years a number of models involving different compatibilities between jobs and servers in queueing systems, or between agents and resources in matching systems, have been studied, and, under Markov assumptions and appropriate stability conditions, the stationary distributions have been shown to have product forms. We survey these results and show how, under an appropriate detailed description of the state, many are corollaries of similar results for the Order Independent Queue. We also discuss how to use the product form results to determine distributions for steady-state response times.

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

↑