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
IEEE/ACM Transactions on Networking (TON)
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
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A control-theoretic approach to the design of an explicit rate controller for ABR service
IEEE/ACM Transactions on Networking (TON)
Stateless core: a scalable approach for quality of service in the internet
Stateless core: a scalable approach for quality of service in the internet
IEEE Network: The Magazine of Global Internetworking
Preferential bandwidth allocation for short flows with active queue management
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Hi-index | 0.00 |
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 transmission control protocol and user datagram protocol flows when compared with other SCORE/DPS fair queueing algorithms, such as core-stateless fair queueing.