A control-theoretical approach for fair share computation in core-stateless networks

Authors:
Hoon-Tong Ngin;Chen-Khong Tham
Affiliations:
National University of Singapore, Department of Electrical and Computer Engineering, Singapore;National University of Singapore, Department of Electrical and Computer Engineering, Singapore
Venue:
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Year:
2002

Citing 6
Cited 0

Data networks

Data networks
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Optimal control: linear quadratic methods

Optimal control: linear quadratic methods
Random early detection gateways for congestion avoidance

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

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stateless core: a scalable approach for quality of service in the internet

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

Quantified Score

Hi-index	0.00

Visualization

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.