Max-Min Fairness in Input-Queued Switches

Madhusudan Hosaagrahara, Harish Sethu · 2005

This paper describes an algorithm that computes the maxmin fair allocation of rates for flows through an input-queued switch. The algorithm is provably max-min fair and can be implemented in a distributed fashion to dynamically determine flow rates.

Read the paper · More papers on PaperTik