Decomposition-based queueing network analysis with FiFiQueues


Share/Save/Bookmark

Sadre, Ramin and Haverkort, Boudewijn R. (2011) Decomposition-based queueing network analysis with FiFiQueues. In: Queueing Networks: A Fundamental Approach. International Series in Operations Research & Management Science, 154 . Springer Science + Business Media, New York, pp. 643-699. ISBN 9781441964717

[img]
Preview
PDF
432Kb
Abstract: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 by describing the well-known QNA method, as proposed byWhitt 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 unbounded buffers. 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.
Item Type:Book Section
Copyright:© 2011 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75077
Official URL:http://dx.doi.org/10.1007/978-1-4419-6472-4_15
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page