In scheduling data packets over the network, queue service disciplines are used to determine service priority, delay bound, jitter bound and bandwidth. Among them the Weighted Round Robin (WRR) technique has provided the most reasonable performance in guaranteeing both bandwidth and fairness requirements. WRR, however, fails to accommodate various end-to-end delays and jitter bounds. We propose a new WRR algorithm, called Rate-controlled Frame-based Weighted Round Robin (RFWRR) which guarantees the delay jitter bound and satisfies a diverse set of delay requirements. The proposed algorithm divides the scheduler into two components: a rate controller and a frame-based WRR server. The rate controller controls delay jitters by reshaping traffic patterns while the WRR server assigns priorities to the packets in order to meet various delay requirements. The RFWRR has a simple hardware implementation and provides a constant buffer space. We also show that it can be effectively applied to the various traffic classes of the ATM networks.