Regulation of Queue Length in Router Based on an Optimal Scheme

DOI: 10.4236/ijcns.2009.25041   PDF   HTML     4,447 Downloads   7,831 Views  

Abstract

Based on the proportionally fair scheme that Kelly proposed to solve the optimization problems for utility function in networks, and in order to improve the congestion control performance for the queue in router, the linear and terminal sliding active queue management (AQM) algorithms are designed. Especially in the ter-minal sliding AQM algorithm, a special nonlinear terminal sliding surface is designed in order to force queue length to reach the desired value in finite time. The upper bound of the time is also obtained. Simulation re-sults demonstrate that the proposed congestion algorithm enables the system be better transient and stable performance. At the same time, the robustness is guaranteed.

Share and Cite:

N. ZHANG, "Regulation of Queue Length in Router Based on an Optimal Scheme," International Journal of Communications, Network and System Sciences, Vol. 2 No. 5, 2009, pp. 371-377. doi: 10.4236/ijcns.2009.25041.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] B. Braden and D. Clark, “Recommendations on queue management and congestion avoidance in the Internet,” RFC 2309, 1998.
[2] S. Floyd and V. Jacobson, “Random early detection gate-ways for congestion avoidance,” IEEE/ACM Transaction on Networking, Vol. 1, pp. 397-413, 1993.
[3] W. C. Feng, Kang G. Shin, D. D. Kandlur, et al., “The blue active queue management algorithms,” IEEE/ACM Transactions on Networking, Vol. 10, No. 4, pp. 513-528, 2002.
[4] S. Athuraliya, S. H. Low, V. H. Li, et al., “REM: Active queue management,” IEEE Network, Vol. 15, No. 3, pp. 48-53, 2001.
[5] S. Srisankar, Kunniyur, and R. Srikant, “An adaptive virtual queue (AVQ) algorithm for active queue management,” IEEE/ACM Transactions on Networking, Vol. 12, No. 2, pp. 266-289, 2004.
[6] C. V. Hollot, V. Misra, D. Towsley, and W. Gong, “On designing improved controllers for AQM routers sup-porting TCP flows,” Proceedings of IEEE INFOCOM, Anchorage, Alaska, USA, IEEE Communications Society, pp. 1726-1734, 2001.
[7] H. Lim, K. J. Park, and C. H. Choi, “Virtual rate control algorithm for active queue management in TCP networks,” IEEE Electronics Letters, Vol. 38, No. 16, pp. 873-874, 2002.
[8] F. Kelly, A. Maulloo, and D. Tan, “Rate control for communication networks: Shadow prices, proportional fairness and stability,” Journal of the Operational Research Society, Vol. 49, No. 3, pp. 237–252, March 1998.
[9] Y. H. Roh and J. H. Oh, “Robust stabilization of uncertain input-delay systems by sliding mode control with delay compensation,” Automatica, Vol. 35, pp. 1861- 1865, 1999.
[10] F. Y. Ren, C. Lin, and X. H. Yin, “Design a congestion controller based on sliding mode variable structure con-trol,” Computer Communications, Vol. 28, pp. 1050- 1061, 2005.
[11] P. Yan, Y. Gao, and H. AOzbay, “A variable structure control approach to active queue management for TCP with ECN,” IEEE Transactions on Control Systems Technology, Vol. 13, pp. 203-215, 2005.
[12] F. J. Yin, G. M. Dimirovski, and Y. W. Jing, “Robust stabilization of uncertain input delay for Internet congestion control,” Proceedings of the American Control Conference, Minneapolis, Minnesota, USA, pp. 5576-5580, 2006.
[13] Y. Tang, “Terminal sliding mode control for rigid robots,” Automatica, Vol. 34, pp. 51-56, 1997.
[14] S. H. Yu, X. H. Yu, B. Shirinzadeh, and Z. H. Man, “Continuous finite-time control for robotic manipulators with terminal sliding mode,” Automatica, Vol. 41, pp. 1957-1964, 2005.
[15] F. Paganini, Z. Wang, J. C. Doyle, and S. H. Low, “Congestion control for high performance, stability, and fairness in general networks,” IEEE/ACM Transaction on Networking, Vol. 13, No. 1, pp. 43–56, 2005.
[16] R. Thommes and M. J. Coates, “Deterministic packet marking for congestion price estimation,” In Proceeding of IEEE INFOCOM, Hong Kong, pp. 12-23, 2004.

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.