MaxWeight Scheduling
MaxWeight Scheduling
复制标题
最大权重调度
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
A. Stolyar
中科院分区：
文献类型：
--
作者：
Rahul Singh;A. Stolyar
该模型是“广义开关”，在离散时间内为多个流量提供服务。该开关使用MaxWeight算法在每个时间步骤中做出服务决策（调度选择），这确定了将提供的服务量的概率分布。我们主要是出于以下问题的动机：在繁重的交通状态下，当开关负载接近临界水平时，提供给每个流量的服务过程是否会保持“平滑”（即服务中没有较大的服务差距）？解决这个问题可以减少对流量中未量的队列差异过程的渐近行为的分析。我们证明，该过程的固定态度将我们明确描述的结构融合到了正面的马尔可夫链。反过来，这意味着服务过程的渐近“平滑度”。
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the amount of service that will be provided. We are primarily motivated by the following question: in the heavy traffic regime, when the switch load approaches critical level, will the service processes provided to each flow remain "smooth" (i.e., without large gaps in service)? Addressing this question reduces to the analysis of the asymptotic behavior of the unscaled queue-differential process in heavy traffic. We prove that the stationary regime of this process converges to that of a positive recurrent Markov chain, whose structure we explicitly describe. This in turn implies asymptotic "smoothness" of the service processes.