Bandwidth Allocation with Preemption

DOI10.1137/S0097539797321237MaRDI QIDQ4268843zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber

Publication date 28 October 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539797321237

zbMATH Keywords

bandwidth allocationcall admissioncall controlonline algorithmspreemption

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1263238
• Tight bounds for bandwidth allocation on two links
• scientific article; zbMATH DE number 1559582
• Allocating Bandwidth for Bursty Connections

Cited in

(9)

• Resource allocation in bounded degree trees
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Preemptive and delay-based mechanisms to provide preference to emergency traffic
• scientific article; zbMATH DE number 1263238 (Why is no real title available?)
• scientific article; zbMATH DE number 1966221 (Why is no real title available?)
• scientific article; zbMATH DE number 1559582 (Why is no real title available?)
• Dynamic storage allocation with known durations
• A combinatorial flow-based formulation for temporal bin packing problems
• On-line scheduling of multi-core processor tasks with virtualization

This page was built for publication: Bandwidth Allocation with Preemption

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