On guaranteed smooth switching for buffered crossbar switches
IEEE/ACM Transactions on Networking (TON)
Fair bandwidth sharing using Shapley value
Proceedings of the 2008 Euro American Conference on Telematics and Information Systems
A combined fair scheduling algorithm for combined-input-crosspoint-queued switch
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Fair queueing based packet scheduling for buffered crossbar switches
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Distributed WFQ scheduling converging to weighted max-min fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
Load-balanced three-stage switch
Journal of Network and Computer Applications
Fair sampling across network flow measurements
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
An efficient single-iteration single-bit request scheduling algorithm for input-queued switches
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of certain kinds of denial-of-service attacks, and serve as a critical component of a quality-of-service strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. In this paper, we choose a popular notion of fairness called max-min fairness and provide a rigorous definition in the context of input-queued switches. We show that being fair at the output ports alone, or at the input ports alone, or even at both input and output ports, does not actually achieve overall max-min fair allocation of bandwidth in a switch. Instead, we propose a new algorithm that computes the exact max-min fair allocation of rates for the flows through the switch. In addition to proving the correctness of the algorithm, we show that it can be implemented in a distributed fashion at the input and output ports to determine the max-min fair rates. We further propose a practical scheduling strategy based on our algorithm and present simulation results, using both real traffic traces as well synthetic traffic, to evaluate the fairness of a variety of popular scheduling algorithms for input-queued switches. The results show that our scheduling strategy achieves better fairness than other known algorithms for input-queued switches and, in addition, achieves throughput performance very close to that of the best schedulers.