A traffic based decomposition of two-class queueing networks with priority service

András Horváth, Gábor Horváth, M. Telek

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the input and internal traffic in the queueing network. The MMAP traffic description allows to capture not only the dependency structure of the traffic classes themselves, but also the inter-class dependency of the high and low priority traffic. To carry out MMAP based queueing network analysis the paper presents several contributions: the departure process analysis of the MMAP/MAP/1 priority queue, an MMAP construction method based on the joint moments of two consecutive inter-departure times and some new results towards the efficient performance analysis of the MMAP/MAP/1 priority queue. Numerical examples illustrate the accuracy of the proposed traffic based decomposition method.

Original languageEnglish
Pages (from-to)1235-1248
Number of pages14
JournalComputer Networks
Volume53
Issue number8
DOIs
Publication statusPublished - Jun 11 2009

Fingerprint

Queueing networks
Decomposition
Electric network analysis

Keywords

  • Marked Markov arrival process
  • MMAP/MAP/1 queue
  • Moments based analysis
  • Output process
  • Priority service

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

A traffic based decomposition of two-class queueing networks with priority service. / Horváth, András; Horváth, Gábor; Telek, M.

In: Computer Networks, Vol. 53, No. 8, 11.06.2009, p. 1235-1248.

Research output: Contribution to journalArticle

Horváth, András ; Horváth, Gábor ; Telek, M. / A traffic based decomposition of two-class queueing networks with priority service. In: Computer Networks. 2009 ; Vol. 53, No. 8. pp. 1235-1248.
@article{d49d93687ca24dd491db4ce976d0e0e1,
title = "A traffic based decomposition of two-class queueing networks with priority service",
abstract = "This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the input and internal traffic in the queueing network. The MMAP traffic description allows to capture not only the dependency structure of the traffic classes themselves, but also the inter-class dependency of the high and low priority traffic. To carry out MMAP based queueing network analysis the paper presents several contributions: the departure process analysis of the MMAP/MAP/1 priority queue, an MMAP construction method based on the joint moments of two consecutive inter-departure times and some new results towards the efficient performance analysis of the MMAP/MAP/1 priority queue. Numerical examples illustrate the accuracy of the proposed traffic based decomposition method.",
keywords = "Marked Markov arrival process, MMAP/MAP/1 queue, Moments based analysis, Output process, Priority service",
author = "Andr{\'a}s Horv{\'a}th and G{\'a}bor Horv{\'a}th and M. Telek",
year = "2009",
month = "6",
day = "11",
doi = "10.1016/j.comnet.2009.02.016",
language = "English",
volume = "53",
pages = "1235--1248",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "8",

}

TY - JOUR

T1 - A traffic based decomposition of two-class queueing networks with priority service

AU - Horváth, András

AU - Horváth, Gábor

AU - Telek, M.

PY - 2009/6/11

Y1 - 2009/6/11

N2 - This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the input and internal traffic in the queueing network. The MMAP traffic description allows to capture not only the dependency structure of the traffic classes themselves, but also the inter-class dependency of the high and low priority traffic. To carry out MMAP based queueing network analysis the paper presents several contributions: the departure process analysis of the MMAP/MAP/1 priority queue, an MMAP construction method based on the joint moments of two consecutive inter-departure times and some new results towards the efficient performance analysis of the MMAP/MAP/1 priority queue. Numerical examples illustrate the accuracy of the proposed traffic based decomposition method.

AB - This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the input and internal traffic in the queueing network. The MMAP traffic description allows to capture not only the dependency structure of the traffic classes themselves, but also the inter-class dependency of the high and low priority traffic. To carry out MMAP based queueing network analysis the paper presents several contributions: the departure process analysis of the MMAP/MAP/1 priority queue, an MMAP construction method based on the joint moments of two consecutive inter-departure times and some new results towards the efficient performance analysis of the MMAP/MAP/1 priority queue. Numerical examples illustrate the accuracy of the proposed traffic based decomposition method.

KW - Marked Markov arrival process

KW - MMAP/MAP/1 queue

KW - Moments based analysis

KW - Output process

KW - Priority service

UR - http://www.scopus.com/inward/record.url?scp=64049112577&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=64049112577&partnerID=8YFLogxK

U2 - 10.1016/j.comnet.2009.02.016

DO - 10.1016/j.comnet.2009.02.016

M3 - Article

AN - SCOPUS:64049112577

VL - 53

SP - 1235

EP - 1248

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 8

ER -