Buffer management for colored packets with deadlines

DOI10.1007/S00224-011-9346-3MaRDI QIDQ693758zbMATH OpenOpenAlexFDO

Authors Yossi Azar, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra, Uriel Feige

Publication date 10 December 2012

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-011-9346-3

zbMATH Keywords

online algorithmsbuffer managementearliest deadline firstDRAM schedulingpackets scheduling

Mathematics Subject Classification ID

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

Recommendations

• Online scheduling of packets with agreeable deadlines
• Better online buffer management
• Algorithms – ESA 2004
• Bounded delay packet scheduling in a bounded buffer
• An optimal lower bound for buffer management in multi-queue switches

Cites work

• scientific article; zbMATH DE number 5485491 (Why is no real title available?)
• scientific article; zbMATH DE number 5764852 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1947443 (Why is no real title available?)
• scientific article; zbMATH DE number 2079410 (Why is no real title available?)
• Algorithms – ESA 2004
• An optimal online algorithm for packet scheduling with agreeable deadlines
• Automata, Languages and Programming
• Automata, Languages and Programming
• Better online buffer management
• Buffer Overflow Management in QoS Switches
• Competitive management of non-preemptive queues with multiple values
• Competitive queue policies for differentiated services
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Considering suppressed packets improves buffer management in QoS switches
• Evaluation of Online Strategies for Reordering Buffers
• Exploiting locality: Approximating sorting buffers
• Improved Online Algorithms for the Sorting Buffer Problem
• Improved competitive guarantees for QoS buffering
• LATIN 2004: Theoretical Informatics
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Nearly optimal FIFO buffer management for two packet classes.
• Offline Sorting Buffers on Line
• On approximating a scheduling problem
• Online Sorting Buffers on Line
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Online scheduling with partial job values: does timesharing or randomization help?
• STACS 2004
• STACS 2005

Cited in

(2)

• Non-preemptive buffer management for latency sensitive packets
• Dynamic traveling repair problem with an arbitrary time window

This page was built for publication: Buffer management for colored packets with deadlines

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