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

DOI10.1016/j.comnet.2009.02.016zbMath1163.60042OpenAlexW1970256302WikidataQ62048470 ScholiaQ62048470MaRDI QIDQ1018879

Miklós Telek, Gábor Horváth, Andras Horvath

Publication date: 26 May 2009

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2009.02.016

zbMATH Keywords

output processpriority servicemarked Markov arrival processMMAP/MAP/1 queuemoments based analysis

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (5)

Markovian Approximations for a Grid Computing Network with a Ring Structure ⋮ Efficient analysis of the MMAP[\(K\)/PH[\(K\)]/1 priority queue] ⋮ Analysis of the adaptive \(MMAP[K/PH[K]/1\) queue: a multi-type queue with adaptive arrivals and general impatience] ⋮ Compact Markov-modulated models for multiclass trace fitting ⋮ Approximate Transient Analysis of Queuing Networks by Quasi Product Forms

This page was built for publication: A traffic based decomposition of two-class queueing networks with priority service