Online buffer management for transmitting packets with processing cycles

DOI10.1016/j.tcs.2018.02.035zbMath1390.68162OpenAlexW2789885788MaRDI QIDQ1708032

Yi-Hua Yang, Xin Han, Chung-Shou Liao, Louxin Zhang

Publication date: 4 April 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.02.035

zbMATH Keywords

competitive analysisbuffer managementonline schedulingrun-to-completion

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Online scheduling FIFO policies with admission and push-out
• Searching in the plane
• Scheduling packets with values and deadlines in size-bounded buffers
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Randomized Algorithm for Agreeable Deadlines Packet Scheduling.
• Buffer Management for Packets with Processing Times
• Buffer Overflow Management in QoS Switches
• FIFO Queueing Policies for Packets with Heterogeneous Processing
• Competitive buffer management for shared-memory switches
• Optimal smoothing schedules for real-time streams
• Optimal smoothing schedules for real-time streams (extended abstract)

This page was built for publication: Online buffer management for transmitting packets with processing cycles