New scheduling mechanisms which efficiently utilize policing for GFR service

This paper proposes new scheduling mechanisms for meeting fairness criteria which are not met by conventional scheduling mechanisms such as weighted round robin (WRR). These proposed mechanisms utilize the arrival of untagged cells at an ATM switch not only for a frame drop policy but also for deciding which VC cell is eligible to be serviced. The guaranteed frame rate (GFR) service using the proposed mechanisms can provide the users with bandwidth allocation which meets several fairness criteria.