Analytic Approximation of Blocking Probabilities in Circuit Switched Communication Networks

DOI10.1109/TCOM.1979.1094422MaRDI QIDQ4186242zbMATH OpenFDO

Authors Phillippe J. Deschamps

Publication date 1979

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCOM.1979.1094422

zbMATH Keywords

Analytic Approximation NetworksBlocking Probability EstimatesCircuit Switched Communication NetworksCovariancesExplicit Machine ComputationMathematical ProgrammingNetwork Dimensioning ProblemsOverflowTelecommunication NetworksTraffic Parcels

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Communication theory (94A05) Circuits, networks (94C99)

Cited in

(1)

• A polynomial-time algorithm for message routing in hierarchical communication networks

This page was built for publication: Analytic Approximation of Blocking Probabilities in Circuit Switched Communication Networks

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