Technical Report: Efficient Buffering and Scheduling for a Single-Chip Crosspoint-Queued Switch
Zizhong Cao, Shivendra S. Panwar

TL;DR
This paper introduces efficient buffering and scheduling techniques for a single-chip crosspoint-queued switch, significantly improving buffer utilization and reducing packet drops under high load conditions.
Contribution
It proposes load balancing, deflection routing, and buffer pooling methods along with scheduling algorithms that maintain packet order, requiring modest hardware modifications.
Findings
Buffer utilization increased up to 10 times.
Packet drop rates reduced by 100 to 1000 times.
Achieved low cell drop rate of 10^-8 under high load with real traffic.
Abstract
The single-chip crosspoint-queued (CQ) switch is a compact switching architecture that has all its buffers placed at the crosspoints of input and output lines. Scheduling is also performed inside the switching core, and does not rely on latency-limited communications with input or output line-cards. Compared with other legacy switching architectures, the CQ switch has the advantages of high throughput, minimal delay, low scheduling complexity, and no speedup requirement. However, the crosspoint buffers are small and segregated, thus how to efficiently use the buffers and avoid packet drops remains a major problem that needs to be addressed. In this paper, we consider load balancing, deflection routing, and buffer pooling for efficient buffer sharing in the CQ switch. We also design scheduling algorithms to maintain the correct packet order even while employing multi-path switching and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Embedded Systems Design Techniques · Advancements in Battery Materials
