Online scheduling of packets with agreeable deadlines

DOI10.1145/2390176.2390181MaRDI QIDQ2933633zbMATH OpenOpenAlexFDO

Authors Łukasz Jeż, Fei Li, Jay Sethuraman, 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

buffer managementcompetitive analysisonline 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)

Recommendations

• An optimal online algorithm for packet scheduling with agreeable deadlines
• Online packet scheduling with bounded delay and lookahead
• Online packet scheduling with bounded delay and lookahead
• Randomized algorithm for agreeable deadlines packet scheduling
• Online packet scheduling under adversarial errors
• scientific article; zbMATH DE number 1629972
• A comprehensive study of an online packet scheduling algorithm
• A comprehensive study of an online packet scheduling algorithm

Cited in

(35)

• Scheduling multipacket frames with frame deadlines
• Comparison-based buffer management in QoS switches
• Online packet scheduling for CIOQ and buffered crossbar switches
• Balanced scheduling toward loss-free packet queuing and delay fairness
• A -competitive algorithm for collecting items with increasing weights from a dynamic queue
• Collecting weighted items from a dynamic queue
• Online packet scheduling under adversarial errors
• Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
• Non-preemptive buffer management for latency sensitive packets
• Scheduling with deadlines and buffer management with processing requirements
• Online packet scheduling with bounded delay and lookahead
• Online scheduling FIFO policies with admission and push-out
• Scheduling weighted packets with deadlines over a fading channel
• An optimal online algorithm for packet scheduling with agreeable deadlines
• Optimizing throughput and energy in online deadline scheduling
• Better online buffer management
• Randomized algorithm for agreeable deadlines packet scheduling
• Buffer management for packets with processing times
• Scheduling multipacket frames with frame deadlines
• On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
• A comprehensive study of an online packet scheduling algorithm
• scientific article; zbMATH DE number 2080979 (Why is no real title available?)
• A Constant Approximation Algorithm for Scheduling Packets on Line Networks
• Packetized MPC with dynamic scheduling constraints and bounded packet dropouts
• Online packet scheduling with bounded delay and lookahead
• A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
• Online set packing and competitive scheduling of multi-part tasks
• A comprehensive study of an online packet scheduling algorithm
• A -competitive algorithm for scheduling packets with deadlines
• Lex-Optimal Online Multiclass Scheduling with Hard Deadlines
• Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• Online time-constrained scheduling in linear and ring networks
• Buffer management for colored packets with deadlines
• Approximation algorithms for time-constrained scheduling on line networks

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

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