Achieving Fairness in Generalized Processor Sharing for Network Switches

In Generalized Processor Sharing (GPS), the goal of the scheduler is to maximize the processor utilization, while maintaining a rate guarantee and fairness in the bandwidth allocation to each input stream according to the quality of service (QoS) criteria. While in the single server case, these requirements can be satisfied simultaneously by scheduling service rate according to a scale version of the rate request, the result does not generalize to the case when multiple processors are used. This paper extends the notion of max-min and proportional fairness for single node Generalized Processor Sharing in Network Switches (GPS-SW), and provides rate augmentation algorithms in achieving the two performance criteria