Stratified round Robin a low complexity packet scheduler with bandwidth fairness and bounded delay.
Fair queuing is a well-studied problem in modern computer networks. However, there remains a gap between scheduling algorithms that have provably good performance, and those that are feasible and practical to implement in high speed routers. In this paper, we propose a novel packet scheduler called...
| Publicat a: | Computer communication review. 33, 4 (2003). |
|---|---|
| Autor principal: | |
| Format: | Article |
| Idioma: | English |
| Matèries: |