Studying an overload system using rotation
From MaRDI portal
Publication:1582573
For a Markov process \(\{X(t)\}\) with state space \(\{0,1,\dots, K\}\), the authors define the rotated version by \(Y_t= K-X_t\). This concept is then generalized to a semi-Markov setting where also the state space may be unbounded in one direction and includes boundary modifications as well as supplementary variables similar to phases. The analysis is used in particular to revisit a duality result by \textit{V. Ramaswami} and \textit{M. F. Neuts} [Ann. Probab. 8, 974-985 (1980; Zbl 0449.60066)].
Recommendations
Cites work
- A duality theorem for phase type queues
- A duality theorem for the matrix paradigms in queueing theory
- A unified algorithm for computing the stationary queue length distributions in M(k)/G/1/N and GI/M(k)/1/N queues
- Comments on duality of queues with finite buffer size
- Duality in Truncated Steady-State Erlang Distribution-Based Queueing Processes
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3491997 (Why is no real title available?)
- scientific article; zbMATH DE number 194776 (Why is no real title available?)
- Letter to the Editor—Duality of Finite Markovian Queues
- Moment formulas for the Markov renewal branching process
- On the maximum of the queue GI/M/1
- Probabilistic interpretations of some duality results for the matrix paradigms in queueing theory
- The loss probability in an overloaded queue using the dual queue
This page was built for publication: Studying an overload system using rotation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582573)