A Queueing System with Negative Claims, InfiniteBuffer and Finite Bunker for Superseded Claims

Cover Page

Cite item


Study is performed of the queuing system with Poisson incoming flows of ordinary and negative claims. For ordinary claims, there is an infinite-capacity buffer. The arriving negative claim knocks out an ordinary claim queued in the buffer and moves it to a finite-capacity buffer of superseded claims (bunker). If upon the knock out of the ordinary claim bunker is full, knocked out claim is lost. If the buffer is empty, then the negative claim discharges the system without affecting it. After servicing the current claim, the server receives a claim from the buffer or, if the buffer is empty, the bunker. The claims arriving from both the buffer and bunker are served exponentially with the same parameter.
Expressions for the stationary joint probability distribution of number of claims in buffer and bunker and for main probabilistic characteristics of the system were obtained.

About the authors

R V Razumchik

Peoples Friendship University of Russia

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


Copyright (c) 2011 Разумчик Р.В.

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