Pages that link to "Item:Q3122536"
From MaRDI portal
The following pages link to A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution (Q3122536):
Displaying 5 items.
- An analytical solution for the discrete time single server system with semi-Markovian arrivals (Q1339091) (← links)
- New approach for finding basic performance measures of single server queue (Q1667387) (← links)
- Point and interval estimation of decomposition error in discrete-time open tandem queues (Q2084028) (← links)
- Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique (Q5462811) (← links)
- A numerical method to determine the waiting time and the idle time distributions of a <i>GI/G/</i>1 queue when inter-arrival times and/or service times have geometric tails (Q5884366) (← links)
