Output models of MAP/PH/1(/K) queues for an efficient network decomposition

Armin Heindl, Miklós Telek

Research output: Contribution to journalConference article

17 Citations (Scopus)

Abstract

For non-trivial (open) queueing networks, traffic-based decomposition often represents the only feasible - and at the same time fast - solution method besides simulation. The network is partitioned into individual nodes which are analyzed in isolation with respect to approximate internal traffic representations. Since the correlations of network traffic may have a considerable impact on performance measures, they must be captured to some extent by the employed traffic descriptors. The decomposition methodology presented in this paper is based on Markovian arrival processes (MAPs), whose correlation structure is determined from the busy-period behavior of the upstream queues. The resulting compact MAPs in connection with sophisticated moment-matching techniques allow an efficient decomposition of large queueing networks. Numerical experiments demonstrate the substantially enhanced precision due to improved output models compared with the experiments of Heindl and Telek [MAP-based decomposition of tandem networks of ·/PH/1(/K) queues with MAP input, in: Proceedings of the 11th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems, Aachen, Germany, 2001, pp. 179-194].

Original languageEnglish
Pages (from-to)321-339
Number of pages19
JournalPerformance Evaluation
Volume49
Issue number1-4
DOIs
Publication statusPublished - Sep 1 2002
EventPerformance 2002 - Rome, Italy
Duration: Sep 23 2002Sep 27 2002

Keywords

  • Correlated departure-process approximation
  • MAP/PH/1(/K) queues
  • Markovian arrival processes
  • Queueing networks
  • Traffic-based decomposition

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Output models of MAP/PH/1(/K) queues for an efficient network decomposition'. Together they form a unique fingerprint.

  • Cite this