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

non- productform systemsnumerical resultsperformance boundsqueueing networksschedulingsimulation

Mathematics Subject Classification ID

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

Review text

Some general classes of multi-customer networks are compared with (partially very) simplified derivates. Roughly the idea is: Forget about those structures of the system which makes analysis complex and try to do this in a way such that the new model when run in parallel to the old one can be strictly compared either by pathwise comparison of the describing processes or by comparing the steady-state expectations of the performance measure. Some of the bounds and concerned numerical results are called ``moderately encouraging by the authors.

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

(14)

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