Delay-Optimal Scheduling for Queueing Systems with Switching Overhead

01/13/2017
by   Ping-Chun Hsieh, et al.
0

We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to serve a different set of queues. The capacity loss due to this switching overhead can be significant in many emerging applications, and needs to be explicitly addressed in the design of scheduling policies. For example, in 60GHz wireless networks with directional antennas, base stations need to train and reconfigure their beam patterns whenever they switch from one client to another. Considerable switching overhead can also be observed in many other queueing systems such as transportation networks and manufacturing systems. While the celebrated Max-Weight policy achieves asymptotically optimal average delay for systems without switching overhead, it fails to preserve throughput-optimality, let alone delay-optimality, when switching overhead is taken into account. We propose a class of Biased Max-Weight scheduling policies that explicitly takes switching overhead into account. The Biased Max-Weight policy can use either queue length or head-of-line waiting time as an indicator of the system status. We prove that our policies not only are throughput-optimal, but also can be made arbitrarily close to the asymptotic lower bound on average delay. To validate the performance of the proposed policies, we provide extensive simulation with various system topologies and different traffic patterns. We show that the proposed policies indeed achieve much better delay performance than that of the state-of-the-art policy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2020

Throughput Optimal Decentralized Scheduling with Single-bit State Feedback for a Class of Queueing Systems

Motivated by medium access control for resource-challenged wireless Inte...
research
10/05/2022

Minimizing File Transfer Time in Opportunistic Spectrum Access Model

We study the file transfer problem in opportunistic spectrum access (OSA...
research
09/08/2018

Delay-Constrained Input-Queued Switch

In this paper, we study the delay-constrained input-queued switch where ...
research
10/03/2022

Minimizing Age of Processed Information in Wireless Networks

The freshness of real-time status processing of time-sensitive informati...
research
05/14/2019

QPS-r: A Cost-Effective Crossbar Scheduling Algorithm and Its Stability and Delay Analysis

Parallel iterative maximal matching algorithms (adapted for switching) h...
research
04/17/2018

Communication-Aware Scheduling of Serial Tasks for Dispersed Computing

There is a growing interest in development of in-network dispersed compu...
research
12/06/2022

Fresh-CSMA: A Distributed Protocol for Minimizing Age of Information

We consider the design of distributed scheduling algorithms that minimiz...

Please sign up or login with your details

Forgot password? Click here to reset