Email this article Research on Detectable and Indicative Forward Active Network Congestion Control Algorithm
Abstract
In order to solve the shortages of Forward Active network Congestion Control algorithm (FACC), this paper proposes a Detectable and Indicative Forward Active network Congestion Control algorithm (DIFACC). DIFACC uses RED buffer queue management algorithm instead of standard drop tail algorithm to increase the usage of bandwidth. It preserves the active detection and passive indication mechanism to realize load balance. It introduces sending speed adjustment policy, and designs different processing method for different kinds of service data according to their different characteristics and requests on network resources. DIFACC can not only relieve congestion in time when congestion happens, but also can avoid the congestion and increase the QoS of the different kinds of service data. A simulation experiment is given to analyze the performance of the algorithms. With the analysis of performance between FACC and DIFACC, it shows that DIFACC not only resolves some shortages in FACC, but also improves the OoS of different kinds of service data, reduces the package loss rate and decreases the processing delay of packets.
Keywords
References
[1] Jingyang Wang, Xiaohong Wang et al, The Research of Active Network Congestion Control Algorithm, Proceedings of the WiCom2007, September 2007.
[2] Wang Bin, Liu Zeng-Ji et al, Forward active networks congestion control algorithm and its performance analysis, Acta Electronica Sinica, Vol 29, No. 4, April. 2001, pp. 483-486.
[3] Carlo Tarantola, Dynamic Active Networks Services, Proceedings of the 2004 IEEE International Conference on Mobile Data Management, pp. 46-47, June 2004.
http://dx.doi.org/10.1109/MDM.2004.1263063
[4] Xu Jiali, and Liu Suqin, Discussing and Implementing Method of Active Network Architecture, Control & Automation, Vol 11, No.2, pp. 232-245, Nov. 2004.
[5] LA Grieco and S. Mascolo, TCP Westwood and Easy RED to Improve Fairness in High-Speed Networks, Seventh International Workshop on Protocols For High-Speed Networks (PfHSN'2002), Berlin, Germany, pp. 130–146, April 2002.
[6] K.Psounis, Active Networks; Applications, Security, Safety and Architectures, IEEE Communications Surveys, Vol 2, No. 1, 1999.
[7] Zhang Ke-ping, and Tian Liao, and Li Zeng-zhi, A New Queue Management Algorithm with Priority and Self-Adaptation, Acta Electronica Sinica, Vol 6, No. 4, pp. 324-328, July 2004.
[8] Xu Yongbo, and Wang Xingren, The Research and Implementation of Time Management Services in Distributed Simulation System, Proceedings of Asian Conference on System Simulation and ScientificSimulation Conference, Shanghai, 2002.
[9] Appel A W, Foundation Proof-Carrying Code, IEEE Communication Magnize, 2001.
[10] MAXEMCHUKNF, and LOWSH, Active Routing, IEEE Journal on Selected Areas in Communications, 2001, pp. 552-565.
[11] S.Murphy, Security Architecture for ActiveNets, AN Security Working group, July 15, 1998.
[12] A. B. Kulkarni and S. F. Bush, Active network management and Kolmogorov complexity, IEEE OPENARCH 2001, Anchorage, AK, Apr. 2001.