1985
DOI: 10.1016/0026-2714(85)90393-2
|View full text |Cite
|
Sign up to set email alerts
|

A queueing problem with random memory arrivals and heterogeneous servers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…Computer programs are developed to determine the optimal allocation of storage spaces among three heterogeneous servers, by calculating the bounds of sizes of finite sources for different traffic intensities [12]. Particular cases of the steady-state behaviour of a discrete-time queueing problem with S heterogeneous groups with a discipline FCFS and a limited waiting space were analysed in [13,14]; a set of heterogeneous and exponential servers were discussed in [15]. El-Taha and Stidham [16], using deterministic (sample-path) analysis, generalized and extended the fundamental properties of systems with "stationary deterministic flows".…”
Section: Introductionmentioning
confidence: 99%
“…Computer programs are developed to determine the optimal allocation of storage spaces among three heterogeneous servers, by calculating the bounds of sizes of finite sources for different traffic intensities [12]. Particular cases of the steady-state behaviour of a discrete-time queueing problem with S heterogeneous groups with a discipline FCFS and a limited waiting space were analysed in [13,14]; a set of heterogeneous and exponential servers were discussed in [15]. El-Taha and Stidham [16], using deterministic (sample-path) analysis, generalized and extended the fundamental properties of systems with "stationary deterministic flows".…”
Section: Introductionmentioning
confidence: 99%