A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.
A multiserver on-demand system is considered in which each call has three interdependent random characteristics: the required number of servers, capacity, and service time. The total capacity of calls and the total number of servers in the system are limited. The type of a call is defined by the number of servers required for its service. We find a stationary distribution of the number of calls in the system, as well as the loss probability for a call of each type.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.