Stabilizing a Queue Subject to Activity-Dependent Server Performance

  title={Stabilizing a Queue Subject to Activity-Dependent Server Performance},
  author={Michael Lin and Richard J. La and Nuno C. Martins},
  journal={IEEE Transactions on Control of Network Systems},
We consider a discrete-time system, comprising a first-come-first-served queue, a nonpreemptive server, and a scheduler that governs the assignment of tasks in the queue to the server. The server has an availability state that indicates, at each instant, whether the server is busy working on a task or is available. In the latter case, if the queue is nonempty, then a task-assignment control policy implemented by the scheduler either assigns a new task to the server or allows it to rest. The… 

Figures and Tables from this paper

Queueing Subject To Action-Dependent Server Performance: Utilization Rate Reduction

A tractable method is put forth to determine the infimum of all utilization rates that can be achieved by scheduling policies that are stabilizing, for a given arrival rate, using a finite-dimensional linear program (LP).

Structural Properties of Optimal Fidelity Selection Policies for Human-in-the-loop Queues

The cognitive state of the human operator is treated as a lumped parameter that captures psychological factors such as workload and fatigue and the structural properties of an optimal fidelity policy are established and conditions under which the optimal policy is a threshold-based policy are provided.




A simple online scheduling discipline, Modified Largest Weighted Delay First, along with its generalizations, is throughput optimal; namely, it ensures that the queues are stable as long as the vector of average arrival rates is within the system maximum stability region.

Maximally Stabilizing Task Release Control Policy for a Dynamical Queue

A model of dynamical queue, in which the service time depends on the server utilization history, is introduced, and an upper bound on the maximum possible stabilizable arrival rate for any task release control policy is proved.

Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

The stability of a queuing network with interdependent servers is considered, and the problem of scheduling server activation under the constraints imposed by the dependency among them is studied.

A Dynamical Queue Approach to Intelligent Task Management for Human Operators

The focus of the paper is to characterize the throughput of the dynamical queue and design corresponding maximally stabilizing task release control policies, assuming deterministic arrivals.

A fluid analysis of a utility-based wireless scheduling policy

This paper considers packet scheduling for the downlink in a wireless network, where each packet's service preferences are captured by a utility function that depends on the total delay incurred, and examines a simple gradient-based scheduling algorithm called the U/spl dot/R-rule, which is a type of generalized c/spl mu/-rule (Gc/ spl mu/) that takes into account both a user's channel condition and derived utility when making scheduling decisions.

The theory of queues with a single server

This paper gives a development in the case where there is a single queue and a single server attending to it; the theory of multiple queues or many servers seems to be a problem of considerable difficulty.

Humans Are Not Machines: The Behavioral Impact of Queueing Design on Service Time

The study of queue design on worker productivity in service systems that involve human servers finds that the single-queue structure slows down the servers, illustrating a drawback of pooling; and poor visibility of the queue length slowsdown the servers; however this effect may be mitigated, or even reversed, by pay schemes that incentivize the servers for fast performance.

Utility-optimal scheduling in time-varying wireless networks with delay constraints

This work proposes an on-line scheduling policy and proves that it is utility-optimal, and designs an auction mechanism where clients are scheduled and charged according to their bids that restricts any selfish client from improving its utility by faking its utility function.

User-level performance of channel-aware scheduling algorithms in wireless data networks

  • S. Borst
  • Computer Science, Business
    IEEE/ACM Transactions on Networking
  • 2005
This paper shows that in certain cases the user-level performance may be evaluated by means of a multiclass Processor-Sharing model where the total service rate varies with the total number of users, and shows that, in the presence of channel variations, greedy, myopic strategies which maximize throughput in a static scenario may result in sub-optimal throughput performance for a dynamic user configuration and cause potential instability effects.

Optimal transmission scheduling with base station antenna array in cellular networks

This paper proposes four heuristic scheduling algorithms that have polynomial complexity that are suitable for downlink scheduling in a cellular wireless network and evaluates the performance of the proposed algorithms through computer simulations.