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.

[1]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[2]  Cheng-Shang Chang,et al.  Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets , 2008, IEEE Transactions on Communications.

[3]  Cheng-Shang Chang,et al.  On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[4]  Yanming Shen,et al.  Byte-focal: a practical load balanced switch , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

[5]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[6]  Jan-Ray Liao,et al.  Longest queue first in round-robin matching for input-queued switches , 2010, 2010 International Symposium On Information Theory & Its Applications.

[7]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Weibo Gong,et al.  A Three-Stage Load-Balancing Switch , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[9]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..

[10]  Kwan Lawrence Yeung,et al.  D-LQF: An Efficient Distributed Scheduling Algorithm for Input-Queued Switches , 2011, 2011 IEEE International Conference on Communications (ICC).

[11]  Cheuk H. Lam,et al.  Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches , 1997, IEEE J. Sel. Areas Commun..

[12]  Ying Jiang,et al.  Selective-Request Round-Robin Scheduling for VOQ Packet Switch Architecture , 2011, 2011 IEEE International Conference on Communications (ICC).

[13]  Tony T. Lee,et al.  Principles of Broadband Switching and Networking , 2010 .

[14]  Tony T. Lee,et al.  Statistical performance guarantees in large-scale cross-path packet switch , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.