An optimal algorithm for 2-bounded delay buffer management with lookahead

DOI10.1016/J.TCS.2021.10.005MaRDI QIDQ5925532zbMATH OpenOpenAlexFDO

Authors Koji M. Kobayashi

Publication date 18 November 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.00121

zbMATH Keywords

competitive analysislookaheadonline buffer managementquality of servicescheduling algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• An optimal algorithm for 2-bounded delay buffer management with lookahead
• Online packet scheduling with bounded delay and lookahead
• Online packet scheduling with bounded delay and lookahead
• Randomized Algorithms for Buffer Management with 2-Bounded Delay
• Bounded delay packet scheduling in a bounded buffer

Cites work

• A -competitive algorithm for collecting items with increasing weights from a dynamic queue
• A competitive analysis of the list update problem with lookahead
• A universal randomized packet scheduling algorithm
• An optimal online algorithm for packet scheduling with agreeable deadlines
• Analysis of queueing policies in QoS switches
• Buffer Overflow Management in QoS Switches
• Collecting weighted items from a dynamic queue
• Competitive queue policies for differentiated services
• Considering suppressed packets improves buffer management in quality of service switches
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2079410 (Why is no real title available?)
• scientific article; zbMATH DE number 910900 (Why is no real title available?)
• Improved online algorithms for buffer management in QoS switches
• On competitive on-line paging with lookahead
• On the influence of lookahead in competitive paging algorithms
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Online packet scheduling with bounded delay and lookahead
• Online packet scheduling with bounded delay and lookahead
• Online scheduling of packets with agreeable deadlines
• Online Scheduling with Lookahead: Multipass Assembly Lines
• Online scheduling with partial job values: does timesharing or randomization help?
• Randomized algorithm for agreeable deadlines packet scheduling
• Randomized competitive algorithms for online buffer management in the adaptive adversary model
• STACS 2004

Cited in

(5)

• Online packet scheduling with bounded delay and lookahead
• Randomized two-valued bounded delay online buffer management
• Randomized Algorithms for Buffer Management with 2-Bounded Delay
• Online packet scheduling with bounded delay and lookahead
• An optimal algorithm for 2-bounded delay buffer management with lookahead

This page was built for publication: An optimal algorithm for 2-bounded delay buffer management with lookahead

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