Nash equilibria as a fundamental issue concerning network-switches design

We view the 'packet-switching problem' (from N inputs towards N outputs) from the perspective of game theory and we prove that, if the rates of flows are weighed then 'weighed max-min fair service rates' are the unique Nash equilibrium point of a natural strategic game in which throughput is granted on a 'least-demanding first-served' principle. We prove that a crossbar switching device with suitably randomized schedulers converges to this equilibrium point without pre-computing it.

[1]  Tara Javidi,et al.  A high-throughput scheduling algorithm for a buffered crossbar switch fabric , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[2]  Manolis Katevenis,et al.  Transient Behavior of a Buffered Crossbar Converging to Weighted Max-Min Fairness , 2022 .

[3]  Dimitrios N. Serpanos,et al.  Two-dimensional round-robin schedulers for packet switches with multiple input queues , 1994, TNET.

[4]  P. Gács,et al.  Algorithms , 1992 .

[5]  Carsten Lund,et al.  Fair prioritized scheduling in an input-buffered switch , 1996 .

[6]  Thomas G. Robertazzi A Survey of Modern HighPerformance Switching Techniques , 1993 .

[7]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[8]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[9]  Hui Zhang,et al.  Implementing distributed packet fair queueing in a scalable switch architecture , 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.

[11]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[12]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

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

[14]  Manolis Katevenis,et al.  Weighted fairness in buffered crossbar scheduling , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[15]  Lixia Zhang VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[16]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[17]  A. Charny,et al.  Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[18]  Chienhua Chen,et al.  Service disciplines for guaranteed performance service , 1997, Proceedings Fourth International Workshop on Real-Time Computing Systems and Applications.

[19]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Herbert Gintis,et al.  Game Theory Evolving: A Problem-Centered Introduction to Modeling Strategic Interaction - Second Edition , 2009 .

[21]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[22]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[23]  Hamid Ahmadi,et al.  A survey of modern high-performance switching techniques , 1989, IEEE J. Sel. Areas Commun..