Performance bounds for scheduling queueing networks

DOI10.1214/AOAP/1177005711MaRDI QIDQ1198582zbMATH OpenOpenAlexFDO

Authors Jihong Ou, Lawrence M. Wein

Publication date 16 January 1993

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1177005711

zbMATH Keywords

simulationnumerical resultsschedulingqueueing networksperformance boundsnon- productform systems

Mathematics Subject Classification ID

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

Recommendations

• Performance bounds for queueing networks and scheduling policies
• New linear program performance bounds for queueing networks
• Simple bounds for closed queueing networks
• Two classes of performance bounds for closed queueing networks
• Bounds and error bounds for queueing networks

Cited in

(12)

• Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways
• scientific article; zbMATH DE number 1863256 (Why is no real title available?)
• Single-class bounds of multi-class queuing networks
• Scheduling and Control of Queueing Networks
• Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study
• Comparing LP Bounds for Queueing Networks
• Properties and performance bounds for closed free choice synchronized monoclass queueing networks
• The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
• Efficient Deadline-Based QoS Algorithms for High-Performance Networks
• Two classes of performance bounds for closed queueing networks
• Dynamic scheduling for queueing networks derived from discrete-review policies
• Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks

This page was built for publication: Performance bounds for scheduling queueing networks

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