TY - GEN
T1 - Designing packet buffers in high-bandwidth switches and routers
AU - Lin, Dong
AU - Hamdi, Mounir
AU - Muppala, Jogesh
PY - 2010
Y1 - 2010
N2 - High-speed routers rely on well-designed packet buffers that support multiple queuing, large capacity and short response times. Some researchers suggested a combined SRAM/DRAM hierarchical buffer architecture to meet these challenges. However, both the SRAM and DRAM need to maintain a large number of dynamic queues which is a real challenge in practice and limits the scalability of these approaches. In this paper, we present a scalable, efficient and novel distributed packet buffer architecture. Two fundamental issues need to be addressed to make this feasible: (a) how to design scalable packet buffers using independent buffer subsystems; and (b) how to dynamically balance the workload among multiple buffer subsystems without any blocking. We address these issues by first designing a basic framework that allows flows to dynamically switch from one subsystem to another without any blocking. Based on this framework, we further devise a load-balancing algorithm to meet the overall system requirements. Both theoretical analysis and experimental results demonstrate that our load-balancing algorithm and the distributed packet buffer architecture can easily scale to meet the buffering needs of high bandwidth links with large number of active connections.
AB - High-speed routers rely on well-designed packet buffers that support multiple queuing, large capacity and short response times. Some researchers suggested a combined SRAM/DRAM hierarchical buffer architecture to meet these challenges. However, both the SRAM and DRAM need to maintain a large number of dynamic queues which is a real challenge in practice and limits the scalability of these approaches. In this paper, we present a scalable, efficient and novel distributed packet buffer architecture. Two fundamental issues need to be addressed to make this feasible: (a) how to design scalable packet buffers using independent buffer subsystems; and (b) how to dynamically balance the workload among multiple buffer subsystems without any blocking. We address these issues by first designing a basic framework that allows flows to dynamically switch from one subsystem to another without any blocking. Based on this framework, we further devise a load-balancing algorithm to meet the overall system requirements. Both theoretical analysis and experimental results demonstrate that our load-balancing algorithm and the distributed packet buffer architecture can easily scale to meet the buffering needs of high bandwidth links with large number of active connections.
KW - Memory hierarchy
KW - Packet buffer
UR - http://www.scopus.com/inward/record.url?scp=78149237600&partnerID=8YFLogxK
U2 - 10.1109/HPSR.2010.5580285
DO - 10.1109/HPSR.2010.5580285
M3 - Conference contribution
AN - SCOPUS:78149237600
SN - 9781424469710
T3 - 2010 International Conference on High Performance Switching and Routing, HPSR 2010
SP - 32
EP - 37
BT - 2010 International Conference on High Performance Switching and Routing, HPSR 2010
T2 - 2010 International Conference on High Performance Switching and Routing, HPSR 2010
Y2 - 13 June 2010 through 16 June 2010
ER -