共查询到20条相似文献,搜索用时 187 毫秒
1.
2.
本文考虑带有多级适应性休假的Geo/G/1离散时间排队系统, 其中在服务员休假期间到达的顾客以概率 $\tha (0 < \tha\leqslant1)$ 进入系统. 运用更新过程理论和全概率分解技术, 从任意初始状态出发, 获得时刻 $n^+$ 处队长瞬态分布的 $z$-变换的递推表达式, 并在瞬时性质分析的基础上, 分别得到时刻 $n^+, n, n^-$ 处队长稳态分布的递推公式, 所得结果进一步表明稳态队长不再具有随机分解结构. 最后通过数值实例, 讨论队长稳态分布对系统参数的敏感性, 并阐述了队长稳态分布的递推公式在系统容量优化设计中的重要应用价值. 相似文献
3.
4.
本文研究了具有位相型休假、位相型启动和单重几何休假的离散时间排队,假定 顾客到达间隔服从一般分布,服务时间服从几何分布,运用矩阵解析方法我们得到了这 些排队系统中顾客在到达时刻稳态队长分布及其随机分解. 相似文献
5.
6.
本文考虑了单重休假排队系统,其中在服务员休假中到达的顾客以概率p(0≤p≤1)进入系统,通过采用马尔科夫骨架方法(MSP),得到了队长的瞬时分布. 相似文献
7.
《系统科学与数学》2016,(11)
考虑具有Bernoulli反馈,可变到达率以及Min(Ⅳ,D)-策略控制的Geo/G/1离散时间可修排队系统的可靠性指标.服务台在服务过程中可能发生故障,顾客的到达率依赖于服务员的状态.使用更新理论,全概率分解技术和概率母函数方法,首先讨论了服务员在任意时刻n~+处于忙的瞬态概率和稳态概率.其次,分析了一些可靠性指标,如服务台的瞬态和稳态不可用度、时间段(0~+,n~+]内服务台的平均故障次数和稳态故障频度.所得结果揭示了可靠性指标的随机分解性质.利用本文的结论直接给出了一些特殊离散时间可修排队系统的可靠性指标.最后,通过数值实例分析了系统参数对可靠性指标的影响. 相似文献
8.
目前N-策略批到达排队系统稳态队长分布难以给出解析解.提出一种新的递归算法研究顾客批到达,服务台延迟启动且多重休假的N-策略休假排队系统稳态队长分布.首先采用条件随机分解的方法得到稳态队长分布的概率母函数;然后采用递归算法推导附加队长分布的解析表达式;最后推导出稳态队长分布的递推关系式. 相似文献
9.
考虑单重休假的Geo/G/1离散时间排队系统,其中在服务员休假期间到达的顾客以概率θ(0<θ≤1)进入系统.通过引入"服务员忙期"和使用全概率分解技术,从任意初始状态出发,研究了队长的瞬态和稳态性质,导出了在任意时刻n瞬态队长分布的z-变换的递推表达式和稳态队长分布的递推表达式,以及稳态队长的随机分解.最后,通过数值实例,讨论了稳态队长分布对系统参数的敏感性,并阐述了获得便于计算的稳态队长分布的表达式在系统容量设计中有重要的价值. 相似文献
10.
具有N-策略休假的M/G/1排队的随机分解与最优策略 总被引:5,自引:0,他引:5
本文利用向量Markov过程方法,研究了具有N-策略休假且休假时间为一般分布的M/G/1排队,它的两种特殊情况分别是具有多重休假的M/G/1排队和具有N-策略控制的M/G/1排队。我们得到了这个排队系统稳态时的队长分布,证明了它的稳态队长存在随机分解。然后讨论了当休假时间服从指数分布时的最优策略问题。 相似文献
11.
Using recursive method,this paper studies the queue size properties at any epoch n + in Geom/G/1(E,SV) queueing model with feedback under LASDA (late arrival system with delayed access) setup.Some new results about the recursive expressions of queue size distribution at different epoch (n+,n,n-) are obtained.Furthermore the important relations between stationary queue size distribution at different epochs are discovered.The results are different from the relations given in M/G/1 queueing system.The model discussed in this paper can be widely applied in many kinds of communications and computer network. 相似文献
12.
This paper studies the operating characteristics of an M[x]/G/1 queueing system with N-policy and at most J vacations. The server takes at most J vacations repeatedly until at least N customers returning from a vacation are waiting in the queue. If no customer arrives by the end of the Jth vacation, the server becomes idle in the system until the number of arrivals in the queue reaches N. We derive the system size distribution at a random epoch and departure epoch, as well as various system characteristics. 相似文献
13.
This paper deals with an MX/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 MX/M/1 type queueing system.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
14.
This paper examines an M[x]/G/1 queueing system with a randomized vacation policy and at most J vacations. Whenever the system is empty, the server immediately takes a vacation. If there is at least one customer found waiting in the queue upon returning from a vacation, the server will be immediately activated for service. Otherwise, if no customers are waiting for service at the end of a vacation, the server either remains idle with probability p or leaves for another vacation with probability 1 − p. This pattern continues until the number of vacations taken reaches J. If the system is empty by the end of the Jth vacation, the server becomes idle in the system. Whenever one or more customers arrive at server idle state, the server immediately starts providing service for the arrivals. Assume that the server may meet an unpredictable breakdown according to a Poisson process and the repair time has a general distribution. For such a system, we derive the distributions of important system characteristics, such as system size distribution at a random epoch and at a departure epoch, system size distribution at busy period initiation epoch, the distributions of idle period, busy period, etc. Finally, a cost model is developed to determine the joint suitable parameters (p∗, J∗) at a minimum cost, and some numerical examples are presented for illustrative purpose. 相似文献
15.
This paper studies the operating characteristics of an M[x]/G/1 queueing system under a modified vacation policy, where the server leaves for a vacation as soon as the system is empty. The server takes at most J vacations repeatedly until at least one customer is found waiting in the queue when the server returns from a vacation. We derive the system size distribution at different points in time, as well as the waiting time distribution in the queue. Further, we derive some important characteristics including the expected length of the busy period and idle period. This shows that the results generalize those of the multiple vacation policy and the single vacation policy M[x]/G/1 queueing system. Finally, a cost model is developed to determine the optimum of J at a minimum cost. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
16.
《随机分析与应用》2013,31(3):739-753
Abstract We consider an M x /G/1 queueing system with a random setup time, where the service of the first unit at the commencement of each busy period is preceded by a random setup time, on completion of which service starts. For this model, the queue size distributions at a random point of time as well as at a departure epoch and some important performance measures are known [see Choudhury, G. An M x /G/1 queueing system with setup period and a vacation period. Queueing Sys. 2000, 36, 23–38]. In this paper, we derive the busy period distribution and the distribution of unfinished work at a random point of time. Further, we obtain the queue size distribution at a departure epoch as a simple alternative approach to Choudhury4. Finally, we present a transform free method to obtain the mean waiting time of this model. 相似文献
17.
带有Bernoulli反馈的多级适应性休假的Geo/G/1排队系统分析 总被引:2,自引:0,他引:2
考虑带有Bernoulli反馈的多级适应性休假的Geo/G/1离散时间排队系统.通过引入服务员忙期和使用一种简洁的分解方法,讨论了队长的瞬时分布,得到了在任意时刻n队长为j的概率关于时刻n的z-变换的递推式,及队长平稳分布的递推式,且证明了稳态队长的随机分解性质.最后,给出了在特殊情形下相应的一些结果和数值计算实例. 相似文献
18.
Wiener-Hopf analysis of an M/G/1 queue with negative customers and of a related class of random walks 总被引:5,自引:0,他引:5
Two variants of an M/G/1 queue with negative customers lead to the study of a random walkX
n+1=[X
n
+
n
]+ where the integer-valued
n
are not bounded from below or from above, and are distributed differently in the interior of the state-space and on the boundary. Their generating functions are assumed to be rational. We give a simple closed-form formula for
, corresponding to a representation of the data which is suitable for the queueing model. Alternative representations and derivations are discussed. With this formula, we calculate the queue length generating function of an M/G/1 queue with negative customers, in which the negative customers can remove ordinary customers only at the end of a service. If the service is exponential, the arbitrarytime queue length distribution is a mixture of two geometrical distributions.Supported by the European grant BRA-QMIPS of CEC DG XIII. 相似文献
19.
This paper studies the operating characteristics of an M[x]/G/1 queueing system under a variant vacation policy, where the server leaves for a vacation as soon as the system is empty. The server takes at most J vacations repeatedly until at least one customer is found waiting in the queue when the server returns from a vacation. If the server is busy or on vacation, an arriving batch balks (refuses to join) the system with probability 1 − b. We derive the system size distribution at different points in time, as well as the waiting time distribution in the queue. Finally, important system characteristics are derived along with some numerical illustration. 相似文献
20.
Hideo Ōsawa 《Queueing Systems》1994,18(1-2):133-148
We consider a discrete-time queueing system and its application to related models. The model is defined byX
n+1=Xn+An-Dn+1 with discrete states, whereX
n is the queue-length at the nth time epoch,A
n is the number of arrivals at the start of the nth slot andD
n+1 is the number of outputs at the end of the nth slot. In this model, the arrival process {A
n} is described as a sequence of independently and identically distributed random variables. The departureD
n+1 depends only on the system sizeX
n+An at the beginning of the time slot.We study the reversibility for the model. The departure discipline in which the system has quasi-reversibility is determined. Models with special arrival processes were studied by Walrand [8] and sawa [7]. In this paper, we generalize their results. Moreover, we consider discrete-time queueing networks with some reversible nodes. We then obtain the product-form solution for these networks. 相似文献