Buffer overflow management in QoS switches

DOI10.1145/380752.380847zbMATH Open1323.68053OpenAlexW1994408974WikidataQ131114869 ScholiaQ131114869MaRDI QIDQ5176010FDOQ5176010

Maxim Sviridenko, Alex Kesselman, Baruch Schieber, Boaz Patt-Shamir, Zvi Lotker, Yishay Mansour

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380847

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited In (12)

• Harmonic buffer management policy for shared memory switches
• Resource Management in Large Networks
• Analysis of queueing policies in QoS switches
• Buffer size requirements under longest queue first
• Buffer management of multi-queue QoS switches with class segregation
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Maximizing throughput in multi-queue switches
• Prompt Mechanisms for Online Auctions
• Title not available (Why is that?)
• Competitive router scheduling with structured data
• Buffer Overflow Management in QoS Switches
• Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time

This page was built for publication: Buffer overflow management in QoS switches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176010)