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

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

部分服务台同步单重休假的M/M/c排队系统

本文研究只允许一部分服务台进入休假状态的M／M／c排队系统，在同步单重休假策略下，给出了稳态指标分布，证明了已知服务台全忙条件下的随机分解结果．     

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

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

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

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

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

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

M/M/C休假排队系统-综述

本文介绍了带有各种休假策略的Ｍ／Ｍ／Ｃ休假排队的研究方法及结果,在所有服务台全的条件下,我们证明了系统的稳态队长和稳态等待时间可分解成两个独立随机变量和和,其中一个随机变量愉是相应的经典Ｍ／Ｍ／Ｃ排队的稳态队长与稳态等待时间。     

关于M／M／1排队系统中两个公式的证明

本文对Ｎ．Ｕ．Ｐｒａｂｈｕ在［１，Ｐ．３３］中的关于Ｍ／Ｍ／１系统中到第ｎ个顾客到达止全部闲期的极限分布予以严格证明、对［１，Ｐ．３２］中的关于Ｍ／Ｍ／１系统中的一个公式给出不利用复变函数论的初等证明．     

批量到达带启动时间的单重休假M/G/1排队系统

本文研究批量到达带启动时间的单重休假的M／G／1排队系统，给出稳态队长的母函数和等待时间分布的LST及其它们的随机分解结果，推导出忙期、闲期和线期母函数和均值。     

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

通过M/G/1算子的谱分析得到了M/G/1排队论系统的渐近稳定性.首先,将系统方程转化为某一合适Banach空间上的抽象Cauchy闻题,从而引入M/G/1算子.其次,分析了M/G/1算子的谱分布,得到了0是M/G/1算子的简单本征值且M/G/1算子的谱分布在左半平面的结果.最后,利用谱分析结果和算子半群理论得到了M/...     

Continuity of the M/G/c queue

Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller distributions, say F _n , leads to an approximation of the stationary distribution π of the original M/G/c queue by the stationary distributions π _n of the M/G/c queues with service time distributions F _n . Here all approximations are in weak convergence. The argument is based on a representation of M/G/c queues in terms of piecewise deterministic Markov processes as well as some coupling methods.      

IPP+M/M／C排队的遍历性(英文)

The IP P＋M/M/c queueing system has been extensively used in the modern communication system.The existence and uniqueness of stationary distribution of the queue length L（t）for IP P＋M/M/1 queue has been proved in[10].In this paper,we shall give the su？cient and necessary conditions of l-ergodicity,geometric ergodicity,and prove that they are neither uniformly polynomial ergodicity nor strong ergodicity.     

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.     

非强占优先权下的M/M/1排队

分析带有两个优先权的非强占M/M/1系统的性能,用补充变量法构造向量马尔可夫过程对此排队系统的状态转移方程进行分析,得到两类顾客在非强占优先权的队长联合分布的母函数,进一步讨论,得出了服务台被两类顾客占有和闲置的概率以及两类信元各自的平均队长.     

The Embedded Random Walk in the Stationary M/M/1 Queue

We consider the stationary queue length process of the standard M/M/1 queue just after its jump times (i.e., the times of arrivals or departures). Simple formulas for the distribution of this embedded random walk with immediate reflection at zero are derived. We study the monotonicity properties of the corresponding expected values and point out an asymmetry between the number of arrivals and the number of departures until the n-th jump time.     

Tail asymptotics of the queue size distribution in the M/M/m retrial queue

We consider an M/M/m retrial queue and investigate the tail asymptotics for the joint distribution of the queue size and the number of busy servers in the steady state. The stationary queue size distribution with the number of busy servers being fixed is asymptotically given by a geometric function multiplied by a power function. The decay rate of the geometric function is the offered load and independent of the number of busy servers, whereas the exponent of the power function depends on the number of busy servers. Numerical examples are presented to illustrate the result.     

Analysis of an M/M/1+G queue operated under the FCFS policy with exact admission control

In this article, we present an exact theoretical analysis of an $M/M/1$ M / M / 1 system, with arbitrary distribution of relative deadline for the end of service, operated under the first come first served scheduling policy with exact admission control. We provide an explicit solution to the functional equation that must be satisfied by the workload distribution, when the system reaches steady state. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. Finally, we compare this loss ratio with that of a similar system operating without admission control, in the cases of some common distributions of the relative deadline.     

休假时间服从T-SPH分布的M/M/1多重休假排队

本文研究休假时间服从T-SPH分布的M/M/1多重休假排队,利用拟生灭过程和算子几何解的方法给出了平稳队长分布的概率母函数,并得到了平稳队长和平稳等待时间的随机分解结果以及附加队长和附加延迟的母函数和LST的具体形式.