共查询到20条相似文献,搜索用时 68 毫秒
1.
研究了一个修理工和c个服务台的可修排队系统.假设顾客的到达过程为PH更新过程,服务台在忙时与闲时具有不同的故障率.顾客的服务时间、服务台的寿命以及服务台的修理时间均服从指数分布.通过建立系统的拟生灭过程,得到了系统稳态分布存在的充要条件.利用矩阵几何解方法,给出了系统的稳态队长.在此基础上,得到了系统的某些排队论和可靠性指标. 相似文献
2.
3.
从数值计算角度研究M/M/c休假排队系统稳定状态的概率分布.采用GMRES方法求解概率分布向量所满足的大型线性方程,构造了一个循环预处理算子加速GMRES方法的收敛.数值实例验证了该算法的优越性. 相似文献
4.
5.
本文研究带反馈的具有正、负两类顾客的M/M/1工作休假排队模型.工作休假策略为空竭服务多重工作休假.负顾客一对一抵消队尾的正顾客(若有),若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.完成服务的正顾客以概率p(0
相似文献
6.
带有负顾客且具有Bernoulli反馈的M/M/1工作休假排队 总被引:3,自引:1,他引:2
本文研究带反馈的具有正、负两类顾客的M/M/1工作休假排队模型。工作休假策略为空竭服务多重工作休假。负顾客一对一抵消队首正在接受服务的正顾客(若有),若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务。完成服务的正顾客以概率p(0〈p≤1)离开系统,以概率1-P反馈到队尾寻求再次服务。使用拟生灭过程和矩阵几何解方法得到了系统队长的稳态分布,证明了系统队长随机分解结果并给出稳态下系统中正顾客的平均队长。 相似文献
7.
利用有限状态拟生灭过程和全概率分解的方法,首次研究了只允许部分服务台同步多重休假的M/M/e/k排队系统,得到了稳态队长和等待时间分布,并且讨论了系统的优化问题. 相似文献
8.
9.
10.
11.
The concepts of bi-immigration birth and death density matrix in random environment and bi-immigration birth and death process in random environment are introduced. For any bi-immigration birth and death matrix in random environment Q(θ) with birth rate λ 〈 death rate μ, the following results are proved, (1) there is an unique q-process in random environment, P^-(θ*(0);t) = (p^-(θ^*(0);t,i,j),i,j ≥ 0), which is ergodic, that is, lim t→∞(θ^*(0);t,i,j) = π^-(θ^*(0);j) ≥0 does not depend on i ≥ 0 and ∑j≥0π (θ*(0);j) = 1, (2) there is a bi-immigration birth and death process in random enjvironment (X^* = {X^*,t ≥ 0},ε^* = {εt,t ∈ (-∞, ∞)}) with random transition matrix P^-(θ^* (0);t) such that X^* is a strictly stationary process. 相似文献
12.
《Stochastic Processes and their Applications》2020,130(7):3990-4027
The integer points (sites) of the real line are marked by the positions of a standard random walk with positive integer jumps. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the random walk are supported by a bounded set, have finite or infinite mean, respectively. Focussing on the case of strong sparsity and assuming additionally that the distribution tail of the jumps is regularly varying at infinity we consider a nearest neighbor random walk on the set of integers having jumps with probability at every nonmarked site, whereas a random drift is imposed at every marked site. We prove new distributional limit theorems for the so defined random walk in a strongly sparse random environment, thereby complementing results obtained recently in Buraczewski et al. (2019) for the case of moderate sparsity and in Matzavinos et al. (2016) for the case of weak sparsity. While the random walk in a strongly sparse random environment exhibits either the diffusive scaling inherent to a simple symmetric random walk or a wide range of subdiffusive scalings, the corresponding limit distributions are non-stable. 相似文献
13.
Let be a correlated random walk in random
environment. For the sub-linear regime, that is, almost surely
but ,
we show that there is ??Let be a correlated random walk in random
environment. For the sub-linear regime, that is, almost surely
but ,
we show that there is $0s. This result characterizes
the slowdown property of the walk. 相似文献
14.
令$\{Z_{n}, n\ge 0\}$为独立同分布随机环境下的上临界分支过程$\xi=(\xi_n)_{n\geq 0}$.本文给出了$\ln (Z_{n+n_{0}}/Z_{n_{0}})$的一些偏差不等式及其在构造置信区间上的一些应用. 相似文献
15.
Negative arrivals are used as a control mechanism in many telecommunication and computer networks. In the paper we analyze multiserver retrial queues; i.e., any customer finding all servers busy upon arrival must leave the service area and re-apply for service after some random time. The control mechanism is such that, whenever the service facility is full occupied, an exponential timer is activated. If the timer expires and the service facility remains full, then a random batch of customers, which are stored at the retrial pool, are automatically removed. This model extends the existing literature, which only deals with a single server case and individual removals. Two different approaches are considered. For the stable case, the matrix–analytic formalism is used to study the joint distribution of the service facility and the retrial pool. The approximation by more simple infinite retrial model is also proved. In the overloading case we study the transient behaviour of the trajectory of the suitably normalized retrial queue and the long-run behaviour of the number of busy servers. The method of investigation in this case is based on the averaging principle for switching processes. 相似文献
16.
本文主要讨论了在独立但不同分布环境下,半直线上可逗留随机环境中随机游动的常返性和非常返性,并进一步研究了常返性中的正常返性和零常返性. 相似文献
17.
Christiane Takacs 《Journal of Theoretical Probability》2001,14(3):699-715
We consider a random walk on
in a stationary and ergodic random environment, whose states are called types of the vertices of
. We find conditions for which the speed of the random walk is positive. In the case of a Markov chain environment with finitely many states, we give an explicit formula for the speed and for the asymptotic proportion of time spent at vertices of a certain type. Using these results, we compare the speed of random walks on
in environments of varying randomness. 相似文献
18.
We consider a finite QBD process with m levels. Assuming that the mean drift is 0, we obtain an asymptotic behavior as m→∞ in the stationary distribution , by finding an explicit expression for vector c. This solves the problem that was conjectured by Miyazawa et al. [Asymptotic behaviors of the loss probability for a finite buffer queue with QBD structure, 23 (2007) 79-95]. 相似文献
19.
20.
We study a birth and death process $\{N_t\}_{t\ge0}$ in i.i.d. random environment, for which at each discontinuity, one particle might be born or at most $L$ particles might be dead. Along with investigating the existence and the recurrence criterion, we also study the law of large numbers of $\{N_t\}$. We show
that the first passage time can be written as a functional of an $L$-type branching process in random environment and a sequence of independent and exponentially distributed random variables. Consequently, an explicit velocity of the law of large numbers can be given. 相似文献