Efficient blocking probability computation of complex traffic flows for network dimensioning

DOI10.1016/J.COR.2007.02.009MaRDI QIDQ925826zbMATH OpenOpenAlexFDO

Authors Andras Farago

Publication date 23 May 2008

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2007.02.009

zbMATH Keywords

blocking probabilitylink utilizationmultirate trafficnetwork designnetwork dimensioningnetwork optimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• An efficient stable recursion to compute multiservice blocking probabilities
• Fast simulation of blocking probabilities in loss networks
• On evaluation of the blocking probability in multiwave time division multiplexing networks
• Blocking probabilities for large multirate erlang loss systems
• Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems

Cites work

• A nonstationary offered-load model for packet networks
• A sharp concentration inequality with applications
• Bounds on conditional probabilities with applications in multi-user communication
• Concentration inequalities for functions of independent variables
• scientific article; zbMATH DE number 3950178 (Why is no real title available?)
• scientific article; zbMATH DE number 932439 (Why is no real title available?)
• Multiservice loss models for broadband telecommunication networks

Cited in

(8)

• Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling
• An efficient stable recursion to compute multiservice blocking probabilities
• Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains
• Accuracy analysis of two CISCO network re-dimensioning methods
• Calculation of traffic flow breakdown probability to optimize link throughput
• Analysis of bandwidth allocation on end-to-end QoS networks under budget control
• A cyclic non-homogeneous Markov chain model for resource availability optimization in a two-parking lots system with priority classes and resource reservation
• Estimating the loss probability under heavy traffic conditions

This page was built for publication: Efficient blocking probability computation of complex traffic flows for network dimensioning

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