A Min-Plus Calculus for End-to-End Statistical Service Guarantees
From MaRDI portal
Publication:3547996
Recommendations
- Minimizing loss probability in queuing systems with heterogeneous servers
- On providing blocking probability and throughput guarantees in a multi-service environment
- scientific article; zbMATH DE number 4001840
- Scaling properties of statistical end-to-end bounds in the network calculus.
- Lagrange dual bound computation for stochastic service network design
- scientific article; zbMATH DE number 220320
- Stochastic Machine Minimization with Constant Service Times
- scientific article; zbMATH DE number 4008082
Cited in
(13)- Asymptotic identity in min-plus algebra: a report on CPNS
- Dealing with dependence in stochastic network calculus -- using independence as a bound
- Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks
- Scaling properties of statistical end-to-end bounds in the network calculus.
- A computation method for providing statistical performance Guarantee to an ATM switch
- FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
- Conjugate network calculus: A dual approach applying the Legendre transform
- End-to-end delay estimation for multi-hop wireless networks with random access policy
- Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
- A general framework for deterministic service guarantees in telecommunication networks with variable length packets
- scientific article; zbMATH DE number 1950491 (Why is no real title available?)
- Concave piecewise linear service curves and deadline calculations
- Duality of the max-plus and min-plus network calculus
This page was built for publication: A Min-Plus Calculus for End-to-End Statistical Service Guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547996)
