A universal randomized packet scheduling algorithm

DOI10.1007/S00453-012-9700-0zbMATH Open1307.68096OpenAlexW2014256412WikidataQ59303104 ScholiaQ59303104MaRDI QIDQ2017873FDOQ2017873

Authors Łukasz Jeż 

Publication date 23 March 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-012-9700-0

zbMATH Keywords

online algorithmscompetitive analysispacket schedulingadaptive adversarybuffer management with bounded delay

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Randomized algorithm for agreeable deadlines packet scheduling
• Randomized scheduling algorithm for queueing networks
• Randomized scheduling algorithm for input-queued switches
• A Constant Approximation Algorithm for Scheduling Packets on Line Networks
• Approximate sorting of packet-scheduling in high-speed networks
• STACS 2005
• scientific article; zbMATH DE number 2185540

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A comprehensive study of an online packet scheduling algorithm
• Algorithms – ESA 2004
• An optimal online algorithm for packet scheduling with agreeable deadlines
• Analysis of queueing policies in QoS switches
• Approximation and Online Algorithms
• Better online buffer management
• Buffer Overflow Management in QoS Switches
• Collecting weighted items from a dynamic queue
• Considering suppressed packets improves buffer management in QoS switches
• On the power of randomization in on-line algorithms
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Online scheduling with partial job values: does timesharing or randomization help?
• Randomized algorithm for agreeable deadlines packet scheduling
• Randomized competitive algorithms for online buffer management in the adaptive adversary model

Cited in

(9)

• Randomized two-valued bounded delay online buffer management
• One to rule them all: a general randomized algorithm for buffer management with bounded delay
• Randomized algorithm for agreeable deadlines packet scheduling
• A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• scientific article; zbMATH DE number 5855082 (Why is no real title available?)
• Non-preemptive buffer management for latency sensitive packets
• A simple livelock-free algorithm for packet switching
• STACS 2005

This page was built for publication: A universal randomized packet scheduling algorithm

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