A control-theoretical approach for achieving fair bandwidth allocations in core-stateless networks
نویسندگان
چکیده
In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on the Scalable Core (SCORE) / Dynamic Packet State (DPS) architecture. In particular, we make use of the Linear Quadratic control method from optimal control theory to design stable and robust systems that are simple to implement. Simulation results show that this approach gives improved flow isolation between TCP and UDP flows when compared with other SCORE / DPS fair queueing algorithms, such as Core-Stateless Fair Queueing (CSFQ). Keywords—fair queueing, linear quadratic control, SCORE/DPS
منابع مشابه
UN CO RR EC TE D PR OO F 2 A control - theoretical approach for achieving fair bandwidth 3 allocations in core - stateless networks 4
9 In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on 10 the scalable core (SCORE)/dynamic packet state (DPS) architecture. In particular, we make use of the linear quadratic 11 control method from optimal control theory to design stable and robust systems that are simple to implement. Sim12 ulation results show that this approa...
متن کاملAdaptive CSFQ: determining the packet dropping probability adaptively for achieving fair bandwidth allocations in SCORE networks
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 propo...
متن کاملCore-Stateless Labeling Fairness: An Integrated Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks
Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require per-packet relabeling in the core routers. In this paper, we propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Fu...
متن کاملA Control-Theoretical Approach for Fair Share Computation in Core-Stateless Networks
In this paper, we propose the use of a control theoretical approach for a fast and robust fair share computation for a class of fair queueing algorithms based on the Scalable Core (SCORE)/Dynamic Packet State (DPS) architecture. Our proposed approach is generic and can be applied to other SCORE/DPS fair queueing algorithms with little modifications. For purpose of illustration, we applied the L...
متن کاملThe Incremental Deployability of Core-Stateless Fair Queuing
In this paper, we study the incremental deployability of the CoreStateless Fair Queuing (CSFQ) approach to provide fair rate allocations in backbone networks. We define incremental deployability as the ability of the approach to gracefully provide increasingly better quality of service with each additional QoS-aware router deployed in the network. We use the ns2 network simulator for the simula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 40 شماره
صفحات -
تاریخ انتشار 2002