An efficient stable recursion to compute multiservice blocking probabilities

DOI10.1016/S0166-5316(00)00042-0zbMath1047.68022MaRDI QIDQ4779299

Anthony Krzesinski, S. A. Berezner

Publication date: 24 June 2003

Published in: Performance Evaluation (Search for Journal in Brave)

zbMATH Keywords

quality of service

Mathematics Subject Classification ID

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

Related Items (1)

Methods for estimating the required volume of resource for multiservice access nodes

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