Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations

This paper treats the discrete time Geometric/G/1 system with vacations. In this system, after serving all customers in the system, the server will take a random maximum number of vacations before returning to the service mode. The stochastic decomposition property of steady-state queue length and waiting time has been proven. The busy period, vacation mode period, and service mode period distributions are also derived. Several common vacation policies are special cases of the vacation policy presented in this study.     

Min(N,V)--策略休假的M/G/1排队系统分析

在一个M／G／1休假排队系统中，同时考虑N-策略和多重休假策略，休假终止准则为任一个条件满足，我们称其为Min（N，V）-策略。本文给出了在此策略下的排队系统的稳态队长、忙期分布等基本指标。首次使用条件等待时间方法得到稳态等待时间的LST（Laplace-Stieltjes transform），同时还列举了一个应用的实例。最后指出本文模型是几个已研究模型的推广。     

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

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

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

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

多级适应性休假排队系统的PH封闭性

对多级适应性休假的M/G/1排队系统,若休假时间服从位相型(PH)分布,我们证明了随机分解中的附加队长和附加延迟分别是离散和连续的PH随机变量,并给出其不可约PH表示,作为特例,国内外广泛研究的多重休假和单重休假系统,随机分解中的附加随机变量对PH分布都是封闭的。     

带启动时间的多级适应性休假的M/G/1排队

本研究带启动时间的多级适应性休假的M/G/1间排队。给出稳态队长分布和母函数、等待时间分布和其LST及其随机分解结果，推导出忙期、假期和启动期的母函数。带有启动时间的单重休假和多重休假是本中模型的两个极端情况。     

带启动-关闭期和N策略的多重休假M/G/1排队

研究多重休假带启动-关闭期和N策略的M/G/1排队系统,根据嵌入Markov链的方法推导出状态转移概率矩阵,利用M/G/1型排队系统结构矩阵解析法,得出顾客服务完离去后系统稳态队长分布及其母函数的表达式;从而由经典随机分解原理,给出稳态队长的随机分解结果.此外,利用LST变换处理卷积,得到忙期的母函数及数学期望的表达式;进而得到忙期、启动期和关闭期的母函数及在稳态下服务员处于各状态的概率.最后提出一些数值例子以验证结论.     

A queueing system with linear repeated attempts,bernoulli schedule and feedback

We analyse a single-server retrial queueing system with infinite buffer, Poisson arrivals, general distribution of service time and linear retrial policy. If an arriving customer finds the server occupied, he joins with probabilityp a retrial group (called orbit) and with complementary probabilityq a priority queue in order to be served. After the customer is served completely, he will decide either to return to the priority queue for another service with probability ϑ or to leave the system forever with probability =1−ϑ, where 0≤ϑ<1. We study the ergodicity of the embedded Markov chain, its stationary distribution function and the joint generating function of the number of customers in both groups in the steady-state regime. Moreover, we obtain the generating function of system size distribution, which generalizes the well-knownPollaczek-Khinchin formula. Also we obtain a stochastic decomposition law for our queueing system and as an application we study the asymptotic behaviour under high rate of retrials. The results agree with known special cases. Finally, we give numerical examples to illustrate the effect of the parameters on several performance characteristics.     

On the discrete-time Geo/G/1 queue with randomized vacations and at most J vacations

This paper examines a discrete-time Geo/G/1 queue, where the server may take at most J − 1 vacations after the essential vacation. In this system, messages arrive according to Bernoulli process and receive corresponding service immediately if the server is available upon arrival. When the server is busy or on vacation, arriving messages have to wait in the queue. After the messages in the queue are served exhaustively, the server leaves for the essential vacation. At the end of essential vacation, the server activates immediately to serve if there are messages waiting in the queue. Alternatively, the server may take another vacation with probability p or go into idle state with probability (1 − p) until the next message arrives. Such pattern continues until the number of vacations taken reaches J. This queueing system has potential applications in the packet-switched networks. By applying the generating function technique, some important performance measures are derived, which may be useful for network and software system engineers. A cost model, developed to determine the optimum values of p and J at a minimum cost, is also studied.     

A survey on retrial queues

Queueing systems in which arriving customers who find all servers and waiting positions (if any) occupied may retry for service after a period of time are called retrial queues or queues with repeated orders. Retrial queues have been widely used to model many problems in telephone switching systems, telecommunication networks, computer networks and computer systems. In this paper, we discuss some important retrial queueing models and present their major analytic results and the techniques used. Our concentration is mainly on single-server queueing models. Multi-server queueing models are briefly discussed, and interested readers are referred to the original papers for details. We also discuss the stochastic decomposition property which commonly holds in retrial queues and the relationship between the retrial queue and the queue with server vacations.     

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

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

奖惩系统在随机优序下的极小与极大平稳分布

奖惩系统(Bonus-M a lus System)是世界各国机动车辆险中广泛采用的一种经验费率厘定机制.文[1]在最一般的框架下,给出了奖惩系统的数学建模与稳态分析.本文将进一步证明,文[1]中给出的奖惩系统两种特定的平稳分布恰分别是奖惩系统在随机优序下的极小与极大平稳分布.特别地,基于这一事实严格证明了文[1]提出的有关封闭型奖惩系统年度总保费的一个猜想.     

An MX/G/1 queueing system with a setup period and a vacation period

This paper deals with an M^X/G/1 queueing system with a vacation period which comprises an idle period and a random setup period. The server is turned off each time when the system becomes empty. At this point of time the idle period starts. As soon as a customer or a batch of customers arrive, the setup of the service facility begins which is needed before starting each busy period. In this paper we study the steady state behaviour of the queue size distributions at stationary (random) point of time and at departure point of time. One of our findings is that the departure point queue size distribution is the convolution of the distributions of three independent random variables. Also, we drive analytically explicit expressions for the system state probabilities and some performance measures of this queueing system. Finally, we derive the probability generating function of the additional queue size distribution due to the vacation period as the limiting behaviour of the M^X/M/1 type queueing system. This revised version was published online in June 2006 with corrections to the Cover Date.     

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

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

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

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

NCD系统的数学理论

无索赔折扣系统(No Claim Discount system,简记为NCD系统)是世界各国机动车辆险中广泛采用的一种经验费率厘定机制.本文尝试建立了NCD系统严谨的数学理论, 重点讨论了NCD系统的数学建模和稳态分析.此外,作为本文必要的数学前提,首先在第2节着重探讨了随机矩阵间的随机优序关系,并将所得结论运用至齐次不可约且遍历的马尔科夫链的研究中,这些内容也有其独立的数学上的兴趣.     

M/G/1一般减量服务单重休假排队系统的随机分解

本文讨论了M/G/1型一般减量服务单重休假排队模型,运用结构分析法得到稳态队长和服务时间的随机分解的母函数和拉式变换,并给出稳态分布成立的条件及其概率含义．     

关闭-启动型多级适应性休假Mx/G/1排队系统的随机分解

本文采用一种较简单的分析方法,讨论了队长分布的瞬态和稳态性质,得到了队长瞬态分布的拉普拉斯变换的递推表达式和稳态分布的递推表达式,以及稳态队长的随机分解,并给出了服务台闲期、服务台忙循环期的分布函数。     

关闭一启动型多级适应性休假M^x／G／1排队系统的随机分解

本文采用一种较简单的分析方法，讨论了队长分布的瞬态和稳态性质，得到了队长瞬态分布的拉普拉斯变换的递推表达式和稳态分布的递推表达式，以及稳态队长的随机分解，并给出了服务台闲期、服务台忙循环期的分布函数。