Optimal scheduling in multi-server queues with random connectivity and retransmissions

Authors:
Hussein Al-Zubaidy;Ioannis Lambadaris;Yannis Viniotis
Affiliations:
ECE - University of Toronto, Toronto, ON, Canada;SCE - Carleton University, Ottawa, ON, Canada;ECE - North Carolina State University, Raleigh, NC, USA
Venue:
Computer Communications
Year:
2012

Citing 13
Cited 1

Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
Introduction to Stochastic Dynamic Programming: Probability and Mathematical

Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Optimal Transmission Policies for Noisy Channels

Operations Research
A framework for opportunistic scheduling in wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS

Probability in the Engineering and Informational Sciences
ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES

Probability in the Engineering and Informational Sciences
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

Operations Research
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data

Journal of the ACM (JACM)
Optimal resource scheduling in wireless multiservice systems with random channel connectivity

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Instability of the proportional fair scheduling algorithm for HDR

IEEE Transactions on Wireless Communications
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity

IEEE Transactions on Information Theory
Dynamic server allocation to parallel queues with randomly varying connectivity

IEEE Transactions on Information Theory

QoE-aware optimization of multimedia flow scheduling

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

We investigate an optimal scheduling problem in a discrete-time, multiserver system of parallel queues. The servers are connected to the queues in a random fashion and scheduled packets complete service successfully with a given probability. This model is suitable for the study of dynamic packet scheduling problems in wireless systems. We study first a two-server system of two infinite-capacity queues with homogeneous arrival, service and connectivity assumptions. We use coupling arguments to prove that a ''Most Balancing'' scheduling policy is optimal, in a stochastic ordering sense, for this system. We then consider a finite-capacity, non-homogeneous, multi-server and multi-queue system. We develop a dynamic programming model to determine numerically the scheduling policy that optimizes a range of cost functions, including average total queue sizes. We also compare the performance of the optimal policy to that of a few other policies via simulations.