We consider a multiclass 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
capacity by increasing the number of packets within the network. We show that
the stationary throughput of routes on this sequence of networks converges to
an allocation that maximises 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.
Publié le : 2011-03-15
Classification:
Utility optimization,
queueing network,
quasi-reversible,
large deviation,
congestion window,
congestion control,
90B15,
60K25,
90B22,
90B18
@article{1300198137,
author = {Walton, N. S.},
title = {Utility optimization in congested queueing networks},
journal = {J. Appl. Probab.},
volume = {48},
number = {1},
year = {2011},
pages = { 68-89},
language = {en},
url = {http://dml.mathdoc.fr/item/1300198137}
}
Walton, N. S. Utility optimization in congested queueing networks. J. Appl. Probab., Tome 48 (2011) no. 1, pp. 68-89. http://gdmltest.u-ga.fr/item/1300198137/