The discrete time Geom/Geom/1 queue with multiple working vacations

In this paper, we study a discrete time Geom/Geom/1 queue with multiple working vacations. Using the quasi birth and death chain and matrix-geometric solution method, we give distributions for the number of customers in system and the waiting time of a customer and their stochastic decomposition structures, and obtain distributions of the additional number of customers and additional delay. Furthermore, we derive the formulae of expected regular busy period and expected busy cycle. Finally, by numerical examples, we analyze the effect of the parameters on the expected queue length and sojourn time.     

带负顾客和N-策略的Geo^{lambda_1, lambda_2/Geo/1(MWV)排队系统分析及最优控制策略N*

分析了一个带有负顾客、N-策略控制的Geo/Geo/1多重工作休假排队系统, 其中正顾客在工作休假及正规忙期以不同的到达率进入系统. 利用拟生灭过程和矩阵几何解方法, 给出了该模型的稳态队长分布及平均队长, 以及系统分别处于假期和忙期的概率. 同时, 对该系统的忙期进行了分析, 并讨论了稳态队长分布在系统容量的优化设计中的应用. 最后, 在给定的费用结构下, 用数值计算例子确定了使系统长期单位时间内期望费用最小的最优控制策 N*.     

带负顾客的Geom/Geom/1单重休假排队(英文)

本文研究了正负顾客到达均服从几何分布,服务台在工作休假期以较低的服务速率运行的 Geom/Geom/1休假排队.运用嵌入马尔科夫链和矩阵分析法,得到了系统中等待队长和稳态队长的概率母函数,并从证明过程和结果中,分别得到了服务台在闲期、忙期、工作休假期、正规忙期的概率.     

The Virtual Waiting Time of the M/G/1 Queue with Impatient Customers

The M/G/1 queue with impatient customers is studied. The complete formula of the limiting distribution of the virtual waiting time is derived explicitly. The expected busy period of the queue is also obtained by using a martingale argument.     

Heavy traffic approximations for busy period in an M/G/∞ queue

A necessary and sufficient condition is given for busy period in an M/G/∞ queue to be asymptotically exponential with mean equal to expected busy period, as traffic intensity increases. The case where this condition fails is also investigated, and the results applied.     

Busy period analysis of the level dependent PH/PH/1/K queue

In this paper, we study the transient behavior of a level dependent single server queuing system with a waiting room of finite size during the busy period. The focus is on the level dependent PH/PH/1/K queue. We derive in closed form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. We differentiate between two types of losses: the overflow losses that are due to a full queue and the losses due to an admission controller. For the M/PH/1/K, M/PH/1/K under a threshold policy, and PH/M/1/K queues, we determine simple expressions for their joint transforms.     

带有止步和中途退出的成批到达的M~x/M/R/N同步休假排队系统的性能分析

研究了带有止步和中途退出的Mx/M/R/N同步休假排队系统.顾客成批到达.到达的顾客如果看到服务员正在休假或者全忙,他或者以概率b决定进入队列等待服务,或者以概率1-b止步(不进入系统).系统根据一定的原则以概率nk在未止步的k个顾客中选择n个进入系统.在系统中排队等待服务的顾客可能因为等待的不耐烦而在没有接受服务的情况下离开系统(中途退出).系统中一旦没有顾客,R个服务员立即进行同步多重休假.首先,利用马尔科夫过程理论建立了系统稳态概率满足的方程组.其次,在证明了相关矩阵可逆性的基础上,利用矩阵解法求出了系统稳态概率的明显表达式,并得到了系统的平均队长、平均等待队长及顾客的平均损失率等性能指标.     

Busy period analysis of the state dependent M/M/1/K queue

In this paper, we study the transient behavior of a state dependent M/M/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. For two special cases called the threshold policy and the static policy we determine simple expressions for their joint transform.     

Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times

This paper considers a stable GI/GI/1 queue with subexponential service time distribution. Under natural assumptions we derive the tail behaviour of the busy period of this queue. We extend the results known for the regular variation case under minimal conditions. Our method of proof is based on a large deviations result for subexponential distributions.     

Busy Periods of Poisson Arrival Queues with Loss

We consider two queues with loss, one is the finite dam with Poisson arrivals and the other is the M/G/1 queue with impatient customers. We use the method of Kolmogorov's backward differential equation and construct a type of renewal equation to obtain the Laplace transform of busy(or wet) period in both queues. As a consequence, we provide the explicit forms of expected busy periods.     

The stationary workload of the <Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1 queue with impatient customers

We consider a G/M/1 queue in which the patience time of the customers is constant. The stationary distribution of the workload of the server, or the virtual waiting time, is derived by the level crossing argument. To this end, we obtain the expected downcrossings of a level in the workload process during a busy cycle and then the expected length of a busy cycle. For both the expectations, we use the dual property between the M/G/1 and G/M/1 queue.     

Second-Order Tail Behavior of the Busy Period Distribution of Certain GI/G/1 Queues

We consider the stable GI/G/1 queue in which the service time distribution has a dominated-varying tail. Under simple assumptions, we obtain the first- and second-order tail behavior of the busy period distribution in this queue.     

The age of the arrival process in the G/M/1 and M/G/1 queues

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit expressions for the conditional density functions, as well as some stochastic orders, in all three cases are given. Moreover, we show that this independence property, which we prove by elementary arguments, also leads to an alternative proof for the fact that given a busy server, the number of customers in the queue follows a geometric distribution. We conclude with a derivation for the Laplace Stieltjes Transform (LST) of the age of the inter-arrival time in the M/G/1 queue.     

具有不同到达率的带有启动时间的多级适应性休假M^ξ／G／1排队模型

本文研究具有不同到达率的带有启动时间的多级适应性休假M^ξ/G/1排队模型，应用嵌入马尔可夫链方法推导出了稳态队长和等待时间（先到先服务规则）分布，并验证了稳态队长和稳态等待时间具有随机分解性，而且给出了忙期分布．许多关于M^ξ/G/1的排队模型都可以看作是此模型的特例．     

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.     

具有不同到达率的带有启动时间的多级适应性休假Mξ/G/1排队模型

本文研究具有不同到达率的带有启动时间的多级适应性休假M~ξ／G／1排队模型,应用嵌入马尔可夫链方法推导出了稳态队长和等待时间(先到先服务规则)分布,并验证了稳态队长和稳态等待时间具有随机分解性,而且给出了忙期分布．许多关于M~ξ／G／1的排队模型都可以看作是此模型的特例．     

N-策略M/G/1/∞排队系统的队长分布表达式

本文考虑N-策略M／G／1／∞排队系统，研究了队长的瞬态和稳态性质。通过引进“服务员忙期”和使用全概率分解技术，我们导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式，以及平稳队长的随机分解。特别地，通过本文可直接获得一些特殊排队系统相应的结果。     

N-策略单重休假M/G/1排队系统的队长分布

本文考虑N-策略单重休假M/G/1排队系统,通过引进"服务员忙期"和使用全概率分解技术,从任意初始状态出发,研究了队长的瞬态分布和稳态分布,首次导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解.特别地,通过本文可直接获得一些特殊排队系统相应的结果.     

推广的多重休假$M^X/G/1$排队系统

在平稳状态下,Baba利用补充变量方法研究了多重休假的MX/G/1排队,但作者假定了休假时间和服务时间都有概率密度函数.本文考虑推广的多重休假MX/G/1排队,在假定休假时间和服务时间都是一般概率分布函数下,我们研究了队长的瞬态和稳态性质.通过引进"服务员忙期"和使用不同于Baba文中使用的分析技术,我们导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解.特别地,通过本文可直接获得多重休假的M/G/1与标准的MX/G/1排队系统相应的结果.