Congestion in Blocking Systems-A Simple Approximation Technique

DOI10.1002/j.1538-7305.1980.tb03034.xzbMath0439.90037OpenAlexW2005271321MaRDI QIDQ3882167

A. A. Fredericks

Publication date: 1980

Published in: Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/j.1538-7305.1980.tb03034.x

zbMATH Keywords

overflow trafficblocking systemscongestion in complex stochastic server systemsexplicit asymptotic error representationsimple approximation technique

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (13)

On the continued Erlang loss function ⋮ Inequalities for Charlier polynomials with application to teletraffic theory ⋮ Equitable transit charges for multi-administration telecommunications networks ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ Asymptotic behavior of the expansion method for open finite queueing networks ⋮ Modelling of cellular networks with traffic overflow ⋮ DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES ⋮ Two-dimensional convolution algorithm for modelling multiservice networks with overflow traffic ⋮ The evergreen Erlang loss function ⋮ Multiservice switching networks with overflow links and resource reservation ⋮ On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers ⋮ Second-order properties of the loss probability in \(M/M/s/s+c\) systems

This page was built for publication: Congestion in Blocking Systems-A Simple Approximation Technique