Queue Length in a Queuing System with Dependent Service Times


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

A single-server queuing system with infinite capacity and a recurrent input flow is considered. Service times of the customer units have an exponential distribution with random parameter. The current value of the parameter is chosen from a finite set with given probabilities at the time the service of a certain customer is completed. Sequential values of the parameters form a special kind of Markov chain. The nonstationary behavior of the queue length is studied.

作者简介

V. Ushakov

Department of Computational Mathematics and Cybernetics; Institute of Informatics Problems, Federal Research Center Computer Science and Control

编辑信件的主要联系方式.
Email: vgushakov@mail.ru
俄罗斯联邦, Moscow, 119991; Moscow, 119991

N. Ushakov

Department of Mathematical Sciences

编辑信件的主要联系方式.
Email: ushakov@math.ntnu.no
挪威, Trondheim, 7491

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2019