Competitive on-Line switching policies

DOI10.1007/S00453-003-1014-9MaRDI QIDQ1400895zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph (Seffi) Naor

Publication date 17 August 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-003-1014-9

zbMATH Keywords

On-line algorithmsPacket switching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Publication:4828978
• Competitive buffer management for shared-memory switches
• Algorithms – ESA 2004
• Maximizing throughput in multi-queue switches
• On queuing lengths in on-line switching

Cited in

(9)

• On queuing lengths in on-line switching
• Competitive analysis of constrained queueing systems
• scientific article; zbMATH DE number 2119707 (Why is no real title available?)
• Approximation and Online Algorithms
• Tight Analysis of Priority Queuing for Egress Traffic
• An experimental study of new and known online packet buffering algorithms
• Harmonic buffer management policy for shared memory switches
• The zero-one principle for switching networks
• Competitive buffer management for shared-memory switches

This page was built for publication: Competitive on-Line switching policies

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