Deflection-compensated Birkhoff-von-Neumann switches

Although the quasi-static scheduling based on Birkhoff-von-Neumann (BvN) decomposition can achieve high throughput with low operational complexity, its performance becomes less predictable when the input traffic is bursty. In this paper, we propose a deflection-compensated BvN (D-BvN) switch to enhance the performance. The D-BvN switch provides capacity guarantee for each virtual circuit (VC) by the BvN decomposition of average input traffic matrix, while copes with traffic burst by deflection. In particular, deflection scheme fully utilizes the spare capacity of starving VCs to deflect overflow traffic to other VCs and provide bandwidth for deflection traffic to re-access its desired VC. Analytical and simulation results show that it can achieve close to 100% throughput of offered load and the packet out-of-sequence probability is also negligible.