具有N-策略休假的M/G/1排队的随机分解与最优策略

本文利用向量Markov过程方法,研究了具有N-策略休假且休假时间为一般分布的M/G/1排队,它的两种特殊情况分别是具有多重休假的M/G/1排队和具有N-策略控制的M/G/1排队。我们得到了这个排队系统稳态时的队长分布,证明了它的稳态队长存在随机分解。然后讨论了当休假时间服从指数分布时的最优策略问题。     

N-策略休假GI-X／G／1排队系统队长的瞬时分布

本文应用Markov骨架过程理论研究了N-休假策略GI~X/G/1排队系统,并得到了队长的瞬时分布.     

M／M^r／1／N排队系统

本文讨论了等待空间有限的成批服务排队系统M/M~r/1/N,给出队长平稳分布的精确解.还得到了系统损失概率和平均输出间隔的精确值.     

同步N—策略多重休假M／M／c排队

研究了具有同步N-策略多重休假的M／M／c排队系统．在休假时间服从相型（PH）分布的假设下，给出了系统的稳态指标．证明在已知服务台全忙并且系统中顾客数大于或等于N的条件下，条件随机变量可分解成独立随机变量之和，其中一个是无休假经典M／M／c系统中的对应条件变量，另一个是休假引起的附加随机变量     

GI／G／1系统队长的极限分布

关于GI／G／1排队系统队长的极限分布存在的一个充分条件被建立．     

多重休假GI／G／1排队系统的非统计平衡理论

文献[1]引入了一类具有广泛应用前景的随机过程-Markov骨架过程，文献[2]研究了GI/G/1排队系统，本文对其进行了拓展，研究了多重休假GI/G/1排队模型。求出了此模型的到达过程，等待时间及队长的概率分布。     

Min(N,V)--策略休假的M/G/1排队系统分析

在一个M／G／1休假排队系统中，同时考虑N-策略和多重休假策略，休假终止准则为任一个条件满足，我们称其为Min（N，V）-策略。本文给出了在此策略下的排队系统的稳态队长、忙期分布等基本指标。首次使用条件等待时间方法得到稳态等待时间的LST（Laplace-Stieltjes transform），同时还列举了一个应用的实例。最后指出本文模型是几个已研究模型的推广。     

M／G／1排队系统的队长几何遍历的新证法

证明了M／G／1排队系统中(L(f)，θ(t))几何遍历的充分必要条件是服务时间分布函数B(x)∈g^ (r)，改进了[2]的证明方法。     

启动时间的GI／G／1排队系统的非平衡理论

本文利用侯振挺等提出的马尔可夫骨架过程理论讨论了启动时间的GI/G/I排队系统，得到了此系统到达过程，队长，及等待时间的概率分布/     

排队系统平稳等待时间的性质

讨论了M/G/1排队系统平稳等待时间的随机序关系及利用Mathematica 4.0软件探讨了爱尔朗排队系统Er/M/1（r≤6）的平稳等待时间的分布。     

An MX/G/1 queueing system with a setup period and a vacation period

This paper deals with an M^X/G/1 queueing system with a vacation period which comprises an idle period and a random setup period. The server is turned off each time when the system becomes empty. At this point of time the idle period starts. As soon as a customer or a batch of customers arrive, the setup of the service facility begins which is needed before starting each busy period. In this paper we study the steady state behaviour of the queue size distributions at stationary (random) point of time and at departure point of time. One of our findings is that the departure point queue size distribution is the convolution of the distributions of three independent random variables. Also, we drive analytically explicit expressions for the system state probabilities and some performance measures of this queueing system. Finally, we derive the probability generating function of the additional queue size distribution due to the vacation period as the limiting behaviour of the M^X/M/1 type queueing system. This revised version was published online in June 2006 with corrections to the Cover Date.     

Markov-modulatedPH/G/1 queueing systems

We study a PH/G/1 queue in which the arrival process and the service times depend on the state of an underlying Markov chain J(t) on a countable state spaceE. We derive the busy period process, waiting time and idle time of this queueing system. We also study the Markov modulated E_K/G/1 queueing system as a special case.     

Tail asymptotics for the queue length in an M/G/1 retrial queue

In this paper, we study the tail behavior of the stationary queue length of an M/G/1 retrial queue. We show that the subexponential tail of the stationary queue length of an M/G/1 retrial queue is determined by that of the corresponding M/G/1 queue, and hence the stationary queue length in an M/G/1 retrial queue is subexponential if the stationary queue length in the corresponding M/G/1 queue is subexponential. Our results for subexponential tails also apply to regularly varying tails, and we provide the regularly varying tail asymptotics for the stationary queue length of the M/G/1 retrial queue. AMS subject classifications: 60J25, 60K25     

Bayesian prediction inM/M/1 queues

Simple queues with Poisson input and exponential service times are considered to illustrate how well-suited Bayesian methods are used to handle the common inferential aims that appear when dealing with queue problems. The emphasis will mainly be placed on prediction; in particular, we study the predictive distribution of usual measures of effectiveness in anM/M/1 queue system, such as the number of customers in the queue and in the system, the waiting time in the queue and in the system, the length of an idle period and the length of a busy period.     

G/M/1 queues with delayed vacations

We considerG/M/1 queues with multiple vacation discipline, where at the end of every busy period the server stays idle in the system for a period of time called changeover time and then follows a vacation if there is no arrival during the changeover time. The vacation time has a hyperexponential distribution. By using the methods of the shift operator and supplementary variable, we explicitly obtain the queue length probabilities at arrival time points and arbitrary time points simultaneously.     

具有一般休假的D-BMAP/G/1分解定理

为了直接求出队长向量母函数,省去繁琐的矩阵分析或补充变量过程,给出并证明了具有一般休假的D—BMAP/G/1的分解定理,阐明了任意时刻队长的向量母函数与闲期任意时刻队长向量母函数的关系,离去时刻队长的向量母函数与闲期任意时刻队长向量母函数的关系,闲期任意时刻队长向量母函数与Y_(busy)(θ,z),即忙期任意时刻队长和剩余服务时间的联合向量母函数的关系．     

Tail asymptotics for the fundamental period in the MAP/G/1 queue

This paper studies the tail behavior of the fundamental period in the MAP/G/1 queue. We prove that if the service time distribution has a regularly varying tail, then the fundamental period distribution in the MAP/G/1 queue has also regularly varying tail, and vice versa, by finding an explicit expression for the asymptotics of the tail of the fundamental period in terms of the tail of the service time distribution. Our main result with the matrix analytic proof is a natural extension of the result in (de Meyer and Teugels, J. Appl. Probab. 17: 802–813, 1980) on the M/G/1 queue where techniques rely heavily on analytic expressions of relevant functions. I.-S. Wee’s research was supported by the Korea Research Foundation Grant KRF 2003-070-00008.     

Asymptotic behavior of the loss probability for an M/G/1/N queue with vacations

In this paper, asymptotic properties of the loss probability are considered for an M/G/1/N queue with server vacations and exhaustive service discipline, denoted by an M/G/1/N-(V, E)-queue. Exact asymptotic rates of the loss probability are obtained for the cases in which the traffic intensity is smaller than, equal to and greater than one, respectively. When the vacation time is zero, the model considered degenerates to the standard M/G/1/N queue. For this standard queueing model, our analysis provides new or extended asymptotic results for the loss probability. In terms of the duality relationship between the M/G/1/N and GI/M/1/N queues, we also provide asymptotic properties for the standard GI/M/1/N model.     

The output of a buffered data communication system

The output process in a buffer-multiplexer data communication system with N identical input lines and one output line is considered. It is assumed that the rate of transmission on the input lines and on the output line is 1, that idle periods on the input lines follow an exponential distribution, and that active periods are allowed to have an arbitrary distribution function. The main result is that active periods on the output line follow the same distribution function as the busy period in a certain M/G/1 queue. First passage times from any state of the system to complete idleness are also considered and their Laplace transforms are derived.     

An M/M/1 retrial queue with unreliable server

We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results.