Best Effort and Priority Queuing Policies for Buffered Crossbar Switches

Abstract

The buffered crossbar switch architecture has recently gained considerable research attention. In such a switch, besides normal input and output queues, a small buffer is associated with each crosspoint. Due to the introduction of crossbar buffers, output and input contention is eliminated, and the scheduling process is greatly simplified. We analyze the… (More)
DOI: 10.1007/978-3-540-69355-0_15

Topics

4 Figures and Tables

Cite this paper

@article{Kesselman2008BestEA, title={Best Effort and Priority Queuing Policies for Buffered Crossbar Switches}, author={Alexander Kesselman and Kirill Kogan and Michael Segal}, journal={Chicago J. Theor. Comput. Sci.}, year={2008}, volume={2012} }