A class of scheduling policies for mixed data with renewal arrival processes

DOI10.1109/9.210144MaRDI QIDQ4280049zbMATH OpenOpenAlexFDO

Authors Hakan Deliç, P. Papantoni-Kazakos

Publication date 24 February 1994

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

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

zbMATH Keywords

mutually independent traffic streamsnonpreemptive scheduling policiesrenewal processes

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
• Optimal multiplexing on a single link: delay and buffer requirements
• On Scheduling Policies for Streams of Structured Jobs
• Scheduling in multiclass networks with deterministic service times
• Throughput optimal scheduling policies in networks of constrained queues

Cited in

(1)

• On Scheduling Policies for Streams of Structured Jobs

This page was built for publication: A class of scheduling policies for mixed data with renewal arrival processes

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