Maximal weight matching scheme with frame occupancy-based for input-queued packet switches

Virtual output queues (VOQs) is widely used by input-queued (IQ) switches to eliminate the head-of-line (HOL) blocking phenomenon that limits matching and switching performance. It has been shown that IQ switches can provide 100% throughput under admissible traffic when using maximum-weight matching schemes or iterative maximal-weight matching schemes with a speedup of two or more. These different approaches require either a high computation complexity or large resolution times for high-speed switches. Therefore, there is a need for low-complexity and fast matching schemes that provide high throughput under several admissible traffic patterns, including those with nonuniform distributions, without recurring to speedup nor multiple iterations. We proposed earlier weightless matching schemes based on the captured-frame concept for IQ switches to provide high throughput under uniform and nonuniform traffic patterns, when using a single iteration and no speedup. In this paper, we proposed to use the capture-frame concept in weighted matching schemes and show that performance improvement can be achieved. We apply this concept to the longest-queue first (LQF) selection to create the unlimited LQF (uFLQF) schemes. We show via simulation that uFLQF achieves high throughput under uniform and nonuniform traffic patterns with a single iteration.

[1]  Panayotis Antoniadis,et al.  FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Ge Nong,et al.  Performance evaluation of multiple input-queued ATM switches with PIM scheduling under bursty traffic , 2001, IEEE Trans. Commun..

[3]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[4]  Roberto Rojas-Cessa,et al.  Captured-frame matching schemes for scalable input-queued packet switches , 2007, Comput. Commun..

[5]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[6]  Ying Jiang,et al.  A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[7]  Shivendra S. Panwar,et al.  The dual round robin matching switch with exhaustive service , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[8]  Ying Jiang,et al.  A 2-stage matching scheduler for a VOQ packet switch architecture , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[9]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[10]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[11]  David W. Petr,et al.  Input-queued switch based on a scheduling algorithm , 1995 .

[12]  Hung-Hsiang Jonathan Chao,et al.  Centralized contention resolution schemes for a large-capacity optical ATM switch , 1998, 1998 IEEE ATM Workshop Proceedings. 'Meeting the Challenges of Deploying the Global Broadband Network Infrastructure' (Cat. No.98EX164).

[13]  Nirwan Ansari,et al.  Input-queued switching with QoS guarantees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Roberto Rojas-Cessa,et al.  Captured-frame eligibility and round-robin matching for input-queued packet switches , 2004, IEEE Communications Letters.

[15]  R. Rojas-Cessa,et al.  CIXB-1: combined input-one-cell-crosspoint buffered switch , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

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

[17]  H. Jonathan Chao,et al.  A dual-level matching algorithm for 3-stage Clos-network packet switches , 2003, 11th Symposium on High Performance Interconnects, 2003. Proceedings..

[18]  Andrea Bianco,et al.  Frame-based matching algorithms for input-queued switches , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[19]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[20]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[21]  Mounir Hamdi,et al.  Static round-robin dispatching schemes for Clos-network switches , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.