Scaling high-speed shared-memory switch fabric buffers

Abstract

A novel approach is presented for expanding the buffer size in a shared memory switch. Utilizing this two-tier buffering mechanism we present a two-level scheduling algorithm whose complexity is considerably lower than that of purely input scheduling algorithms. Furthermore, this approach easily provides differentiated qualities of service to different traffic classes while maintaining high throughput across the switch fabric.