Controlling Overload in a Digital System
From MaRDI portal
Cites work
- A Proof for the Queuing Formula: L = λW
- scientific article; zbMATH DE number 3174016 (Why is no real title available?)
- scientific article; zbMATH DE number 3456264 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 3449577 (Why is no real title available?)
- scientific article; zbMATH DE number 3320030 (Why is no real title available?)
- scientific article; zbMATH DE number 3338194 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- Matrix eigensystem routines - EISPACK guide
- Queues with Periodic Service and Changeover Time
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
This page was built for publication: Controlling Overload in a Digital System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960116)