Randomized competitive algorithms for online buffer management in the adaptive adversary model
type: Item
instance of: scholarly article
title: Randomized competitive algorithms for online buffer management in the adaptive adversary model
zbMATH Open document ID: 1222.68048
author: Marcin Bienkowski
author: Marek Chrobak
author: Łukasz Jeż
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5955874
zbMATH Keywords: packet scheduling
zbMATH Keywords: online scheduling
zbMATH Keywords: buffer management
zbMATH Keywords: competitive analysis
zbMATH Keywords: adaptive adversary
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.05.015
OpenAlex ID: W2134822363
cites work: Buffer Overflow Management in QoS Switches
cites work: Q4223058
cites work: On the power of randomization in on-line algorithms
cites work: Q2934599
cites work: Q4471370
cites work: Online scheduling with partial job values: does timesharing or randomization help?
cites work: Online competitive algorithms for maximizing weighted throughput of unit jobs
cites work: Algorithms – ESA 2004
cites work: Analysis of queueing policies in QoS switches
cites work: Approximation and Online Algorithms
cites work: An optimal online algorithm for packet scheduling with agreeable deadlines
DOI: 10.1016/J.TCS.2011.05.015
description: scientific article; zbMATH DE number 5955874