Decomposition-Based Queueing Network Analysis with FiFiQueues

Ramin Sadre () and Boudewijn R. Haverkort ()
Additional contact information
Ramin Sadre: Mathematics and Computer Science
Boudewijn R. Haverkort: Mathematics and Computer Science

Chapter 15 in Queueing Networks, 2011, pp 643-699 from Springer

Abstract: 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 alarrival 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.

Keywords: Arrival Rate; Queue Length; Service Time Distribution; Request Rate; Disk Access (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-6472-4_15

Ordering information: This item can be ordered from
http://www.springer.com/9781441964724

DOI: 10.1007/978-1-4419-6472-4_15

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().