The zero-one principle for switching networks

DOI10.1145/1007352.1007369MaRDI QIDQ3580960zbMATH OpenOpenAlexFDO

Authors Yossi Richter, Yossi Azar

Publication date 15 August 2010

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Recommendations

• Approximation and Online Algorithms
• Competitive on-Line switching policies
• scientific article; zbMATH DE number 2119707
• An improved algorithm for CIOQ switches
• A generalization of the 0-1 principle for sorting

Cited in

(13)

• Bounded delay packet scheduling in a bounded buffer
• Improved competitive performance bounds for CIOQ switches
• Buffer management of multi-queue QoS switches with class segregation
• Bounded incentives in manipulating the probabilistic serial rule
• Tight Analysis of Priority Queuing for Egress Traffic
• Serving in the dark should be done non-uniformly
• Maximizing throughput in multi-queue switches
• The loss of serving in the dark
• Competitive buffer management with packet dependencies
• Comparison-based buffer management in QoS switches
• Online packet scheduling for CIOQ and buffered crossbar switches
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
• Switched networks and complementarity

This page was built for publication: The zero-one principle for switching networks

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