Pages that link to "Item:Q1127250"
From MaRDI portal
The following pages link to Approximate analysis for queueing networks with finite capacity and customer loss (Q1127250):
Displaying 14 items.
- Queueing network \(\text{MAP}-(G I / \infty)^K\) with high-rate arrivals (Q323304) (← links)
- Nonstationary analysis of the loss queue and of queueing networks of loss queues (Q1041950) (← links)
- Approximate method of design of open nonexponential queueing networks of finite capacity with losses or blocking (Q1094768) (← links)
- Analysis of a finite-source customer assignment model with no state information (Q1298752) (← links)
- Approximate analysis of networks of PH\(|\)PH\(| 1| K\) queues with customer losses: Test results (Q1385367) (← links)
- Customer-oriented finite perturbation analysis for queueing networks (Q1581035) (← links)
- A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes (Q1698901) (← links)
- Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system (Q1728292) (← links)
- Parametric nonlinear programming for analyzing fuzzy queues with finite capacity (Q1877060) (← links)
- The unobserved waiting customer approximation (Q2070681) (← links)
- Approximate analysis of non-stationary loss queues and networks of loss queues with general service time distributions (Q2275803) (← links)
- Queueing models of certain manufacturing cells under product-mix sequencing rules (Q2475824) (← links)
- An Approximation Method for Blocking Probabilities in M/D/1/K<sub>1</sub>→ ⋅/D/1/K<sub>2</sub>Queues (Q5265458) (← links)
- Buffer allocation in flow-shop-type production systems with general arrival and service patterns (Q5955474) (← links)
