The MAP/G/1/ Discrete-Time Queueing System with Inversive Service Order and Probabilistic Priority

Cover Page

Abstract


This paper considers a discrete-time queueing system MAP∕G∕1∕∞ that is determined as follows. Upon arrival into the system of a new customer its length is compared with the (remaining) length of the customer in the device and with some probability which depends only on this two lengths, a new arrival will occupy the server while pushing out a servicing customer to the first place in the queue, and with the supplemental probability, alternatively, the newly arrived one occupies the first position in the queue (inversive service order and probabilistic priority). The main stationary characteristics of such systems behavior have been found. A number of numerical examples are presented according to found analytical formulae.

About the authors

A V Pechinkin

Peoples Friendship University of Russia

Email: apechinkin@ipiran.ru
Кафедра теории вероятностей и математической статистики; Российский университет дружбы народов; Peoples Friendship University of Russia

I V Stalchenko

Peoples Friendship University of Russia

Email: Stainka@yandex.ru
Кафедра теории вероятностей и математической статистики; Российский университет дружбы народов; Peoples Friendship University of Russia

References

Statistics

Views

Abstract - 69

PDF (Russian) - 747

Cited-By



Copyright (c) 2010 Печинкин А.В., Стальченко И.В.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies