A Control-Theoretical Approach for Fair Share Computation in Core-Stateless Networks

Abstract

Abstract. 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 Linear Quadratic (LQ) control method from the optimal control theory to our modification of Core-Stateless Fair Queueing (CSFQ). Simulation results show that this approach gives improved flow isolation between TCP and UDP flows when compared with CSFQ.