A queuing system with a finite number of input flows controlled by a fixed-time cyclic algorithm is considered. The input flows are formed in a random external environment with finite number of states. The environment is synchronized with the server. In each environment state the input flows are Poisson flows of groups with intensities and size distributions depending on the state. A mathematical model is constructed as a multivariate denumerable Markov chain, necessary and sufficient conditions for the existence of a stationary distributions are found. Martingale sequences are introduced. Using these one can study the mean emptying time for a particular queue.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Unloading Time Martingale Relations in a Cyclic Queueing System in Random Environment

  • Andrei V. Zorine

摘要

A queuing system with a finite number of input flows controlled by a fixed-time cyclic algorithm is considered. The input flows are formed in a random external environment with finite number of states. The environment is synchronized with the server. In each environment state the input flows are Poisson flows of groups with intensities and size distributions depending on the state. A mathematical model is constructed as a multivariate denumerable Markov chain, necessary and sufficient conditions for the existence of a stationary distributions are found. Martingale sequences are introduced. Using these one can study the mean emptying time for a particular queue.