Static optimization of queueing systems

  title={Static optimization of queueing systems},
  author={Onno J. Boxma},
textabstractThis paper discusses some recent developments in the static optimization of queueing systems. Special attention is given to three problem classes: (i) the optimal allocation of servers, or service capacity, to queues in a network; (ii) the optimal allocation of the visits of a single server to several queues (a polling system); (iii) the optimal allocation of a single arrival stream to several single server queues. 
Optimal Workload Allocation in a Network of Computers with Single Class Job
The problem of determining optimal allocation of workload with single class jobs to a parallel of computers using optimization technique is presented and a close-loop expression is derived from a non-linear optimization problem based on a queueing theory objective function to obtain an optimal value for jobs arrival. Expand
Optimizing workload allocation in a network of heterogeneous computers
A new workload allocation model based on Generalized Exponential distribution is proposed for user level performance measures and a closed-loop expression for workload arrival to minimize systems means queue length and response time are derived using the optimization technique. Expand
Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, the Single-Station Case
This approach seeks to obtain performance bounds and scheduling policies from the solution of a mathematical program over a relaxation of the system's performance region to address the performance optimization problem in a single-station multiclass queueing network with changeover times. Expand
Mathematical methods to study the polling systems
The polling systems were classified; presented were stochastic models and methods of investigating discrete-time and continuous-time systems, systems with cyclic, periodic, and random queue polling, as well as the methods of their optimization. Expand
Analytical Modeling and Analysis of Workload Allocation in a Network of Service Centers
An analytic approach is presented that considers the performance of business process designs and a close-loop expression is derived from a non-linear optimization problem to obtain an optimal value for jobs arrival. Expand
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
The notion of network layer capacity is developed and capacity achieving power allocation and routing algorithms for general networks with wireless links and adaptive transmission rates are described and a fundamental rate-delay tradeoff curve is established. Expand
NFV Resource Allocation Using Mixed Queuing Network Model
  • M. Yoon, A. Kamal
  • Computer Science
  • 2016 IEEE Global Communications Conference (GLOBECOM)
  • 2016
This work proposes an efficient resource allocation strategy of VNFs in a single server by employing mixed queuing network model while minimizing the customers' waiting time in the system. Expand
Dynamic priority allocation via restless bandit marginal productivity indices
Abstract This paper surveys recent work by the author on the theoretical and algorithmic aspects of restless bandit indexation as well as on its application to a variety of problems involving theExpand


Analysis of a Customer Assignment Model with No State Information
It turns out that the periodic policies found by the recently developed algorithm for Markov decision chains with partial state information are close, if not equal, to the optimal ones. Expand
Optimization of Static Traac Allocation Policies
We consider the traac allocation problem: arriving customers have to be assigned to one of a group of servers. The aim is to optimize system performance measures, such as mean waiting time of aExpand
Introduction to queueing networks
A comparison of G-Networks with Multiple Classes of Signals and Positive Customers and Discrete-Time Queueing Systems shows how different approaches to queue management can produce different results. Expand
Allocation of buffer capacities in queueing networks with arbitrary topologies
Two algorithms are developed to allocate buffers to service stations connected arbitrarily in a feed-forward manner and are easy-to-use tools to explore alternative buffer storage configurations and parameter settings during the initial design stages of production systems, communications networks, and flexible manufacturing systems. Expand
On optimal polling policies
The goal of this paper is to find polling policies that stochastically minimize the unfinished work and the number of customers in the system at all times and it is established that in symmetric polling systems optimal policies belong to the class of Stochastically Largest Queue policies. Expand
Analysis of Cyclic Service Systems with Limited Service: Bounds and Approximations
This paper analyzes cyclic service queueing systems in which the server serves at most a prespecified number of jobs when it visits a queue, and derives tight bounds for the conservation laws in such systems. Expand
Optimal probabilistic allocation of customer types to servers
  • S. Borst
  • Computer Science
  • 1995
This work considers the problem of finding an allocation that minimizes a weighted sum of the mean waiting times and exposes the structure of an optimal allocation and describes for some special cases in detail how the structure may be exploited in actually determining an optimal allocations. Expand
Dynamic priority rules for cyclic-type queues
A cyclic service system is composed of K channels (queues) and a single cyclically roving server who typically takes a positive amount of time to switch between channels. Research has previouslyExpand
Optimization of fixed time polling schemes
This paper presents an approach to the problem of minimizing a weighted sum of the mean waiting times at the various queues according to a fixed time polling scheme and tests this approach via numerical experiments that are partly based on real network data. Expand
Optimization of Polling Systems with Bernoulli Schedules
A numerical approach to determine the optimal schedule of cyclic polling systems with respect to the service disciplines at the nodes, based on the power-series algorithm, is discussed. Expand