Pages that link to "Item:Q319322"
From MaRDI portal
The following pages link to Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time (Q319322):
Displayed 11 items.
- An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue (Q1652138) (← links)
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization (Q2031356) (← links)
- Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance (Q2065489) (← links)
- The setting and optimization of quick queue with customer loss (Q2190285) (← links)
- Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process (Q2283256) (← links)
- Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline (Q2307283) (← links)
- Taylor-series approximations for queues with arrival correlation (Q2310526) (← links)
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method:<i>GI</i>/<i>C</i>-<i>MS</i><i>P</i><sup>(<i>a,b</i>)</sup><i>/</i>1<i>/</i>∞ (Q2826663) (← links)
- Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: BMAP/Gn(a,b)/1 (Q5092674) (← links)
- Computational analysis of \(GI^{[X]}/D-MSP^{(a,b)}/1\) queueing system via \textit{RG}-factorization (Q6046970) (← links)
- Stationary joint distribution of a discrete-time group-arrival and batch-size-dependent service queue with single and multiple vacation (Q6106247) (← links)