Birkhoff-von-Neumann Switches with Deflection-Compensated Mechanism
Jinghui Zhang, Tong Ye, Tony T. Lee, Fangfang Yan, and Weisheng Hu

TL;DR
This paper introduces a deflection-compensated Birkhoff-von-Neumann switch architecture that maintains high throughput and low delay under bursty traffic by offsetting buffer overflow through intelligent deflections.
Contribution
It proposes a novel deflection scheme for BvN switches that effectively handles bursty traffic, ensuring near 100% throughput and minimal delay jitter.
Findings
Supports close to 100% throughput with bursty traffic
Reduces average delay and delay jitter
Negligible packet out-of-sequence probability
Abstract
Despite the high throughput and low complexity achieved by input scheduling based on Birkhoff-von-Neumann (BvN) decomposition; the performance of the BvN switch becomes less predictable when the input traffic is bursty. In this paper, we propose a deflection-compensated BvN (D-BvN) switch architecture to enhance the quasi-static scheduling based on BvN decomposition. The D-BvN switches provide capacity guarantee for virtual circuits (VCs) and deflect bursty traffic when overflow occurs. The deflection scheme is devised to offset the excessive buffer requirement of each VC when input traffic is bursty. The design of our conditional deflection mechanism is based on the fact that it is unlikely that the traffic input to VCs is all bursty at the same time; most likely some starving VCs have spare capacities when some other VCs are in the overflow state. The proposed algorithm makes full use…
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 · Low-power high-performance VLSI design · Advanced Memory and Neural Computing
