Product Form Queueing Network Model in Computer System Analysis

摘要

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. (ERA citation 04:004906)