1986
DOI: 10.2307/3214135
|View full text |Cite
|
Sign up to set email alerts
|

Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers

Abstract: Approximation expressions for the server utilization factor of each server in a heterogeneous-server G/G/n queueing loss system with ordered entry are derived. The system is assumed to face a stationary counting process. Service times are generally distributed with possibly different service rates. The numerical results from this approximation method are then compared with those from a simulation study.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
2
0

Year Published

1987
1987
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(3 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Nath and Enns (1981) [22] showed that the overflow (loss) is minimal for M/Mi/c under the faster service rule. Pourbabai and Sonderman (1986) [23] studied approximate expressions of the heterogeneous server G/G/n.…”
Section: Introductionmentioning
confidence: 99%
“…Nath and Enns (1981) [22] showed that the overflow (loss) is minimal for M/Mi/c under the faster service rule. Pourbabai and Sonderman (1986) [23] studied approximate expressions of the heterogeneous server G/G/n.…”
Section: Introductionmentioning
confidence: 99%
“…Nath and Enns (1981) [22] proved that the overflow (loss) is minimal for M/Mi/c under the faster service rule. Pourbabai and Sonderman (1986) [23] studied approximate expressions of heterogeneous server G/G/n.…”
Section: Introductionmentioning
confidence: 99%
“…In [1], devoted to the study of QHS models, a Markovian infinite-queue system is studied, in which one of the free servers is assigned to service jobs of equal probability (this scheme is called randomized access). An analysis of the available literature has shown that the vast majority of studies investigate QHS models, which adopt randomized access schemes [1][2][3] and ordered access schemes [4][5][6][7][8]. An overview of these studies can be found in [9,10].…”
Section: Introductionmentioning
confidence: 99%