Performance bounds for queues via generating functions

DOI10.1109/9.898706zbMATH Open1017.90020DBLPjournals/tac/HordijkS01OpenAlexW2001557906WikidataQ59313620 ScholiaQ59313620MaRDI QIDQ4540199FDOQ4540199

Authors: Arie Hordijk, Adam Shwartz 

Publication date: 21 July 2002

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/691d3e89540e5ac3a9946eca00c884d7f253bd54

Recommendations

• New linear program performance bounds for closed queueing networks
• New linear program performance bounds for queueing networks
• Performance bounds for queueing networks and scheduling policies
• scientific article; zbMATH DE number 4079146
• Performance bounds for nonhomogeneous queues

zbMATH Keywords

busy periodslinear bounds

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Cited In (2)

• Analysing Multiprogramming Queues by Generating Functions
• Efficient generation of performance bounds for a class of traffic scheduling problems

This page was built for publication: Performance bounds for queues via generating functions

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