Abstract
A novel weighted round robin scheduling scheme for differentiated service networks is presented. The weight of each service class can be changed according to the current network conditions. This scheme maintains fairness for all priority service classes. It can be applied in congestion pricing as well as other scenarios.
| Original language | English |
|---|---|
| Pages (from-to) | 333-335 |
| Number of pages | 3 |
| Journal | Electronics Letters |
| Volume | 39 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jan 2003 |