A generalized loss priority system with application to bandwidth sharing

Stepan Rogozin
Some priority loss queueing systems and their generalisations are considered. In particular, we study a modification of Adan-Weiss loss system with patient non-priority customers, a system with blocking based on infinite server system (proposed by W.Whitt) and a bandwidth sharing model. We study relations between these models. Moreover, an application of Whitt blocking model for bandwidth sharing to obtain bounds for stationary number of customers for general service times is proposed. Finally, a numerical example is considered to compare the results in the case of exponential service times.