Buffer management for colored packets with deadlines

DOI10.1007/s00224-011-9346-3zbMath1253.68067OpenAlexW1997051975MaRDI QIDQ693758

Iftah Gamzu, Thomas Moscibroda, Yossi Azar, Prasad Raghavendra

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

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

Related Items (1)

Dynamic Traveling Repair Problem with an Arbitrary Time Window

Cites Work

• Improved competitive guarantees for QoS buffering
• Exploiting locality: Approximating sorting buffers
• Nearly optimal FIFO buffer management for two packet classes.
• Online scheduling with partial job values: does timesharing or randomization help?
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Competitive queue policies for differentiated services
• Improved Online Algorithms for the Sorting Buffer Problem
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Buffer Overflow Management in QoS Switches
• Evaluation of Online Strategies for Reordering Buffers
• STACS 2004
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Online Sorting Buffers on Line
• Offline Sorting Buffers on Line
• Algorithms – ESA 2004
• Automata, Languages and Programming
• STACS 2005
• Automata, Languages and Programming
• Distributed Computing
• LATIN 2004: Theoretical Informatics
• On approximating a scheduling problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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