Generalized Erlang Problem for Service Systems with Finite Total Capacity

Authors:
O. M. Tikhonenko
Affiliations:
Jan Dlugosz University, Czestochowa, Poland
Venue:
Problems of Information Transmission
Year:
2005

Citing 2
Cited 1

Introduction to queueing theory (2nd ed)

Introduction to queueing theory (2nd ed)
Analysis of Queuing Systems for Random-Length Arrivals with Limited Cumulative Volume

Problems of Information Transmission

The generalization of AQM algorithms for queueing systems with bounded capacity

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.