Pages that link to "Item:Q1785452"
From MaRDI portal
The following pages link to The $M/D/1+D$ queue has the minimum loss probability among $M/G/1+G$ queues (Q1785452):
Displaying 5 items.
- Analysis of \(M^{ X}/ G/1\) queues with impatient customers (Q725404) (← links)
- On some parallels between the loss probability in the GI/G/1 loss system and the delay probability in the GI/G/1 queue (Q1969767) (← links)
- Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue (Q2516778) (← links)
- A computational algorithm for the loss probability in the M/G/1+PH queue (Q2976124) (← links)
- Comparison results for M/G/1 queues with waiting and sojourn time deadlines (Q5226255) (← links)