Product form queueing network model in computer system analysis
Conference
·
OSTI ID:6617072
The queueing network model based on Gordon and Newell's classical work, generalized to allow multiple customer classes and several processing disciplines, was further generalized, and inherent limitations of the model were established. The properties of abstract queues and queueing networks that were found to yield the product form network solution are a general class of queueing disciplines, arrival-rate tradeoffs between queues (load-dependent routing), and processing tradeoffs between queues. Also, the relationship between the ''local balance'' and the ''Poisson departure'' properties of queues was clarified. These results, and their implications for further generalizations of the model, are described.
- Research Organization:
- Brookhaven National Lab., Upton, NY (USA)
- DOE Contract Number:
- EY-76-C-02-0016
- OSTI ID:
- 6617072
- Report Number(s):
- BNL-23998; CONF-780214-2
- Country of Publication:
- United States
- Language:
- English
Similar Records
Conditions for product form network solution through the analysis of finite queues with overflows
Analysis of discrete-time queues for random output processes and network solutions
Multiple customer-class LBPS queueing discipline. [Last Batch/Processor Sharing]
Conference
·
Sat Dec 31 23:00:00 EST 1977
·
OSTI ID:6750085
Analysis of discrete-time queues for random output processes and network solutions
Conference
·
Fri Dec 31 23:00:00 EST 1976
·
OSTI ID:7210327
Multiple customer-class LBPS queueing discipline. [Last Batch/Processor Sharing]
Conference
·
Sun Dec 31 23:00:00 EST 1978
·
OSTI ID:6219149