A framework for differential frame-based matching algorithms in input-queued switches

We propose a novel framework to solve the problem of scheduling packets in high-speed input-queued switches with frame-based control. Our approach is based on the application of game theory concepts. We define a flexible scheduling policy, named SSB (slot sell and buy): the existence of a unique Nash equilibrium for the policy is proved, together with properties of convergence of these equilibria. These findings allows us to state that our SSB scheduling policy achieves 100% throughput both in isolated input-queued switches arid in networks of input-queued switches. Simulation results are used to further validate the approach and to show its flexibility in dealing with differentiated QoS guarantees.

[1]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[2]  Lisa Zhang,et al.  Achieving stability in networks of input-queued switches , 2003, TNET.

[3]  Andrea Francini,et al.  A novel highly-scalable matching policy for input-queued switches with multiclass traffic , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[4]  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).

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

[6]  Marco Ajmone Marsan,et al.  On the throughput achievable by isolated and interconnected input-queueing switches under multiclass traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[8]  Prashanth Pappu,et al.  Distributed queueing in scalable high performance routers , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  H. Jonathan Chao,et al.  Saturn: a terabit packet switch using dual round-robin , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[10]  Paolo Giaccone,et al.  Towards simple, high-performance schedulers for high-aggregate bandwidth switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

[13]  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.

[14]  Suresh Chalasani,et al.  An Incremental Algorithm for TDM Switching Assignments in Satellite and Terrestrial Networks , 1992, IEEE J. Sel. Areas Commun..

[15]  Marco Ajmone Marsan,et al.  On the stability of local scheduling policies in networks of packet switches with input queues , 2003, IEEE J. Sel. Areas Commun..

[16]  Joseph Yu Hui,et al.  Switching and Traffic Theory for Integrated Broadband Networks , 1990 .