Adaptive CSFQ: determining the packet dropping probability adaptively for achieving fair bandwidth allocations in SCORE networks

Authors:
Masayoshi Nabeshima
Affiliations:
NTT Network Innovation Laboratories, NTT Corporation, 1-1, Hikari-no-oka Yokosuka-shi, Kanagawa, Japan
Venue:
Computer Communications
Year:
2003

Citing 9
Cited 1

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Congestion control and traffic management in ATM networks: recent advances and a survey

Computer Networks and ISDN Systems
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Explicit allocation of best-effort packet delivery service

IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
The Adaptive Load Service (ALS): An ABR-Like Service for the Internet

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Differentiated services: architecture, mechanisms and evaluation

Differentiated services: architecture, mechanisms and evaluation
Stateless core: a scalable approach for quality of service in the internet

Stateless core: a scalable approach for quality of service in the internet

Enhancement of fairness in a DiffServ network using a novel queuing algorithm

Computer Standards & Interfaces

Quantified Score

Hi-index	0.24

Visualization

Abstract

In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper proposes adaptive CSFQ (ACSFQ). The packet dropping probability in ACSFQ is determined adaptively based on the flow arrival rate, the fair share rate, and the current queue length. It well supports TCP flows as well as UDP flows. We compare ACSFQ to CSFQ in terms of fair bandwidth allocation. This paper also proposes how to identify and penalize unresponsive flows without managing their flow state. The method is simple to realize because only the packet dropping probability is changed.