Buffer management for colored packets with deadlines

DOI10.1007/S00224-011-9346-3zbMATH Open1253.68067OpenAlexW1997051975MaRDI QIDQ693758FDOQ693758

Iftah Gamzu, Thomas Moscibroda, Yossi Azar, 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

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

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)

Cites Work

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

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)