A joint moments based analysis of networks of MAP/MAP/1 queues

András Horvtáh, Gábor Horvtáh, Miklós Telek

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The decomposition based approximate numerical analysis of queueing networks of MAP/MAP/1 queues with FIFO scheduling is considered in this paper. One of the most crucial decisions of decomposition based queueing network analysis is the description of inter-node traffic. Utilizing recent results on Markov arrival processes (MAPs), we apply a given number of joint moments of the consecutive inter-event times to describe the inter-node traffic. This traffic description is compact (uses far less parameters than the alternative methods) and flexible (allows an easy reduction of the complexity of the model). Numerical examples demonstrate the accuracy and the computational complexity of the proposed approximate analysis method.

Original languageEnglish
Pages (from-to)759-778
Number of pages20
JournalPerformance Evaluation
Volume67
Issue number9
DOIs
Publication statusPublished - Sep 1 2010

    Fingerprint

Keywords

  • Joint moment
  • MAP/MAP/1 queue
  • Markov arrival process
  • Matrix geometric method
  • Queueing network

ASJC Scopus subject areas

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

Cite this