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

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

M／M／1／k后馈系统中的随机过程

本文对Ｍ／Ｍ／１／ｋ后馈排队系统中各随机过程的Ｐｏｉｓｓｏｎ性进行了讨论，推广了Ｂｒｅｍａｕｄ（［２］，［３］）的相应结果。所得结论表明Ｍ／Ｍ／１／ｋ后馈系统与Ｍ／Ｍ／１后馈系统情况有所不同，即在某些情况下，除总输出过程外，还有其它的过程也可能是Ｐｏｉｓｓｏｎ过程。顺便又地Ｍ／Ｍ／Ｃ／ｋ前馈后馈排队系统的动态数学模型进行了严格的讨论。     

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

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

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

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

具有随机N—策略的M／G／1排队系统

本文讨论具有随机N-策略的M/G/1排队系统,采用向量Markov过程方法得到该系统有关的排队指标。上述结果可以看作是普通的和N-策略的M/G/1排队系统的推广。     

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

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

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

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

GI／PH／1休假排队系统队长的随机分解

对空竭服务、多重休假规则的GI/PH/1排队系统的稳态行为给出了详尽分析。在休假时间服从负指数分布情况下,讨论了到达点嵌入Markov链的结构、平衡条件和稳态队长。证明稳态队长可分解成两个独立随机变量之和。     

PH／PH／1／N反馈排队系统的逼留时间

具有反馈依赖于队长的ＰＨ／ＰＨ／１／Ｎ排队系统的队长和忙期的研究已在文（１）中解决，本文主要解决本系统的逗留时间的研究。     

相型同步启动时间的M／M／c排队系统

本文研究带有同步启动时间的Ｍ／Ｍ／ｃ系统，其中启动时间是相型变量，给出了稳态和等待时间分布等结果。     

M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL

Multilevel processor-sharing (MLPS) disciplines were originally introduced by Kleinrock (in computer applications 1976) but they were forgotten for years. However, due to an application related to the service differentiation between short and long TCP flows in the Internet, they have recently gained new interest. In this paper we show that, if the service time distribution belongs to class IMRL, the mean delay in the M/G/1 queue is reduced when replacing the PS discipline with any MLPS discipline for which the internal disciplines belong to {FB, PS}. This is a generalization of our earlier result where we restricted ourselves to the service time distribution class DHR, which is a subset of class IMRL.     

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.     

GI/G/1 Interdeparture time and queue-length distributions via the Laguerre transform

Queue length and interdeparture distributions for GI/G/1 are obtained using the Laguerre function expansion of the waiting time distribution. The expansion of the steady state waiting time distribution is obtained here by solving a small set of linear equations in the Laguerre function expansion coefficients. Examples show the accuracy of the results and illustrate purely numerical techniques for obtaining the necessary expansions of the arrival and service distributions.     

ANALYSIS OF M/G/1 STOCHASTIC CLEARING SYSTEMS

In this paper, we consider M/G/1 queuing systems governed by a stochastic clearing mechanism, called “disaster,” which removes all workload in the system whenever it occurs to the system. The clearing mechanism of disasters can be applied to computer systems in the presence of a virus as a clearing operation of all stored messages present in the system. We present the system size distribution and the sojourn time distribution.     

具有插队和止步行为的M/M/c 排队系统

研究了具有插队和止步行为的M/M/c排队系统. 将到达顾客分为常规顾客和插队顾客, 常规顾客在队尾排队等待服务, 插队顾客总是尽可能的靠近队首插队等待服务. 插队行为由到达顾客的插队概率和队列中等待顾客对插队行为的容忍来描述. 利用负指数分布的性质、Laplace-Stieltjes变换和全概率公式, 给出了处于等待队列位置n的顾客、任意一个常规顾客和任意一个插队顾客的等待时间的表达式. 在此基础上, 讨论了系统相关指标随系统参数的变化情况.     

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.     

The M/M/c with critical jobs

We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach.     

一个具有随机丢弃分组机制且分组成批到达的GI~X/M/1/N排队系统

利用排队论中输入流稀疏化的方法,在标准的GIX/M/1/N排队系统中嵌入网络交换设备随机丢弃分组的机制,建立了一个具有随机丢弃分组机制的扩充的GIX/M/1/N排队系统,并讨论了该排队系统的分组丢失率、系统利用率、队列长度的均值/方差、平均等待时间等性能评价指标.     

Higher moments of the waiting time distribution in M/G/1 retrial queues

This work analyzes the waiting time distribution in the M/G/1 retrial queue. The first two moments of the waiting time distribution are known from the literature. In this work we obtain all the moments of the waiting time distribution.     

M/G/1重试排队系统的渐近稳定性

用算子半群理论研究了带有重试排队的M/G/1系统.通过解算子方程和预解方程,证明了0是系统算子的本征值,且为虚轴上唯一的谱点.从而得出了当时间趋于无穷时系统时间依赖解收敛于稳态解的结论.