A universal randomized packet scheduling algorithm

DOI10.1007/s00453-012-9700-0zbMath1307.68096OpenAlexW2014256412WikidataQ59303104 ScholiaQ59303104MaRDI QIDQ2017873

Ł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

competitive analysisonline algorithmspacket schedulingadaptive adversarybuffer management with bounded delay

Mathematics Subject Classification ID

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

Related Items (4)

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Non-preemptive buffer management for latency sensitive packets ⋮ Randomized two-valued bounded delay online buffer management ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead

Cites Work

• Randomized competitive algorithms for online buffer management in the adaptive adversary model
• On the power of randomization in on-line algorithms
• Online scheduling with partial job values: does timesharing or randomization help?
• Collecting weighted items from a dynamic queue
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Randomized Algorithm for Agreeable Deadlines Packet Scheduling.
• Analysis of queueing policies in QoS switches
• Buffer Overflow Management in QoS Switches
• A Comprehensive Study of an Online Packet Scheduling Algorithm
• Algorithms – ESA 2004
• Approximation and Online Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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