Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches

Claus Bauer. Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches. In Alejandro López-Ortiz, Angèle M. Hamel, editors, Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers. Volume 3405 of Lecture Notes in Computer Science, pages 102-113, Springer, 2004. [doi]

Abstract

Abstract is missing.