Multidimensional analogs of the Kendall equation for priority queueing systems: computational aspects

DOI10.1134/S0005117908060088MaRDI QIDQ1002980zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 26 February 2009

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117908060088

zbMATH Keywords

queueing systemsefficiency of the algorithmsKendall equation for busy periods

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Numerical treatment of the Kendall equation in the analysis of priority queueing systems
• Generalized priority systems. Analytical results and numerical algorithms
• Generalized priority models with ``look ahead strategy: numerical algorithms for busy periods
• Matrix algorithm for polling models with PH distribution
• Numerical \(k\)-busy periods algorithms for Polling systems with semi-Markov switching

Cites work

• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• scientific article; zbMATH DE number 3069542 (Why is no real title available?)
• Comparison of sequence accelerators for the Gaver method of numerical Laplace transform inversion
• Solving probability transform functional equations for numerical inversion

Cited in

(3)

• Generalized priority systems. Analytical results and numerical algorithms
• Generalized priority models with ``look ahead strategy: numerical algorithms for busy periods
• Numerical treatment of the Kendall equation in the analysis of priority queueing systems

This page was built for publication: Multidimensional analogs of the Kendall equation for priority queueing systems: computational aspects

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