论文标题
对称的分析最短轨道队列
Analysis of the Symmetric Join the Shortest Orbit Queue
论文作者
论文摘要
这项工作介绍了在重试设置中加入最短的队列策略。我们考虑了一个具有两个无限容量轨道的Markovian单个服务器重试系统。到达的工作发现服务器很忙，它被转发到负载最少的轨道。否则，将其随机转发到轨道。将两种类型的轨道作业旋转为重试以独立访问服务器。我们研究了稳定性条件，固定的尾巴衰减速率，并使用补偿方法获得平衡分布。
This work introduces the join the shortest queue policy in the retrial setting. We consider a Markovian single server retrial system with two infinite capacity orbits. An arriving job finding the server busy, it is forwarded to the least loaded orbit. Otherwise, it is forwarded to an orbit randomly. Orbiting jobs of either type retry to access the server independently. We investigate the stability condition, the stationary tail decay rate, and obtain the equilibrium distribution by using the compensation method.
