Dynamic server allocation to parallel queues with randomly varying connectivity

L Tassiulas, A Ephremides - IEEE Transactions on Information …, 1993 - ieeexplore.ieee.org
IEEE Transactions on Information Theory, 1993ieeexplore.ieee.org
Consider N parallel queues competing for the attention of a single server. At each time slot
each queue may be connected to the server or not depending on the value of a binary
random variable, the connectivity variable. Allocation at each slot; is based on the
connectivity information and on the lengths of the connected queues only. At the end of each
slot, service may be completed with a given fixed probability. Such a queueing model is
appropriate for some communication networks with changing topology. In the case of infinite …
Consider N parallel queues competing for the attention of a single server. At each time slot each queue may be connected to the server or not depending on the value of a binary random variable, the connectivity variable. Allocation at each slot; is based on the connectivity information and on the lengths of the connected queues only. At the end of each slot, service may be completed with a given fixed probability. Such a queueing model is appropriate for some communication networks with changing topology. In the case of infinite buffers, necessary and sufficient conditions are obtained for stabilizability of the system in terms of the different system parameters. The allocation policy that serves the longest connected queue stabilizes the system when the stabilizability conditions hold. The same policy minimizes the delay for the special case of symmetric queues. In a system with a single buffer per queue, an allocation policy is obtained that maximizes the throughput and minimizes the delay when the arrival and service statistics of different queues are identical.< >
ieeexplore.ieee.org
Showing the best result for this search. See all results