vix.ing · top · new · best · stats · spec

Scheduling in Parallel Queues with Randomly Varying Connectivity and\n Switchover Delay

2010/08/13 by Güner D. Çelik, Celik, Guner D., Long Bao Le +3
Computer Science · Engineering · Business, Management and Accounting · #Age of Information Optimization #Advanced Wireless Network Optimization #Advanced Queuing Theory Analysis

paper · pdf · doi:10.48550/arxiv.1008.2347

Abstract

We consider a dynamic server control problem for two parallel queues with\nrandomly varying connectivity and server switchover time between the queues. At\neach time slot the server decides either to stay with the current queue or\nswitch to the other queue based on the current connectivity and the queue\nlength information. The introduction of switchover time is a new modeling\ncomponent of this problem, which makes the problem much more challenging. We\ndevelop a novel approach to characterize the stability region of the system by\nusing state action frequencies, which are stationary solutions to a Markov\nDecision Process (MDP) formulation of the corresponding saturated system. We\ncharacterize the stability region explicitly in terms of the connectivity\nparameters and develop a frame-based dynamic control (FBDC) policy that is\nshown to be throughput-optimal. In fact, the FBDC policy provides a new\nframework for developing throughput-optimal network control policies using\nstate action frequencies. Furthermore, we develop simple Myopic policies that\nachieve more than 96% of the stability region. Finally, simulation results show\nthat the Myopic policies may achieve the full stability region and are more\ndelay efficient than the FBDC policy in most cases.\n

Related