An efficient stable recursion to compute multiservice blocking probabilities

DOI10.1016/S0166-5316(00)00042-0MaRDI QIDQ4779299zbMATH OpenFDO

Authors S. A. Berezner, Anthony Krzesinski

Publication date 24 June 2003

Published in Performance Evaluation (Search for Journal in Brave)

zbMATH Keywords

quality of service

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems
• Computational algorithms for blocking probabilities in circuit-switched networks
• Efficient blocking probability computation of complex traffic flows for network dimensioning
• An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models
• Computing blocking probabilities in multiclass wavelength routing networks

Cited in

(9)

• Call–burst blocking and call admission control in a broadband network with bursty sources
• Methods for estimating the required volume of resource for multiservice access nodes
• Computing blocking probabilities in multiclass wavelength routing networks
• On providing blocking probability and throughput guarantees in a multi-service environment
• Efficient blocking probability computation of complex traffic flows for network dimensioning
• Static and dynamic evaluation of QoS properties
• Computational algorithms for blocking probabilities in circuit-switched networks
• scientific article; zbMATH DE number 2088599 (Why is no real title available?)
• Recurrent Method for Blocking Probability Calculation in Multi-service Switching Networks with BPP Traffic

This page was built for publication: An efficient stable recursion to compute multiservice blocking probabilities

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