Abstract
We propose a token-bucket based rate control algorithm that satisfies both maximum and minimum rate constraints with computational complexity of O(1). The proposed algorithm allocates the remaining bandwidth in a strict priority queuing manner to the flows with different priorities and in a weighted fair queuing manner to the flows within the same priority.
| Original language | English |
|---|---|
| Pages (from-to) | 1623-1626 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Communications |
| Volume | E91-B |
| Issue number | 5 |
| DOIs | |
| State | Published - 2008 |
Keywords
- Maximum sustained rate
- Minimum reserved rate
- Quality of service
- Rate control
- Token bucket