Pages that link to "Item:Q5462801"
From MaRDI portal
The following pages link to An<i>RG</i>-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue (Q5462801):
Displaying 17 items.
- Analysis and computation of the stationary distribution in a special class of Markov chains of level-dependent \(\mathrm{M}/\mathrm{G}/1\)-type and its application to \(\mathrm{BMAP}/\mathrm{M}/\infty\) and \(\mathrm{BMAP}/\mathrm{M}/c+\mathrm{M}\) queues (Q333455) (← links)
- Processor sharing: a survey of the mathematical theory (Q927561) (← links)
- A tandem network with MAP inputs (Q935219) (← links)
- Performance analysis of two-loop closed production systems (Q947948) (← links)
- A new approach to the queue length and waiting time of \(BMAP/G/1\) queues. (Q1413832) (← links)
- An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue (Q1652138) (← links)
- Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline (Q1708522) (← links)
- The \(\text{BMAP}/\text{G}/1/\infty\) queue with the foreground-background processor-sharing discipline (Q1881887) (← links)
- Subexponential asymptotics of asymptotically block-Toeplitz and upper block-Hessenberg Markov chains (Q2095033) (← links)
- A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service (Q2144216) (← links)
- A sequential update algorithm for computing the stationary distribution vector in upper block-Hessenberg Markov chains (Q2281373) (← links)
- Departure processes and busy periods of a tandem network (Q2359524) (← links)
- The \(M/G/1\) processor-sharing queue with disasters (Q2475887) (← links)
- Computing the conditional stationary distribution in Markov chains of level-dependent M/G/1-type (Q4643640) (← links)
- Discriminatory Processor Sharing Queues and the DREB Method (Q5454667) (← links)
- A new matrix-infinite-product-form solution for upper block-Hessenberg Markov chains and its quasi-algorithmic constructibility (Q6043457) (← links)
- A study on \(N\)-policy \textit{BMAP/G/1} queueing system (Q6652681) (← links)