Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse
Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse
复制标题
具有最大权重策略的交换网络：流体近似和乘法状态空间崩溃
DOI：
10.1214/11-aap759
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
D. Wischik
中科院分区：
文献类型：
--
作者：
Devavrat Shah;D. Wischik
我们考虑一个排队网络，其中对可以同时服务的队列存在限制；这种网络可用于对输入排队交换机和无线网络进行建模。这种网络的调度策略指定在任何时间点服务哪些队列。我们考虑一系列调度策略，与 Tassiulas 和 Ephremides 的最大权重策略相关 [IEEE Trans.自动机。 Control 37 (1992) 1936--1948]，用于单跳和多跳网络。我们指定了一个流体模型，并表明流体尺度的性能过程可以通过流体模型解决方案来近似。我们研究临界负载下流体模型解的行为，并将不变状态描述为解决某个网络范围优化问题的状态。我们使用流体模型结果来证明乘法状态空间崩溃。我们的结果的一个显着特点是它们没有假设完全的资源池。
We consider a queueing network in which there are constraints on which queues may be served simultaneously; such networks may be used to model input-queued switches and wireless networks. The scheduling policy for such a network specifies which queues to serve at any point in time. We consider a family of scheduling policies, related to the maximum-weight policy of Tassiulas and Ephremides [IEEE Trans. Automat. Control 37 (1992) 1936--1948], for single-hop and multihop networks. We specify a fluid model and show that fluid-scaled performance processes can be approximated by fluid model solutions. We study the behavior of fluid model solutions under critical load, and characterize invariant states as those states which solve a certain network-wide optimization problem. We use fluid model results to prove multiplicative state space collapse. A notable feature of our results is that they do not assume complete resource pooling.