Infinitesimal perturbation analysis for queueing networks with general service time distributions

DOI10.1023/A:1019193711052zbMATH Open0948.90042OpenAlexW197150619MaRDI QIDQ1294076FDOQ1294076

Bernd Heidergott

Publication date: 10 September 2000

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019193711052

zbMATH Keywords

simulationqueueing theoryperturbation analysisqueueing networkssample path analysisinfinitesimal perturbation analysisservice time distributionsdiscrete components commuting conditionseparability of real-valued random variables

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)

Cited In (3)

• Analysis of queuing networks with arbitrarily distributed parameters
• Analysing sojourn times in queueing networks: A structural approach.
• Customer-oriented finite perturbation analysis for queueing networks

   Recommendations

• Bias properties of infinitesimal perturbation analysis for systems with parallel servers 👍 👎
• Infinitesimal perturbation analysis of a queueing system with bursty traffic 👍 👎
• Strong consistency of infinitesimal perturbation analysis for tandem queueing networks 👍 👎
• Sample path properties of the G/D/\(m\) queue 👍 👎

This page was built for publication: Infinitesimal perturbation analysis for queueing networks with general service time distributions

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