拥塞排队网络中的效用Optimization
Utility Optimization in Congested Queueing Networks
摘要：
我们考虑一个多类单服务器排队网络作为一个分组交换网络的模型。分组被发送到该网络的速率由充当拥塞窗口的队列控制。通过考虑一系列的拥塞控制，我们分析了一系列的平稳排队网络。在这个渐近制度中，网络的服务能力保持不变，拥塞控制器的序列采取行动，以利用网络的容量，通过增加网络内的数据包的数量。我们表明，在这个序列的网络收敛到一个分配，最大限度地提高总效用的网络的容量限制的固定吞吐量的路线。为了进行这种分析，我们要求我们的效用函数满足指数型条件。该实用程序族包括加权$α$ -用于$α>1$的公平实用程序。
英文摘要：
We consider a multi-class single server queueing network as a model of a packet switching network. The rates packets are sent into this network are controlled by queues which act as congestion windows. By considering a sequence of congestion controls, we analyse a sequence of stationary queueing networks. In this asymptotic regime, the service capacity of the network remains constant and the sequence of congestion controllers act to exploit the network's capcity by increasing the number of packets within the network. We show the stationary throughput of routes on this sequence of networks converges to an allocation that maximizes aggregate utility subject to the network's capacity constraints. To perform this analysis, we require that our utility functions satisfy an exponential concavity condition. This family of utilities includes weighted $α$-fair utilities for $α>1$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
