Adaptive CSFQ: a new fair queuing mechanism for SCORE networks

Author

Nabeshima, Masayoshi

Author_Institution

NTT Network Innovation Labs., NTT Corp., Kanagawa, Japan

fYear

2002

fDate

2002

Firstpage

37

Lastpage

41

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.

Keywords

adaptive systems; bandwidth allocation; packet switching; probability; queueing theory; telecommunication networks; transport protocols; ACSFQ; SCORE networks; TCP flows; UDP flows; adaptive CSFQ; core routers; core stateless fair queuing; edge routers; fair bandwidth allocation; fair queuing mechanism; fair share rate; flow arrival rate; packet dropping probability; per-flow queuing; per-flow state; queue length; stateless core networks; Bandwidth; Channel allocation; Laboratories; Proposals; Round robin; Scalability; State estimation; Steady-state; Technological innovation;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Switching and Routing, 2002. Merging Optical and IP Technologies. Workshop on

Print_ISBN

4-88552-184-X

Type

conf

DOI

10.1109/HPSR.2002.1024205

Filename

1024205