GI／G／1排队系统的队长的瞬时性态（I）

本文用三种方式给出计算队长L(t)的瞬时分布。     

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

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

GI／G／1和GI／M／1的队长的瞬时分布

在本中给出了GI/G／1和GI／M／1的队长L(t)的瞬时分布的计算方法。     

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

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

A discrete-time single-server queue with set-up time

This paper studies a generalization of the GI/G/1 queueing system in which there is a random ‘set-up’ time for customers who arrive when the server is idle. Mathematical methods are given for finding various transient characteristics of the system.     

On the Queue Length Distribution for the GI/G/1/K/VM Queue

Abstract

We present a transform-free distribution of the steady-state queue length for the GI/G/1/K queueing system with multiple vacations under exhaustive FIFO service discipline. The method we use is a modified supplementary variable technique and the result we obtain is expressed in terms of conditional expectations of the remaining service time, the remaining interarrival time, and the remaining vacation, conditional on the queue length at the embedded points. The case K → ∞ is also considered.     

Simple Approximations for the GI/G/c Queue-II: The Moments,the Inverse Distribution Function and the Loss Function of the Number in the System and of the Queue Delay

Based on results obtained in part I of this paper, approximations for the first four moments of the number in the system are developed and thence used to approximate the inverse distribution function (IDF) and the loss functions (LF), employing Shore's general approximations. Existing approximations for the first two moments of queueing time in a GI/G/l queue serve to approximate the IDF and the LF of queueing time in the corresponding GI/G/c queue. The accuracy attained is generally satisfactory, while a remarkable algebraic simplicity is preserved. A numerical example demonstrates the applicability of some of the new approximations to solve optimization problems.     

GI(1)+GI(2)+…+GI(N)/M/1排队模型

文献[1]引入了一类具有广泛应用前景的随机过程--Markov骨架过程.本文借助这类随机过程的方法研究了GI(1)+GI(2)+…+GI(N)/M/1排队模型,求出了此模型到达过程、等待时间及队长的概率分布.     

延迟Min(N,D)-策略的M/G/1排队系统的队长分布与数值计算

考虑延迟Min(N, D)-策略的M/G/1排队系统. 运用更新过程理论、全概率分解技术和Laplace变换工具, 从任意初始状态出发, 研究了队长的瞬态和稳态性质, 获得了瞬态队长分布的Laplace变换的递推表达式和稳态队长分布的递推表达式, 同时求出了附加队长分布的显示表达式. 进一步讨论了当N \to \infty, 或D \to \infty, 或N=1且P{Y=0}=1, 或P{Y=0}=1时的特殊情形. 最后通过数值实例, 讨论了稳态队长分布对系统参数的敏感性, 并阐述了稳态队长分布的表达式在系统容量优化设计中的重要价值.     

关于GI/G/1/∞排队系统的平稳等待时间分布的局部尾等价式

关于GI/G/1/∞排队系统的平稳等待时间分布W,已有许多经典的结果描述了其尾分布[AKW-](x)=1-W(x)的等价极限情况.该文结合一些保险与金融领域重要的风险变量,研究了关于分布W的各种局部尾等价式问题.     

Approximations for multi-server queues: System interpolations

This paper provides a unifying method of generating and/or evaluating approximations for the principal congestion measures in aGI/G/s queueing system. The main focus is on the mean waiting time, but approximations are also developed for the queue-length distribution, the waiting-time distribution and the delay probability for the Poisson arrival case. The approximations have closed forms that combine analytical solutions of simpler systems, and hence they are referred to as system-interpolation approximations or, simply, system interpolations. The method in this paper is consistent with and generalizes system interpolations previously presented for the mean waiting time in theGI/G/s queue.     

On normal approximation for maximum likelihood estimation from single server queues

This paper is concerned with the rate of convergence of the distribution of the maximum likelihood estimators of the arrival and the service rates in a GI/G/1 queueing system. This revised version was published online in June 2006 with corrections to the Cover Date.     

TRANSIENT SOLUTION FOR QUEUE-LENGTH DISTRIBUTION OF Geometry/G/1 QUEUEING MODEL

In this paper, the Geometry/G/1 queueing model with inter-arrival times generated by a geometric（parameter p） distribution according to a late arrival system with delayed access and service times independently distributed with distribution {gj }, j≥ 1 is studied. By a simple method （techniques of probability decomposition, renewal process theory） that is different from the techniques used by Hunter（1983）, the transient property of the queue with initial state i（i ≥ 0） is discussed. The recursion expression for u -transform of transient queue-length distribution at any time point n^＋ is obtained, and the recursion expression of the limiting queue length distribution is also obtained.     

服务员假期中以概率p进入的M/G/1排队系统的随机分解

该文研究M/G/1多重休假排队系统，其中在服务员休假中到达顾客以概率p(0≤p≤1)进入。通过引进“服务员忙期”和使用拉普拉斯变换或拉普拉斯— —司梯阶变换，我们获得队长瞬态分布的拉普拉斯变换和稳态分布的递推表达式，进一步得到稳态队长分布的随机分解和在特殊情况下相应的一些结果。     

Comparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server

In this paper we analyze a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The method of maximum entropy is used to develop the approximate steady-state probability distributions of the queue length in the M/G(G)/1 queueing system, where the second and the third symbols denote service time and repair time distributions, respectively. A study of the derived approximate results, compared to the exact results for the M/M(M)/1, M/E₂(E₃)/1, M/H₂(H₃)/1 and M/D(D)/1 queueing systems, suggest that the maximum entropy principle provides a useful method for solving complex queueing systems. Based on the simulation results, we demonstrate that the N policy M/G(G)/1 queueing model is sufficiently robust to the variations of service time and repair time distributions.     

Analysis of the M/Gi/1 →/M/1 queueing model

An M/GI/1 queueing system is in series with a unit with negative exponential service times and infinite waiting room capacity. We determine a closed form expression for the generating function of the joint queue length distribution in steady state. This result is obtained via the solution of a new type of functional equation in two variables.     

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.     

带单重指数工作休假和休假中断的GI／M／1的排队系统

本文主要研究带有单重指数工作休假和休假中断策略的GI／M／1排队模型。利用分块矩阵表示出嵌入马尔可夫链的转移矩阵,并运用矩阵几何解的方法求得到达时刻队长的稳态分布,而且证明了其可以分解为三个独立随机变量的分布的和。     

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

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

具有Min(N,D,V)-策略控制的M/G/1排队系统

研究服务员具有多重休假和系统采取Min(N,D,V)-策略控制的M/G/1排队系统,运用全概率分解技术和拉普拉斯变换工具,研究了系统队长的瞬态分布和稳态分布,得到了队长瞬态分布的拉普拉斯变换的表达式和稳态队长分布的递推表达式,同时给出了稳态队长的随机分解结果和附加队长分布的显示表达式.进一步讨论了当N→∞,或D→∞,或p{V=∞}=1,或p{V=0}=1的一些特殊情况.最后,在建立系统费用结构模型的基础上,导出了系统长期单位时间的期望费用的显示表达式,并通过数值实例不但确定了使得系统在长期单位时间内的期望费用最小的联合控制策略(N~*,D~*),而且与单一的最优N~*-控制策略和D~*-控制策略进行了比较.