Weak Regeneration in Modeling of Queueing Processes
Weak Regeneration in Modeling of Queueing Processes
复制标题
排队过程建模中的弱再生
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
E. Morozov
中科院分区：
文献类型：
--
作者：
E. Morozov
本文综述了再生过程中弱再生的最新结果，其中再生点的嵌入过程是再生，但与经典再生不同的是，它允许相邻循环之间的依赖性.我们开发了一个统一的两步方法来稳定性分析的基础上的前向更新时间的极限行为的表征。这采用了一个扩展的结构（最初由Foss和Kalashnikov [13]提出），它被广泛用于将原始的一个依赖再生过程转换为弱再生过程。结果表明，该方法简化了许多排队过程的稳定性分析。(The密封过程在打样中起着重要的作用。特别是，我们认为这两个著名的经典队列和多服务台队列与再生输入和不同的服务器。包括一个前馈网络的稳定性分析与再生输入和不相同的服务器的节点。
A survey of recent results on weak regeneration in queueing processes is given in which an embedded process of regeneration points is renewal, but unlike classical regeneration, a dependence between adjacent cycles is allowed. We develop a unified two-step approach to stability analysis based on a characterization of the limit behavior of the forward renewal time. This employs an extended construction (initially proposed by Foss and Kalashnikov [13]), which is widely used to transform an original one-dependent regenerative process into weakly regenerative one. It is shown that the approach simplifies stability analysis of many queuing processes. (The tightness of the queueing processes plays an important role in the proofs.) In particular, we consider both well-known classical queues and multi-server queues with regenerative input and non-identical servers. Included is a stability analysis of a feed-forward network with regenerative input and non-identical servers in the nodes.