Time Characteristics of Queuing System with Renovation and Reservice
- Authors: Zaryadov IS1, Scherbanskaya AA1
-
Affiliations:
- Peoples’ Friendship University of Russia
- Issue: No 2 (2014)
- Pages: 61-66
- Section: Articles
- URL: https://journals.rudn.ru/miph/article/view/8346
Cite item
Full Text
Abstract
This article is devoted to time characteristics of queuing system with recurrent input flow, one server, exponential service time distribution and infinite queue. The mechanism of renovation with reservice (repeated service) is introduced. It means that a packet at the moment of the end of its service with some probability may just leave the system or with complementary probability will drop all other packets in the system and return for service. Assuming that we know the steady-state probability distribution of number of packets (calculated with help of embedded by the moments of arrival Markov chain) the main emphasis of the article will be on system time characteristics such as steady-state distributions of time in system for serviced or dropped packets, average time characteristics - mean service time, mean waiting time for a dropped, serviced and an arbitrary packet.
About the authors
I S Zaryadov
Peoples’ Friendship University of Russia
Email: izaryadov@sci.pfu.edu.ru
Probability Theory and Mathematical Statistics Department
A A Scherbanskaya
Peoples’ Friendship University of Russia
Email: nurafore@mail.ru
Probability Theory and Mathematical Statistics Department