Pages that link to "Item:Q2770076"
From MaRDI portal
The following pages link to Computing loss probabilities in discrete-time queues (Q2770076):
Displaying 13 items.
- Loss probability in an overloaded discrete-time \(GI/G/1/K\) system with very large \(K\). (Q703256) (← links)
- A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM (Q1302725) (← links)
- Loss probability in a finite discrete-time queue in terms of the steady state distribution of an infinite queue (Q1306532) (← links)
- On the calculation of steady-state loss probabilities in the \(GI/G/2/0\) queue (Q1344656) (← links)
- Order independent loss queues (Q1362323) (← links)
- The loss probability in an overloaded queue using the dual queue (Q1373465) (← links)
- Methods for reducing the amount of computation in modeling lossy communication systems based on ignoring low-probability states (Q1812386) (← links)
- A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline (Q1926998) (← links)
- Methods to reduce loss probability in systems with infinite service time dispersion (Q1995723) (← links)
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues (Q2175386) (← links)
- Cell loss probability for M/G/1 and time-slotted queues (Q2725314) (← links)
- Computational probability: Old ideas never die (Q3979301) (← links)
- Calculating the loss probability in a<i>BMAP/G/l/N</i>+1 queue (Q4895651) (← links)
