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
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
online algorithmscompetitive analysispacket schedulingadaptive adversarybuffer management with bounded delay
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)
Cites Work
- Title not available (Why is that?)
- Buffer Overflow Management in QoS Switches
- On the power of randomization in on-line algorithms
- Online scheduling with partial job values: does timesharing or randomization help?
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- An optimal online algorithm for packet scheduling with agreeable deadlines
- Better online buffer management
- Considering suppressed packets improves buffer management in QoS switches
- Randomized algorithm for agreeable deadlines packet scheduling
- Analysis of queueing policies in QoS switches
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
- Algorithms – ESA 2004
- Approximation and Online Algorithms
- Collecting weighted items from a dynamic queue
- A comprehensive study of an online packet scheduling algorithm
Cited In (9)
- Non-preemptive buffer management for latency sensitive packets
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
- Randomized two-valued bounded delay online buffer management
- STACS 2005
- Title not available (Why is that?)
- A simple livelock-free algorithm for packet switching
- One to rule them all: a general randomized algorithm for buffer management with bounded delay
- Randomized algorithm for agreeable deadlines packet scheduling
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)
