Analysis of a Discrete-Time Queueing System with Timed Vacations

We consider a discrete-time GI-G-1 queueing system with server vacations. Vacations occur whenever the queue becomes empty or whenever a timer expires. When the timer expires one of the following four actions are considered: the server completes transmission of the present packet before leaving for a vacation, the service immediately leaves for a vacation and the interrupted packet's service is either continued, repeated or resampled and repeated after the vacation. Using a probability generating functions approach, we derive various performance measures such as moments of the buffer contents at various time epochs in equilibrium and moments of the packet delay in equilibrium. By means of an example, we then compare the operation modes under consideration.     

Explicit Solution of a Quorum Queueing System

This paper deals with the queueing system M/G ^r /1 in which customers are served in batches of fixed size r. The author considers the discrete time parameter process, an embedded Markov chain, and the continuous time parameter process, a semi-regenerative process. In both cases, explicit solutions are given for the system size steady-state probabilities in terms of the zeros, inside and/or outside the closed unit ball, of the characteristic equation. Moments are derived and illustrative examples are provided.     

在非抢占优先站点轮询系统中顾客等待时间

为了解决银行顾客排队现象,本文提出解决这种排队现象的服务策略,根据服务原则建立模型--具有非抢占优先站点轮询系统,讨论系统在平稳条件下,对于具有一个非抢占的优先权站点且采用穷尽服务方式下的轮询系统进行理论分析,利用排队理论,给出每个站点的队长的概率母函数及顾客的等待时间的拉普拉斯*斯蒂尔切斯变换,实现了该服务方案的定性分析.     

具有非抢占优先站点的轮询系统顾客队长

本文讨论轮询系统在系统平稳条件下,对于具有一个非抢占的优先权站点且采用穷尽服务方式下的轮询系统进行理论分析,给出服务员轮询到每个站点时该站点的队长及数学期望。     

一类具有三种状态的可修排队系统研究

研究一类具有三种状态的可修排队模型主算子的豫解集.通过研究该主算子的共轭算子的豫解集得到此主算子的豫解集.     

Alternative Solution to a Quorum Queueing System

Abstract

This paper considers the quorum queueing system with exponential/Erlangian service times and derives the system content steady-state probabilities explicitly in terms of the roots inside and outside the unit ball of the characteristic equation.     

两个不同服务台的可修排队系统的矩阵几何解

本文研究了具有不同服务率的两服务台排队系统,其中服务台1完全可靠,服务台2可能发生故障.通过拟生灭过程的方法求出了.系统稳态平衡条件和稳态概率向量的矩阵几何解,并给出了系统的一些性能指标和数值结果.     

Two-Class Priority Queueing System with State-Dependent Arrivals

In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first compute the steady state distribution for the queue length of both classes. Then, waiting times and busy periods are characterized through (i) first and second moments and (ii) the approximation of their cumulative distribution functions (cdf) and Laplace–Stieltjes transforms (LST). We derive these approximations connecting bounds in the Laplace domain with bounds on the original time domain. We also, study the behavior of the inter-departure time for each class. Finally, we conclude the paper with a set of computational experiments testing our results.     

具有工作故障及有限容量的MAP/M/1排队系统性能分析

为了拓展随机排队理论,在具有工作故障的MAP/M/1排队的基础上,引入有限容量策略建立起一个新的排队模型.通过Uniformization Technique将连续时间排队模型转化成对应的离散时间排队模型,运用矩阵几何组合解给出系统中的顾客数量和服务器状态的联合稳态概率表达式,并给出基于稳态概率的性能指标.最后通过一些...     

具有批到达的滞后排队系统分析

本文考虑一个基本模型的M^[x]/G^[r]/1/∞的排队系统，引入了(r,N）－策略（也称为滞后系统），首先分析了嵌入马氏链{Qn,n∈N}的平稳分布，得到其概率母函数Ｐ(z)，再利用半再生过程理论得到原系统的稳态队长分布的概率母函数π（ｚ）。     

On the Exact Analysis of a Discrete-Time Queueing System with Autoregressive Inputs

In this paper, we provide an exact analysis of a discrete-time queueing system driven by a discrete autoregressive model of order 1 (DAR(1)) characterized by an arbitrary marginal batch size distribution and a correlation coefficient. Closed-form expressions for the probability generating function and mean queue length are derived. It is shown that the system performance is quite sensitive to the correlation of the arrival process. In addition, a comparison with traditional Markovian processes shows that arrival processes of DAR(1) type exhibit larger queue length as compared with the traditional Markovian processes when the marginal densities and correlation coefficients are matched.     

A Practical Optimisation Technique for a Queueing System

A scheduling problem in an outpatient clinic is considered. First the system is represented by means of a simple queueing model. The problem of minimising the patients' total queueing time is then formulated as a non-linear program and solved by applying the Kuhn-Tucker conditions. The results obtained enable the person who manages the appointment system to allocate appointment dates to patients who have different priorities.     

具有相型服务分布的排队系统的性能灵敏度分析

具有非线数服务分布的排队网络已被广泛应用于许多领域,如通讯网络和管理系统。本文借助于无穷小说矩阵摄动方法,研究了M/PH/1排队系统的稳态性能灵敏度分析问题,给出了性能灵敏度公式,并表明了稳态性能灵敏度很容易通过系统势能进行计算。同时,给出一种计算势能及性能导数的算法。这个算法可直接用于系统的控制与优化,因为它基于分析系统的一条单一样本轨道。最后提供一个数值例子来表明这个算法的应用。     

Analysis of a Discrete-Time Queueing System with a Single Server and Heterogeneous Markovian Arrivals

We consider a discrete-time queueing system with a single deterministic server, heterogeneous Markovian arrivals and finite capacity. Most existing techniques model the queueing system using a direct bivariate Markov chain which requires a state space that grows rapidly as the number of customer types increases. In this paper, we define renewal cycles in terms of the input process and model the system occupancy level on each renewal cycle using a one-dimensional Markov chain. We derive the exact joint steady-state probability distribution of both states of input and system occupancy with a considerably reduced state space, which leads to the efficient calculation of overall/individual performance measures such as loss probability and average delay.     

有一般服务运作和休假时间的排队系统

考虑一个有一般服务运作和休假时间的M／M／1排队系统。这时服务是非空竭的,也就是说服务员可能在系统有顾客的情形下进入休假,服务员的运作时间和休假时间都为一般分布,且相互独立,使用补充变量的方法,求解出系统稳态队长的母函数,在求解过程中遇到的未知函数po(x),可利用第一类Fredholm积分方程的数值解来确定,最后给出了系统稳态平均队长。     

Queueing Models for Optimizing System Availability of a Flexible Manufacturing System

This research investigates two maintenance float models in a flexible manufacturing system (FMS). We use classical queueing theory to study the characteristics of the fractional utilization of the system. A mathematical program is constructed to determine the optimal number of floats of an important module used in the FMS and the optimal capacity of the repair station.     

成批到达排队系统的随机比较

本文研究成批到达排队系统中队长过程的随机比较问题．利用随机比较方法我们对成批到达指数服务的多服务台排队系统进行分析,得到了该排队系统中队长过程的随机比较以及队长函数关于时间的凹性和凸性．同时我们也给出了成批到达一般服务的单服务台排队系统队长过程、稳态队长的随机比较以及队长函数关于时间的凹性和凸性．