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

DOI10.1109/26.44203zbMath0689.90035OpenAlexW1979106745MaRDI QIDQ3032052

Hanoch Levy, Rodolfo A. Milito

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

zbMATH Keywords

hybrid systemoptimal policyfinite queuesstarvationcomputer communication networkheuristic decision rule

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue ⋮ 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