Efficient blocking probability computation of complex traffic flows for network dimensioning

DOI10.1016/j.cor.2007.02.009zbMath1278.90060OpenAlexW2105324273MaRDI QIDQ925826

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

network designnetwork optimizationblocking probabilitylink utilizationmultirate trafficnetwork dimensioning

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Analysis of bandwidth allocation on end-to-end QoS networks under budget control ⋮ Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains ⋮ Estimating the loss probability under heavy traffic conditions ⋮ Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling

Cites Work

• A nonstationary offered-load model for packet networks
• Concentration inequalities for functions of independent variables
• Bounds on conditional probabilities with applications in multi-user communication
• A sharp concentration inequality with applications
• Unnamed Item
• Unnamed Item
• Unnamed Item

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