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

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

GI／G／1单重休假随机服务系统的马氏骨架方法

文献[1]引入一类具有广泛应用前景的随机过程-Markov骨架过程。借助Markov骨架过程的方法研究GI/G/1单重休假服务系统队长，及t时刻到达顾客等待时间的瞬时概率分布。     

GI／G／1排队系统的队长和等待时间的瞬时分布

本是[1，2]的继续,在本中利用马氏骨架过程给出了GI／G／1排队系统的队长的瞬时分布的另一新的计算方法和等待时间的计算方法。     

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

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

多级适应性到达间隔的GI／M／C排队

一、引言 Conolly、Conolly与Chan、Hadidi、Haight等讨论了输入或服务速率依赖于在场顾客数的各种Mn/Mn/1 型随机服务系统.韩继业进一步研究了到达间隔分布依赖于系统中顾客数的GI/M/c模型.     

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

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

带两类服务的一般休假M/GI/1型系统的随机分解

借助于建立在平稳点过程和Palm分布理论基础上的强度保守原理,讨论了一个具有一般休假策略的M/GI/1型排队系统.该模型允许闲期中顾客非泊松到达且顾客的服务可以被休假中断。我们得到了稳态下工作量和顾客离去前所见队长的随机分解.     

带关闭期和启动期的GI/M/1排队及其应用

本研究了带关闭期和启动期的GI/M/1排队，给出了稳态队长分布和等待时间分布的随机分解，展示了它在计算机通讯网络中的应用。     

方程a2(x)(t-τ)+a1(x)(t-τ)+a0x(t-τ)+b2(x)(t)+b1(x)(t)+b0x(t)=δ的部分解讨论

讨论了方程a2(x)(t-τ)+a1(x)(t-τ)+a0x(t-τ)+b2(x)(t)+b1(x)(t)+b0x(t)=δ的部分解.     

GI/G/1排队系统队长的强大数定律和中心极限定理

本文首先证明当服务强度小于1时,GI/G/1排队系统的队长是一个特殊的马尔可夫骨架过程——正常返的Doob骨架过程,然后运用马尔可夫骨架过程的强大数定律和中心极限定理等重要结果,给出了队长的累积过程的期望和方差,并给出了该累积过程满足强大数定律和中心极限定理的充分条件。     

GI^（1）＋GI^（2）／G／1排队模型

对于GI^(1) GI^(2)/G/I排队模型,本借助献[1]中引入的Markov骨架过程方法求出了此模型到达过程,等待时间及队长的概率分布。     

Performance analysis of discrete-time queue GI/G/1 with negative arrivals

In this paper, we consider a discrete-time GI/G/1 queueing model with negative arrivals. By deriving the probability generating function of actual service time of ordinary customers, we reduced the analysis to an equivalent discrete-time GI/G/1 queueing model without negative arrival, and obtained the probability generating function of buffer contents and random customer delay.     

Analysis of the GI/Geo/1 Queue with Disasters

The occurrence of disasters to a queueing system causes all customers to be removed if any are present. Although there has been much research on continuous-time queues with disasters, the discrete-time Geo/Geo/1 queue with disasters has appeared in the literature only recently. We extend this Geo/Geo/1 queue to the GI/Geo/1 queue. We present the probability generating function of the stationary queue length and sojourn time for the GI/Geo/1 queue. In addition, we convert our results into the Geo/Geo/1 queue and the GI/M/1 queue.     

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.     

A GI/Geo/1 queue with negative and positive customers

The arrival of a negative customer to a queueing system causes one positive customer to be removed if any is present. Continuous-time queues with negative and positive customers have been thoroughly investigated over the last two decades. On the other hand, a discrete-time Geo/Geo/1 queue with negative and positive customers appeared only recently in the literature. We extend this Geo/Geo/1 queue to a corresponding GI/Geo/1 queue. We present both the stationary queue length distribution and the sojourn time distribution.     

Conditioned limit theorem for virtual waiting time process of the GI/G/1 queue

We prove that in the queueing system GI/G/1 with traffic intensity one, the virtual waiting time process suitably scaled, normed and conditioned by the event that the length of the first busy period exceeds n converges to the Brownian meander process, as n .     

An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation

The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy traffic conditions. In this paper, we propose a new approximation technique, which combines the light and heavy traffic characteristics. This interpolation approximation is based on the theory of multipoint Padé approximation which is applied at two points: light and heavy traffic. We show how this can be applied for estimating the waiting time moments of the ^GI/G/1 queue. The light traffic derivatives of any order can be evaluated using the MacLaurin series analysis procedure. The heavy traffic limits of the ^GI/G/1 queue are well known in the literature. Our technique generalizes the previously developed interpolation approximations and can be used to approximate any order of the waiting time moments. Through numerical examples, we show that the moments of the steady state waiting time can be estimated with extremely high accuracy under all ranges of traffic intensities using low orders of the approximant. We also present a framework for the development of simple analytical approximation formulas. This revised version was published online in June 2006 with corrections to the Cover Date.