Few buffers suffice: Explaining why and how crossbars with weighted fair queuing converge to weighted max-min fairness

We explain why and how a crossbar switch with weighted fair queues (a deterministic device) converges to weighted max-min fair rates of service. Based on a plausible technical hypothesis we prove that a small mean number of buffers suffices to this end. WMMF-rates comprise the unique Nash equilibrium of a natural switching game—a fact that supports further their use.

[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]  Carsten Lund,et al.  Fair prioritized scheduling in an input-buffered switch , 1996 .

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

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

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

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

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

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

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

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

[11]  Lixia Zhang.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

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

[13]  George F. Georgakopoulos.  Nash equilibria as a fundamental issue concerning network-switches design , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

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