Comparison-based buffer management in QoS switches

DOI10.1007/s00453-017-0393-2zbMath1391.68011OpenAlexW3164287526MaRDI QIDQ1742380

Matthias Englert, Kamal Al-Bawani, Matthias Westermann

Publication date: 11 April 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/94270/7/WRAP-comparison-based-buffer-Englert-2017.pdf

zbMATH Keywords

competitive analysisonline algorithmsquality of servicebuffer managementcomparison-basednetwork switches

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized competitive algorithms for online buffer management in the adaptive adversary model
• Improved competitive guarantees for QoS buffering
• Lower and upper bounds on FIFO buffer management in QoS switches
• Randomized competitive algorithms for the list update problem
• Online scheduling with partial job values: does timesharing or randomization help?
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Online scheduling of packets with agreeable deadlines
• Competitive queue policies for differentiated services
• Analysis of queueing policies in QoS switches
• Serving in the Dark should be done Non-Uniformly
• The zero-one principle for switching networks
• Randomized Algorithms for Buffer Management with 2-Bounded Delay
• Buffer Overflow Management in QoS Switches
• Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
• Algorithms – ESA 2004
• Automata, Languages and Programming
• The loss of serving in the dark
• Distributed Computing

This page was built for publication: Comparison-based buffer management in QoS switches