Decomposition-based queueing network analysis with FiFiQueues
bookPart
In this chapter we present an overview of decomposition-based analysis techniques for large open queueing networks. We present a general decompositionbased solution framework, without referring to any particular model class, and propose a general fixed-point iterative solution method for it. We concretize this framework bydescribing the well-known QNA method,as proposedby Whitt in the early 1980s, in that context, before describing our FiFiQueues approach. FiFiQueues allows for the efficient analysis of large open queueing networks of which the interarrival and service time distributions are of phase-type; individual queues, all with single servers, can have bounded or unboundedbuffers.Next to an extensive evaluation with generally very favorable results for FiFiQueues, we also present a theorem on the existence of a fixed-point solution for FiFiQueues.
TNO Identifier
954290
ISSN
08848289
Publisher
Springer New York LLC
Source title
International Series in Operations Research and Management Science
Pages
643-699
Files
To receive the publication files, please send an e-mail request to TNO Repository.