Modeling and dynamic scheduling of a queueing system with blocking and starvation

DOI10.1109/26.44203zbMATH Open0689.90035OpenAlexW1979106745MaRDI QIDQ3032052FDOQ3032052

Authors: Rodolfo A. Milito, Hanoch Levy 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1109/26.44203

Recommendations

• Dynamic Scheduling of a Four-Station Queueing Network
• Dynamic routing for computer queueing networks
• scientific article; zbMATH DE number 4072676
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
• Control and scheduling in a two-station queueing network: Optimal policies and heuristics

zbMATH Keywords

hybrid systemoptimal policyfinite queuesstarvationcomputer communication networkheuristic decision rule

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) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (7)

• Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
• Title not available (Why is that?)
• Scheduling arrivals to queues for minimum average blocking: The \(S(n)/M/C/C\) system
• THE CONTROL OF STARVATION
• Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity
• Modeling the blocking phenomenon of service facilities
• Admit or preserve? Addressing server failures in cloud computing task management

This page was built for publication: Modeling and dynamic scheduling of a queueing system with blocking and starvation

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