The zero-one principle for switching networks

DOI10.1145/1007352.1007369zbMath1192.68021OpenAlexW1990869735MaRDI QIDQ3580960

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)

Related Items (12)

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

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