A novel weighted round robin scheduling scheme for differentiated service networks is presented in the paper. When the network is congested

the weight of each service class can be changed adaptively according to the different priority

and the relative fairness for all priority service classes is maintained meanwhile. The simulation result indicates that the scheme can deal with the data bursts and network congestion well

and is moderate for the best effort service.