Randomized algorithm for agreeable deadlines packet scheduling

DOI10.4230/LIPICS.STACS.2010.2479MaRDI QIDQ3113774zbMATH OpenOpenAlexFDO

Authors Łukasz Jeż

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_631e.html

zbMATH Keywords

buffer managementonline algorithmsscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online scheduling of packets with agreeable deadlines
• A universal randomized packet scheduling algorithm
• A -competitive algorithm for scheduling packets with deadlines
• Scheduling with deadlines and buffer management with processing requirements
• Online packet scheduling with bounded delay and lookahead

Cited in

(6)

• Online buffer management for transmitting packets with processing cycles
• A universal randomized packet scheduling algorithm
• Online scheduling of packets with agreeable deadlines
• scientific article; zbMATH DE number 5855082 (Why is no real title available?)
• An optimal lower bound for buffer management in multi-queue switches
• An optimal algorithm for 2-bounded delay buffer management with lookahead

This page was built for publication: Randomized algorithm for agreeable deadlines packet scheduling

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