A max-algebra approach to modeling and simulation of tandem queueing systems
From MaRDI portal
(Redirected from Publication:1900303)
Abstract: Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems theory, and it is determined by a transition matrix inherent in the system. The departure epochs of a customer from the queues are considered as state variables, whereas its service times are assumed to be system parameters. We show how transition matrices may be calculated from the service times, and present the matrices associated with particular models. We also give a representation of system performance measures including the system time and the waiting time of customers, associated with the models. As an application, both serial and parallel simulation procedures are presented, and their performance is outlined.
Recommendations
Cites work
- A recursive equations based representation for the \(G/G/m\) queue
- scientific article; zbMATH DE number 434729 (Why is no real title available?)
- scientific article; zbMATH DE number 4167810 (Why is no real title available?)
- scientific article; zbMATH DE number 43693 (Why is no real title available?)
- Minimax algebra
- Minimax algebra and applications
- Unbiased estimates for gradients of stochastic network performance measures
- Using max-algebra linear models in the representation of queueing systems
Cited in
(8)- Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm
- scientific article; zbMATH DE number 3848383 (Why is no real title available?)
- scientific article; zbMATH DE number 4207905 (Why is no real title available?)
- Max-algebra description, stability and perturbation analysis of cyclic queue network
- Using max-algebra linear models in the representation of queueing systems
- On the exponentiality of stochastic linear systems under the max-plus algebra
- An approximation method for blocking probabilities in \(M/D/1/K_{1} \to \cdot /D/1/K_{2}\) queues
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
This page was built for publication: A max-algebra approach to modeling and simulation of tandem queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900303)