Pages that link to "Item:Q2899110"
From MaRDI portal
The following pages link to Triangular \(M/G/1\)-type and tree-like quasi-birth-death Markov chains (Q2899110):
Displaying 13 items.
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward (Q475108) (← links)
- QBD Markov chains on binomial-like trees and its application to multilevel feedback queues (Q928194) (← links)
- To clean or not to clean: malware removal strategies for servers under load (Q2030611) (← links)
- On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue (Q2176360) (← links)
- A polling system with `join the shortest -- serve the longest' policy (Q2337379) (← links)
- Fitting correlated arrival and service times and related queueing performance (Q2397977) (← links)
- A non-inverse general matrix analytical solution method (Q2770813) (← links)
- A comparative analysis of the successive lumping and the lattice path counting algorithms (Q2804417) (← links)
- Modeling load and overwork effects in queueing systems with adaptive service rates (Q2830763) (← links)
- The snowball effect of customer slowdown in critical many-server systems (Q3186004) (← links)
- EXPLICIT SOLUTIONS FOR CONTINUOUS-TIME QBD PROCESSES BY USING RELATIONS BETWEEN MATRIX GEOMETRIC ANALYSIS AND THE PROBABILITY GENERATING FUNCTIONS METHOD (Q5051927) (← links)
- ANALYSIS OF A CLEARING QUEUEING SYSTEM WITH SERVER MAINTENANCE AFTER <i>N</i> NEGATIVE FEEDBACKS (Q5056613) (← links)
- DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS (Q5358035) (← links)
