Improved online algorithms for buffer management in QoS switches
From MaRDI portal
Publication:4962690
DOI10.1145/1290672.1290687zbMath1445.68039OpenAlexW2010459659MaRDI QIDQ4962690
Wojciech Jawor, Jiří Sgall, Tomas Tichý, Marek Chrobak
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1290672.1290687
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (6)
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Non-preemptive buffer management for latency sensitive packets ⋮ A near-optimal memoryless online algorithm for FIFO buffering two packet classes ⋮ Online packet scheduling with bounded delay and lookahead ⋮ The loss of serving in the dark ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead
This page was built for publication: Improved online algorithms for buffer management in QoS switches
