Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A Multi-color Marking Scheme to Achieve Fair Bandwidth Allocation
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Achieving Per-Flow Fair Rate Allocation within Diffserv
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
| Hi-index | 0.00 |
Core Stateless Fair Queueing (CSFQ) is a scalable mechanism to provide per-flow fairness in high-speed networks in that it does not need to maintain per-flow state in the core routers. This is possible because the state for each flow is encoded as special labels inside each packet. In this paper, we propose and evaluate by simulations two improvements to CSFQ. First, we show that CSFQ does not provide a fair service when some links are not congested. Our first improvement solves this issue. Second, we propose an algorithm to allow CSFQ to provide a service with a minimum guaranteed bandwidth and evaluate its performance with TCP traffic.