Mathematics – Optimization and Control
Scientific paper
2011-12-06
Mathematics
Optimization and Control
6 pages, 4 figures, Proc. IEEE CDC-ECC 2011
Scientific paper
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).
Halabian Hassan
Lambadaris Ioannis
Lung Chung-Horng
No associations
LandOfFree
Delay Optimal Server Assignment to Symmetric Parallel Queues with Random Connectivities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Delay Optimal Server Assignment to Symmetric Parallel Queues with Random Connectivities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delay Optimal Server Assignment to Symmetric Parallel Queues with Random Connectivities will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-382179