Optimal smoothing schedules for real-time streams (extended abstract)
From MaRDI portal
Publication:5176768
DOI10.1145/343477.343511zbMath1314.68412OpenAlexW2143773862MaRDI QIDQ5176768
Ofer Lapid, Boaz Patt-Shamir, Yishay Mansour
Publication date: 3 March 2015
Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/343477.343511
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)
Related Items
Measuring the impact of adversarial errors on packet scheduling strategies ⋮ Harmonic buffer management policy for shared memory switches ⋮ Buffer Management for Packets with Processing Times ⋮ Essential Traffic Parameters for Shared Memory Switch Performance ⋮ Scheduling with deadlines and buffer management with processing requirements ⋮ Competitive buffer management with packet dependencies ⋮ Online buffer management for transmitting packets with processing cycles ⋮ Competitive router scheduling with structured data ⋮ Lower and upper bounds on FIFO buffer management in QoS switches ⋮ Buffer management of multi-queue QoS switches with class segregation
