期刊文献+

Ergodicity and Invariance of Flows in Queuing Systems

Ergodicity and Invariance of Flows in Queuing Systems
下载PDF
导出
摘要 In this paper, we investigate the flow of customers through queuing systems with randomly varying intensities. The analysis of the Kolmogorov-Chapman system of stationary equations for this model showed that it is not possible to construct a convenient symbolic solution. In this paper an attempt is made to circumvent this requirement by referring to the ergodicity theorems, which gives the conditions for the existence of the limit distribution in the service processes, but do not require knowledge of them. In this paper, we investigate the flow of customers through queuing systems with randomly varying intensities. The analysis of the Kolmogorov-Chapman system of stationary equations for this model showed that it is not possible to construct a convenient symbolic solution. In this paper an attempt is made to circumvent this requirement by referring to the ergodicity theorems, which gives the conditions for the existence of the limit distribution in the service processes, but do not require knowledge of them.
出处 《Journal of Applied Mathematics and Physics》 2018年第7期1454-1459,共6页 应用数学与应用物理(英文)
关键词 A QUEUING System AN ERGODICITY AN Input Flow A Randomly VARYING Intensity A Queuing System An Ergodicity An Input Flow A Randomly Varying Intensity
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部