On providing blocking probability and throughput guarantees in a multi-service environment

DOI10.1002/DAC.532zbMath0999.68012OpenAlexW1971281534MaRDI QIDQ4539914

Miklós Telek, Sándor Rácz, Gábor Fodor

Publication date: 11 July 2002

Published in: International Journal of Communication Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/dac.532

zbMATH Keywords

Internetthroughputblocking probabilitybandwidth sharing objectives

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Link capacity sharing between guaranteed- and best effort services on an ATM transmission link under GoS constraints
• Computation of the distribution of the completion time when the work requirement is a ph random variableThis work was supported in part by the US Office of Naval Research under Contract no. N3014-88-K-0623, by NASA under Grant NAG-1-70, and by the Italian National Research Council CNR under the project “Material and Devices for Solid State Electronics” Grant no. 86.02177.61.
• Blocking with retrials in a completely shared resource environment
• Numerical analysis of large Markov reward models

This page was built for publication: On providing blocking probability and throughput guarantees in a multi-service environment