Collecting weighted items from a dynamic queue

DOI10.1007/s00453-011-9574-6zbMath1277.68299OpenAlexW1974319951MaRDI QIDQ1939667

Grzegorz Stachowiak, Marcin Bienkowski, Łukasz Jeż, Mathilde Hurand, Marek Chrobak, Christoph Dürr, Artur Jeż

Publication date: 5 March 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9574-6

zbMATH Keywords

competitive analysisonline algorithmsbuffer managementpacket scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (3)

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ A universal randomized packet scheduling algorithm ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved competitive guarantees for QoS buffering
• An optimal deterministic algorithm for online \(b\)-matching
• Online scheduling with partial job values: does timesharing or randomization help?
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay
• AdWords and generalized online matching
• Efficient communications using the meteor-burst channel
• Buffer Overflow Management in QoS Switches

This page was built for publication: Collecting weighted items from a dynamic queue