Online scheduling of packets with agreeable deadlines

DOI10.1145/2390176.2390181zbMath1301.68278OpenAlexW2000013497MaRDI QIDQ2933633

Jay Sethuraman, Fei Li, Łukasz Jeż, Clifford Stein

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2390176.2390181

zbMATH Keywords

competitive analysisbuffer managementonline algorithmpacket scheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Non-preemptive buffer management for latency sensitive packets ⋮ Comparison-based buffer management in QoS switches ⋮ Online packet scheduling for CIOQ and buffered crossbar switches ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead

This page was built for publication: Online scheduling of packets with agreeable deadlines