Scaling high-speed shared-memory switch fabric
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.
Publication Source (Journal or Book title)
2001 IEEE Workshop on High Performance Switching and Routing
Hedge, M., & Naraghi-Pour, M. (2001). Scaling high-speed shared-memory switch fabric. 2001 IEEE Workshop on High Performance Switching and Routing, 281-286. Retrieved from https://digitalcommons.lsu.edu/eecs_pubs/1069