A queueing model for a nonreliable multiterminal system with polling scheduling

This paper deals with a nonhomogeneous finite-source queueing model to describe the performance of a multiterminal system subject to random breakdowns under the polling service discipline. The model studied here is a closed queueing network which has three service stations. a CPU (single server), terminals (infinite server), a repairman (single server), and a finite number of customers (jobs) that have distinct service rates at the service stations. The CPU's repair has preemptive priority over the terminal repairs, and failure of the CPU stops the service of the other stations, thus the nodes are not independent. It can be viewed as a continuation of papers by the authors (see references), which discussed a FIFO (first-in, first-out) and a PPS (priority processor sharing) serviced queueing model subject to random breakdowns. All random variables are assumed to be independent and exponentially distributed. The system behavior can be described by a Markov chain, but the number of states is very large. The purpose of this paper is to give a recursive computational approach to solve steady-state equations and to illustrate the problem in question using some numerical results. Supported by the Hungarian National Foundation for Scientific Research (grant Nos. OTKA T014974/95 and T016933/95) Proceedings of the Seminar on Stability Problems for Stochastic Models. Hajdúszoboszló, Hungary, 1997, Part, II.     

Design of manufacturing systems using queueing models

Design issues in various types of manufacturing systems such as flow lines, automatic transfer lines, job shops, flexible machining systems, flexible assembly systems and multiple cell systems are addressed in this paper. Approaches to resolving these design issues of these systems using queueing models are reviewed. In particular, we show how the structural properties that are recently derived for single and multiple stage queueing systems can be used effectively in the solution of certain design optimization problems.Supported in part by the Natural Sciences and Engineering Research Council of Canada via Operating and Strategic Grants on Modeling and Analyses of Production Systems and Modeling and Implementation of Just-in-Time Cells.Supported in part by the NSF Grants ECS-8811234 and DDM-9113008 and by Sloan Foundation Grants for the Consortium for Competitiveness and Cooperation and for the study on Competitive Semiconductor Manufacturing.     

Taxonomy of batch queueing models in manufacturing systems

Batching plays an important role in performance evaluation of manufacturing systems. Three types of batching are commonly seen: transfer batches, parallel batches and serial batches. To model the batching behavior correctly, a comprehensive classification of batching is proposed. Eight types of batching behavior are classified and corresponding queueing models are given. The newly proposed models are validated by simulation.     

Approximate queueing models for capacitated multi-stage inventory systems under base-stock control

A queueing analysis is presented for base-stock controlled multi-stage production-inventory systems with capacity constraints. The exact queueing model is approximated by replacing some state-dependent conditional probabilities (that are used to express the transition rates) by constants. Two recursive algorithms (each with several variants) are developed for analysis of the steady-state performance. It is analytically shown that one of these algorithms is equivalent to the existing approximations given in the literature. The system studied here is more general than the systems studied in the literature. The numerical investigation for three-stage systems shows that the proposed approximations work well to estimate the relevant performance measures.     

Multicriterion commutative effects in simplest models of queueing systems

We investigate the effect of two types of communication of simplest queueing systems on the mean queue length and the relaxation time of the composite system. Proceedings of the Seminar on Stability Problems for Stochastic Models, Moscow, 1993     

Standing wave solutions for a class of nonhomogeneous systems in dimension two

In this article, minimax procedures and a Trudinger–Moser type inequality in weighted Sobolev spaces are employed to establish sufficient conditions for the existence of solutions for a class of nonhomogeneous elliptic systems involving nonlinear Schrödinger equations with subcritical or critical exponential growth and with potentials which are singular and/or vanishing. The solutions are obtained by suitable control of the size of the perturbations.     

Shot-noise queueing models

Queueing Systems - We provide a survey of so-called shot-noise queues: queueing models with the special feature that the server speed is proportional to the amount of work it faces. Several results...     

A review of open queueing network models of manufacturing systems

In this paper we review open queueing network models of manufacturing systems. The paper consists of two parts. In the first part we discuss design and planning problems arising in manufacturing. In doing so we focus on those problems that are best addressed by queueing network models. In the second part of the paper we describe developments in queueing network methodology. We are primarily concerned with features such as general service times, deterministic product routings, and machine failures — features that are prevalent in manufacturing settings. Since these features have eluded exact analysis, approximation procedures have been proposed. In the second part of this paper we review the developments in approximation procedures and highlight the assumptions that underlie these approaches.     

Modeling circulation systems in buildings using state dependent queueing models

Circulation systems within buildings are analyzed using M/G/C/C queueing models. Congestion aspects of the traffic flow are represented by introducing state dependent service rates as a function of the number of occupants in each region of the circulation system. Analytical models for unidirectional and multi-source/single sink flows are presented. Finally, use of the queueing models to analytically determine the optimal size and capacity of the links of the circulation systems is incorporated into a series of software programs available from the authors.This material is based upon work supported by the National Science Foundation under grant #MSM-8417942 and #MSM-8715152.     

A two threshold vacation policy in multiserver queueing systems

We consider a queueing system with c servers and a threshold type vacation policy. In this system, when a certain number d < c of servers become idle at a service completion instant, these d servers will take a synchronous vacation of random length together. After each vacation, the number of customers in the system is checked. If that number is N or more, these d servers will resume serving the queue; otherwise, they will take another vacation together. Using the matrix analytical method, we obtain the stationary distribution of queue length and prove the conditional stochastic decomposition properties. Through numerical examples, we discuss the performance evaluation and optimization issues in such a vacation system with this (d, N) threshold policy.     

The effects of service disciplines on the performance of a nonreliable terminal system

In this paper, we consider a stochastic queueing model for the performance evaluaton of a real-life computer system consisting of n terminals connected with a CPU. A user at terminal i has thinking and processing time depending on the index i. Let us suppose that the operational system is subject to random breakdowns, which may be software or hardware ones, stopping the service both at the terminals and at the CPU. The failure-free operation times of the system and the restoration times are random variables. Busy terminals are also subject to random breakdowns not affecting the system operation. The failure-free operation times and the repair times of a busy terminal i are random variables with distribution function depending on index i. The breakdowns are serviced by a single repairman providing preemptive priority to the system's failure, while the restoration at the terminals are carried out according to the FIFO rule. We assume that each user generates only one job at a time, and he waits at the CPU before he starts thinking again, that is, the terminal is inactive while waiting at the CPU, and it cannot break down. All random variables involved in the model construction are assumed to be exponentially distributed and independent of each other. The aim of this paper is to investigate the effect of different service disciplines, such as FIFO, processor sharing, priority processor sharing, and polling, on the main performance measures, such as utilizations, response times, throughput, and mean queue length. Supported by the Hungarian National Foundation for Scientific Research (grant No. ORKA T014974/95). Proceedings of the Seminar on Stability Problems for Stochastic Models, Hajdúszoboszló. Hungary, 1997, Part II.     

Markov-modulated queueing systems

Markov-modulated queueing systems are those in which the primary arrival and service mechanisms are influenced by changes of phase in a secondary Markov process. This influence may be external or internal, and may represent factors such as changes in environment or service interruptions. An important example of such a model arises in packet switching, where the calls generating packets are identified as customers being served at an infinite server system. In this paper we first survey a number of different models for Markov-modulated queueing systems. We then analyze a model in which the workload process and the secondary process together constitute a Markov compound Poisson process. We derive the properties of the waiting time, idle time and busy period, using techniques based on infinitesimal generators. This model was first investigated by G.J.K. Regterschot and J.H.A. de Smit using Wiener-Hopf techniques, their primary interest being the queue-length and waiting time.     

排队系统中的泰勒展开方法

综述了排队系统中的泰勒展开方法。它由Gong和Hu在1990s首次提出,并在最近几年里有了一些新的发展。首先,通过GI/GI/1队列的简单例子介绍其基本原理;其次,展示如何应用该方法分析相关性队列和离去过程;然后,阐述如何基于该方法发展排队网络近似的高阶矩方法;最后,讨论未来的几个可能研究方向。     

The existence of sensitive optimal policies in two multi-dimensional queueing models

Recently Dekker and Hordijk [3,4] introduced conditions for the existence of deterministic Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. These conditions include- uniform geometric recurrence.The-uniform geometric recurrence property also implies the existence of average optimal policies, a solution to the average optimality equation with explicit formula's and convergence of the value iteration algorithm for average rewards. For this reason, the verification of-uniform geometric convergence is also useful in cases where average and-discounted rewards are considered.On the other hand,-uniform geometric recurrence is a heavy condition on the Markov decision chain structure for negative dynamic programming problems. The verification of-uniform geometric recurrence for the Markov chain induced by some deterministic policy together with results by Sennott [14] yields the existence of a deterministic policy that minimizes the expected average cost for non-negative immediate cost functions.In this paper-uniform geometric recurrence will be proved for two queueing models: theK competing queues and the two centre open Jackson network with control of the service rates.The research of the author is supported by the Netherlands Organization for Scientific Research N.W.O.     

Limit theorems for multiphase queueing systems

One gives a limit theorem for the joint distribution of the stationary waiting times of customers in the queues of a multiphase queueing system, functioning in a heavy traffic regime. One proves that the joint distribution function of the waiting times is a solution of a problem with a directional derivative for an elliptic differential equation in a polyhedral angle.Translated from Veroyatnostnye Raspredeleniya i Matematicheskaya Statistika, pp. 212–229, 1986.     

Stability criteria for controlled queueing systems

We give an almost complete classification of ergodicity and transience conditions for a general multi-queue system with the following features: arrivals form Poisson streams and there are various routing schemes for allocating arrivals to queues; the servers can be configured in a variety of ways; completed jobs can feed back into the system; the exponential service times and feedback probabilities depend upon the configuration of the servers (this model includes some types of multi-class queueing system); switching between service regimes is instantaneous. Several different levels of control of the service regimes are considered. Our results for the N-queue system require randomisation of service configurations but we have studied the two queue system in situations where there is less control. We use the semi-martingale methods described in Fayolle, Malyshev and Menshikov [3] and our results generalise Kurkova [8] and complement Foley and McDonald [4] and [5]. AMS 2000 subject classification: Primary: 90B22; Secondary: 60J10 90B15