离散时间离散网络的稳定域和容量域
Stability and Capacity Regions or Discrete Time Queueing Networks
摘要:
研究了离散时间离散系统的稳定性和网络容量。描述了四种常见的稳定性概念之间的关系。具体来说,我们考虑率稳定性,平均率稳定性,稳态稳定性,强稳定性。然后,我们考虑网络的队列与随机事件和控制行动,可以随着时间的推移来影响到达和服务的队列。控制动作还生成附加网络属性的向量。我们的网络容量区域的特点,是封闭的所有速率向量,可以支持受网络稳定性和额外的时间平均属性约束的集合。我们表明,(在温和的技术假设下)的容量区域是相同的所有四个稳定性定义。我们的容量可扩展性证明使用的漂移加惩罚方法的李雅普诺夫优化,并提供了完整的细节的情况下,当网络状态服从衰减的记忆属性,这适用于有限状态遍历系统和更一般的系统。
英文摘要:
We consider stability and network capacity in discrete time queueing systems. Relationships between four common notions of stability are described. Specifically, we consider rate stability, mean rate stability, steady state stability, and strong stability. We then consider networks of queues with random events and control actions that can be implemented over time to affect arrivals and service at the queues. The control actions also generate a vector of additional network attributes. We characterize the network capacity region, being the closure of the set of all rate vectors that can be supported subject to network stability and to additional time average attribute constraints. We show that (under mild technical assumptions) the capacity region is the same under all four stability definitions. Our capacity achievability proof uses the drift-plus-penalty method of Lyapunov optimization, and provides full details for the case when network states obey a decaying memory property, which holds for finite state ergodic systems and more general systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。