Computational complexity of loss networks

DOI10.1016/0304-3975(94)90293-3zbMath0795.68096MaRDI QIDQ1318715

Michael Mitzenmacher, F. P. Kelly, Graham Louth

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90293-3

zbMATH Keywords

blocking probabilities; loss network; loss partition

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

90B22: Queues and service in operations research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• Random generation of combinatorial structures from a uniform distribution
• Some observations on the probabilistic algorithms and NP-hard problems
• Loss networks
• Effective bandwidths at multi-class queues
• Computational algorithms for blocking probabilities in circuit-switched networks
• Parallel concepts in graph theory
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Teletraffic engineering for product-form circuit-switched networks
• Approximating the Permanent
• Insensitivity of blocking probabilities in a circuit-switching network
• Monte Carlo Summation Applied to Product-Form Loss Networks
• On the capacity of disjointly shared networks
• Probabilistic Models of Database Locking
• The Complexity of Enumeration and Reliability Problems
• Efficient decomposition methods for the analysis of multi-facility blocking models
• Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking