Queue Size Distribution of Geo/G/1 Queue Under the Min(N,D)-Policy

This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D,whichever occurs first(Min(N,D)-policy).By using renewal process theory and total probability decomposition technique,the authors study the transient and equilibrium properties of the queue length from the beginning of the arbitrary initial state,and obtain both the recursive expression of the z-transformation of the transient queue length distribution and the recursive formula for calculating the steady state queue length at arbitrary time epoch n~+.Meanwhile,the authors obtain the explicit expressions of the additional queue length distribution.Furthermore,the important relations between the steady state queue length distributions at different time epochs n~-,n and n~+ are also reported.Finally,the authors give numerical examples to illustrate the effect of system parameters on the steady state queue length distribution,and also show from numerical results that the expressions of the steady state queue length distribution is important in the system capacity design.     

The Structure of Departure Process and Optimal Control Strategy N~* for Geo/G/1 Discrete-Time Queue with Multiple Server Vacations and Min(N,V)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n~+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0~+, n~+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.     

Strong Approximation Method and the(Functional) Law of Iterated Logarithm for GI/G/1 Queue

In this paper, a unified method based on the strong approximation(SA) of renewal process(RP) is developed for the law of the iterated logarithm(LIL) and the functional LIL(FLIL), which quantify the magnitude of the asymptotic rate of the increasing variability around the mean value of the RP in numerical and functional forms respectively. For the GI/G/1 queue, the method provides a complete analysis for both the LIL and the FLIL limits for four performance functions: The queue length, workload, busy time and idle time processes, covering three regimes divided by the traffic intensity.     

Some Reliability Problems Arising in the M~x/G(M/G)/1 Repairable Queueing System with Single Delay Vacation

1　 IntroductionIn Ref.[1 ] some queueing indices of the Mx/ G( M/ G) / 1 repairable queueing system withsingle delay vacation were discussed,and the transient solution,stationary solution andstochastic decomposition of the queue length were obtained.Butwhile the service stationis up and operating,it is subject to breakdowns.Once the service station breaks down,there is a repair operation that bring the broken service station back to a new state andoperation immediately.So it is important to…     

Analysis of a Discrete-Time Geo/G/1 Queue in a Multi-Phase Service Environment with Disasters

This paper considers a discrete-time Geo/G/1 queue in a multi-phase service environment,where the system is subject to disastrous breakdowns, causing all present customers to leave the system simultaneously. At a failure epoch, the server abandons the service and the system undergoes a repair period. After the system is repaired, it jumps to operative phase i with probability qi, i = 1, 2 ···, n.Using the supplementary variable technique, we obtain the distribution for the stationary queue length at the arbitrary epoch, which are then used for the computation of other performance measures. In addition, we derive the expected length of a cycle time, the generating function of the sojourn time of an arbitrary customer, and the generating function of the server's working time in a cycle. We also give the relationship between the discrete-time queueing system to its continuous-time counterpart. Finally,some examples and numerical results are presented.     

Performance Analysis of a Discrete-Time Queue with Working Breakdowns and Searching for the Optimum Service Rate in Working Breakdown Period

This paper deals with a discrete-time Geo/Geo/1 queueing system with working breakdowns in which customers arrive at the system in variable input rates according to the states of the server. The server may be subject to breakdowns at random when it is in operation. As soon as the server fails, a repair process immediately begins. During the repair period, the defective server still provides service for the waiting customers at a lower service rate rather than completely stopping service.We analyze the stability condition for the considered system. Using the probability generating function technique, we obtain the probability generating function of the steady-state queue size distribution.Also, various important performance measures are derived explicitly. Furthermore, some numerical results are provided to carry out the sensitivity analysis so as to illustrate the effect of different parameters on the system performance measures. Finally, an operating cost function is formulated to model a computer system and the parabolic method is employed to numerically find the optimum service rate in working breakdown period.     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS II： M（n）/G/1/K

We study a single-server queueing system with state-dependent arrivals and general service distribution, or simply M（n）/G/1/K, where the server follows an N policy and takes multiple vacations when the system is empty. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirements are the Laplace-Stieltjes transforms of the service time distribution and the vacation time distribution, and the state-dependent arrival rate. The computational complexity of the algorithm is O（K^3）.     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS I： G/M（n）/1/K

In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M（n）/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirement is the Laplace-Stieltjes transform of the interarrival distribution as well as the state-dependent service rate and state-dependent vacation rate. In a subsequent companion paper, we study its dual system M（n）/G/1/K queue with statedependent vacations.     

Geom/G_1,G_2(Geom/G)/1/1可修Erlang消失系统的可靠性指标及其计算机仿真分析

研究Bernoulli到达且无等待空间的单服务员离散时间可修Erlang消失排队系统.系统中服务员可向顾客提供两种不同类型的服务,即常规服务和可选二次服务.在系统运行过程中服务设备的故障可以引起系统中顾客的清空.采用一种新型的离散补充变量技术,给出了系统稳态可用度,稳态失效频度,首次故障前平均时间,服务员空闲概率,故障概率,工作概率以及系统稳态损失概率等一系列性能指标.最后通过数值实例和计算机仿真验证了理论分析技术的合理性和有效性.     

基于ARMA（1,1）需求的多级供应链牛鞭效应仿真

在市场需求信息为ARMA(1,1)平稳可逆时间序列模型的前提下,首次建立了多级供应链各级成员以均方误差优化预测技术预测市场需求,以订货点法来确定订货量时多级供应链牛鞭效应理论及仿真模型,并利用仿真模型对多级供应链的整体牛鞭效应及其影响因素进行了详细的分析,研究表明供应链牛鞭效应和相关系数ρ与滑动平均系数θ之间的相互关系有关.     

Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths

This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline.Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH-distributions.A GI/M/1 type Markov process for a generalized age process of batches of customers is constructed.The stationary distribution of the GI/M/1 type Markov process is found explicitly and,consequently,the distributions of the age of the batch in service,the total workload in the system,waiting times,and sojourn times of different batches and different types of customers are obtained.The paper gives the matrix representations of the PH-distributions of waiting times and sojourn times.Some results are obtained for the distributions of queue lengths at departure epochs and at an arbitrary time.These results can be used to analyze not only the queue length,but also the composition of the queue.Computational methods are developed for calculating steady state distributions related to the queue lengths,sojourn times,and waiting times.     

ARMA(1,1)需求条件下需求信息延迟对两级供应链牛鞭效应和平均成本的影响

为了分析需求信息延迟对供应链绩效的影响,考虑由一个零售商和一个制造商所组成的两级供应链,顾客需求满足ARMA(1,1)过程。首先从理论上建立需求信息不延迟与需求信息延迟时零售商和制造商订单量波动程度的定量描述模型,通过两种情形下的比较分析得出:当需求自回归系数为正数时,需求信息延迟将减小牛鞭效应,当需求自回归系数为负数时,需求信息延迟将提高牛鞭效应;其次运用仿真方法对需求信息延迟与需求信息不延迟时制造商和零售商的平均成本进行了比较分析,同样得出:当需求自回归系数为正数时,需求信息延迟将降低制造商和零售商的平均成本,而需求自回归系数为负数时,需求信息延迟将提高制造商和零售商的平均成本。