Decomposition-Based Queueing Network Analysis with FiFiQueues

Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 154)

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

Nite Bini 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Centre for Telematics and Information Technology Faculty of Electrical EngineeringMathematics and Computer ScienceEnschedeThe Netherlands
  2. 2.Embedded Systems InstituteEindhovenNetherlands

Personalised recommendations