According to the characteristics of IEEE 802.16-2005, a minimum reserve d traffic rate based fair scheduling algorithm in IEEE 802.16-2005 is proposed in this paper. It can support multiple service types and guarantee every service´s minimum reserved traffic rate. A compensation strategy is introduced to ensure m inimum reserved traffic rate of service which is in bad channel condition. At th e same time, services which have higher priority and are in good channel conditi on are granted more bandwidth to ensure the QoS (quality of service) and maximiz e the throughput performance. The simulation study shows that the algorithm can guar antee the minimum reserved traffic rate and distinguish the services in differen t levels. Furthermore, the algorithm has advantages in both fairness and through p ut performance compared with PF (proportional fair) algorithm. The algorithm pro posed in this paper is in accordance with IEEE 802-16-2005 and has gre at value.