Delay Optimal Server Assignment to Symmetric Parallel Queues with Random Connectivities

In this paper, we investigate the problem of assignment of \(K\) identical servers to a set of \(N\) parallel queues in a time slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue and each queue can be served b...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2011-12
Main Authors: Halabian, Hassan, Lambadaris, Ioannis, Chung-Horng Lung
Format: Article
Language:English
Subjects:
Delay
Markov analysis
Occupancy
Queues
Queuing theory
Resource allocation
Resource scheduling
Servers
Wireless networks
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we investigate the problem of assignment of \(K\) identical servers to a set of \(N\) parallel queues in a time slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue and each queue can be served by at most one server per time slot. Such queueing systems were widely applied in modeling the scheduling (or resource allocation) problem in wireless networks. It has been previously proven that Maximum Weighted Matching (MWM) is a throughput optimal server assignment policy for such queueing systems. In this paper, we prove that for a symmetric system with i.i.d. Bernoulli packet arrivals and connectivities, MWM minimizes, in stochastic ordering sense, a broad range of cost functions of the queue lengths including total queue occupancy (or equivalently average queueing delay).
ISSN:2331-8422
DOI:10.48550/arxiv.1112.1863