Selective trunk with multiserver reservation (Q1748490)

Summary: We consider a queueing model that is primarily applicable to traffic control in communication networks that use the Selective Trunk Reservation technique. Specifically, consider two traffic streams competing for service at an \(n\)-server queueing system. Jobs from the \textit{protected} stream, stream 1, are blocked only if all \(n\) servers are busy. Jobs from the \textit{best effort} stream, stream 2, are blocked if \(n - r\), \(r \geq 1\), servers are busy. Blocked jobs are diverted to a secondary group of \(c - n\) servers with, possibly, a different service rate. We extend the literature that studied this system for the special case of \(r = 1\) and present an explicit computational scheme to calculate the joint probabilities of the number of primary and secondary busy servers and related performance measures. We also argue that the model can be useful for bed allocation in a hospital.