Congestion in Blocking Systems-A Simple Approximation Technique

DOI10.1002/J.1538-7305.1980.TB03034.XMaRDI QIDQ3882167zbMATH OpenOpenAlexFDO

Authors 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

blocking systemscongestion in complex stochastic server systemsexplicit asymptotic error representationoverflow trafficsimple approximation technique

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cited in

(14)

• On the continued Erlang loss function
• Inequalities for Charlier polynomials with application to teletraffic theory
• Equitable transit charges for multi-administration telecommunications networks
• Asymptotic behavior of the expansion method for open finite queueing networks
• 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
• Buffer allocation for an integer nonlinear network design problem
• Modelling of cellular networks with traffic overflow
• Multiservice switching networks with overflow links and resource reservation
• On the accuracy of the OPC approximation for a symmetric overflow loss model
• Two-dimensional convolution algorithm for modelling multiservice networks with overflow traffic
• DOMAIN EXTENSIONS OF THE ERLANG LOSS FUNCTION: THEIR SCALABILITY AND ITS APPLICATIONS TO COOPERATIVE GAMES
• Reconfiguration of inpatient services to reduce bed pressure in hospitals
• The evergreen Erlang loss function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3882167)