Scientific Library of Tomsk State University

   E-catalog        

Normal view MARC view

A cyclic queueing system with priority customers and T-strategy of service A. A. Nazarov, S. Paul

By: Nazarov, Anatoly AContributor(s): Paul, Svetlana VMaterial type: ArticleArticleSubject(s): асимптотический анализ | экспоненциальное распределение | Пуассона процессGenre/Form: статьи в сборниках Online resources: Click here to access online In: Distributed computer and communication networks : 19th International Conference, DCCN 2016, Moscow, Russia, November 21-25, 2016 : revised selected papers P. 182-193Abstract: We review the queuing system, the input of which is supplied with the Poisson process of priority customers and N number of the Poisson processes of non-priority customers. Durations of service for both priority and non-priority customers have a distribution functions of A(x) and Bn(x)Bn(x) for applications from priority flow and for customers from n flow (n=1…Nn=1…N) respectively. By using methods of systems with server vacations and asymptotic analysis in conditions of a large load we have found the asymptotic probability distribution of a value of an unfinished work. It is shown that this distribution is exponential.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Библиогр.: 7 назв.

We review the queuing system, the input of which is supplied with the Poisson process of priority customers and N number of the Poisson processes of non-priority customers. Durations of service for both priority and non-priority customers have a distribution functions of A(x) and Bn(x)Bn(x) for applications from priority flow and for customers from n flow (n=1…Nn=1…N) respectively. By using methods of systems with server vacations and asymptotic analysis in conditions of a large load we have found the asymptotic probability distribution of a value of an unfinished work. It is shown that this distribution is exponential.

There are no comments on this title.

to post a comment.
Share