Conditional expected sojourn times in insensitive queueing systems and networks

DOI10.2307/1427346MaRDI QIDQ5185814zbMATH OpenOpenAlexFDO

Authors Uwe Jansen

Publication date 1984

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1427346

zbMATH Keywords

insensitivity propertyservice schemesstationary marked point processsteady state distributions

Mathematics Subject Classification ID

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

Recommendations

• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• scientific article; zbMATH DE number 994727
• Conditional sojourn times of processor-sharing queues
• Exact transient expectations for queueing networks
• Tail behavior of conditional sojourn times in processor-sharing queues
• Sojourn times in queuing networks with multiserver modes
• Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis
• On sojourn time in Jackson networks of queues
• scientific article; zbMATH DE number 19242
• An approximation model for sojourn time distributions in acyclic multi-server queueing networks

Cited in

(6)

• Processor-sharing queues: Some progress in analysis
• Insensitivity of multiclass systems with general dynamic preemptive resume queueing disciplines
• Mathematical problems in the theory of processor-sharing queueing systems
• scientific article; zbMATH DE number 4137158 (Why is no real title available?)
• scientific article; zbMATH DE number 19242 (Why is no real title available?)
• Processor sharing: a survey of the mathematical theory

This page was built for publication: Conditional expected sojourn times in insensitive queueing systems and networks

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