Buffer Management for Packets with Processing Times

DOI10.1007/978-3-662-48350-3_5zbMath1369.68064OpenAlexW1541862318MaRDI QIDQ3452767

Oren Gilon, Yossi Azar

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_5

zbMATH Keywords

competitive analysisonline algorithmsdeadlinesbuffer managementjob scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Scheduling multipacket frames with frame deadlines ⋮ Online buffer management for transmitting packets with processing cycles ⋮ Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive buffer management with packet dependencies
• Improved competitive performance bounds for CIOQ switches
• An improved algorithm for CIOQ switches
• Competitive queue policies for differentiated services
• Speed is as powerful as clairvoyance
• Buffer Overflow Management in QoS Switches
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Optimal smoothing schedules for real-time streams (extended abstract)
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Algorithms – ESA 2004
• On the Performance of Greedy Algorithms in Packet Buffering
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing

This page was built for publication: Buffer Management for Packets with Processing Times