Buffer management for packets with processing times

DOI10.1007/978-3-662-48350-3_5MaRDI QIDQ3452767zbMATH OpenOpenAlexFDO

Authors 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

buffer managementcompetitive analysisdeadlinesjob schedulingonline algorithms

Mathematics Subject Classification ID

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

Recommendations

• Scheduling with deadlines and buffer management with processing requirements
• Online buffer management for transmitting packets with processing cycles
• Online scheduling of packets with agreeable deadlines
• An optimal lower bound for buffer management in multi-queue switches
• An optimal lower bound for buffer management in multi-queue switches

Cites work

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

Cited in

(7)

• Scheduling multipacket frames with frame deadlines
• Online buffer management for transmitting packets with processing cycles
• Non-preemptive buffer management for latency sensitive packets
• Scheduling with deadlines and buffer management with processing requirements
• Dynamic buffering
• Managing Latency and Buffer Requirements in Processing Graph Chains
• Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.

This page was built for publication: Buffer management for packets with processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452767)