Pages that link to "Item:Q1115029"
From MaRDI portal
The following pages link to Simple bounds and monotonicity results for finite multi-server exponential tandem queues (Q1115029):
Displaying 19 items.
- Simple performance estimates and error bounds for slotted ALOHA loss systems (Q751481) (← links)
- Exact analysis of a two-workstation one-buffer flow line with parallel unreliable machines (Q1014956) (← links)
- Approximate uniformization for continuous-time Markov chains with an application to performability analysis (Q1190175) (← links)
- On product form approximations for communication networks with losses: Error bounds (Q1197751) (← links)
- Performance bounds on multiserver exponential tandem queues with finite buffers (Q1207541) (← links)
- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines (Q1268222) (← links)
- The M/M/c with critical jobs (Q1298763) (← links)
- Upper and lower bounds for the waiting time in the symmetric shortest queue system (Q1315342) (← links)
- Open finite queueing networks with \(M/M/C/K\) parallel servers (Q1317076) (← links)
- Buffer allocation for an integer nonlinear network design problem (Q1362945) (← links)
- Error bounds on a practical approximation for finite tandem queues (Q1382810) (← links)
- Buffer allocation for a class of nonlinear stochastic knapsack problems (Q1904725) (← links)
- Erlang loss bounds for OT-ICU systems (Q2269499) (← links)
- A Simple Performability Estimate for Jackson Networks with an Unreliable Output Channel (Q2808293) (← links)
- GENERALIZED CLASS [script C] MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS (Q3444650) (← links)
- Stochastic Bounds for Queueing Systems with Multiple On–Off Sources (Q4950707) (← links)
- PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS (Q5070869) (← links)
- (Q5389859) (← links)
- (Q5687690) (← links)