Nonstationary analysis of the queueing network with bypass of systems of multi-type and absolute priority messages

DOI10.17512/JAMCM.2013.1.10MaRDI QIDQ530110zbMATH OpenOpenAlexFDO

Authors Mikhail Matalytski, Victor Naumenko

Publication date 9 June 2017

Published in Journal of Applied Mathematics and Computational Mechanics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.17512/jamcm.2013.1.10

zbMATH Keywords

generating functionabsolute priorityconditional probabilities of transitionsmulti-type messages bypass of systemsprobability statessystem of difference-differential equations

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Nonstationary analysis of a queueing network with positive and negative messages
• Investigation of G-network with signals at transient behavior
• Queueing networks with several demand types, immediate service, and node bypassing by demands
• Queueing networks with dynamic routing and dynamic stochastic bypass of nodes
• Approximating nonstationary two-priority non-preemptive queueing systems

Cites work

• Nonstationary analysis of a queueing network with positive and negative messages

Cited in

(3)

• Finding nonstationary state probabilities of open Markov networks with multiple classes of customers and various features
• Investigation of G-network with signals at transient behavior
• Nonstationary analysis of a queueing network with positive and negative messages

This page was built for publication: Nonstationary analysis of the queueing network with bypass of systems of multi-type and absolute priority messages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530110)