Abstract
A primary reason for Congestion in communication networks is the presence of preprocessing and postprocessing queues (buffers) in routers and switches. Congestion in the networks reduces the quality of service (QoS), hence causing delays and loss of data. Most of the existing congestion control techniques are incapable of controlling the congestion that might occur in the future, as they do not use any prediction algorithms. To overcome this inability, in this paper, a new heuristic congestion control technique is proposed to determine the present status of congestion in the network and also predict the congestion in future. The proposed heuristic congestion control technique maintains a historical database, containing the congestion control parameters such as round-trip time (RTT), average queue size (AQS), available bandwidth, and network speed. Based on this historical database, the current status of congestion is determined and also its future value is predicted in networks with the help of an AI technique using a feed-forward backpropagation neural network (FFBNN). Finally, the sending rate of the packets to the network is adjusted using these congestion control parameter values, so as to reduce congestion in the network. An optimal congestion window is designed using an optimization algorithm called evolutionary programming (EP) algorithm. Simulation results have shown that the proposed heuristic congestion control technique efficiently controls the congestion in the networks, increases the throughput by 20 %, reduces the propagation delay by 22 % when compared to the existing technique [10], and also improves the performance of the network by 20 %.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xu L, Harfoush K, Rhee I (2004) Binary increase congestion control for fast, long distance networks. In: IEEE conference on INFOCOM, pp 1–13
Mascolo S (1997) Smith’s principle for congestion control in high speed ATM networks. In: 36th IEEE conference on decision and control, San Diego, CA, USA, vol 5, pp 4595–4600
Bansal D, Balakrishnan H (2001) Binomial congestion control algorithms. In: IEEE INFOCOM, Anchorage, AK, pp 1–10
Haider A (2004) Improved congestion control for packet switched data networks and the internet. Technical Report
Jasem HN, Zukarnain ZA, Othman M, Subramaniam S (2009) The new AIMD congestion control algorithm. World Acad Sci Eng Technol 50(130):769–774
Ahmad S, Mustafa A, Ahmad B, Bano A, Hosam AS (2009) Comparative study of congestion control techniques in high speed networks. Int J Comput Sci Inf Secur 6(2):222–231
Reddy S, Reddy LC (2008) A survey on congestion control mechanisms in high speed networks. Int J Comput Sci Netw Secur 8(1):187–195
Liu S, Basar T, Srikant R (2006) TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks. In: 1st international conference on Performance evaluation methodologies and tools, Pisa, Italy
Dangi R, Shukla N (2012) A new congestion control algorithm for high speed networks. Int J Comput Technol Electron Eng (IJCTEE) 2(1):218–221
Kaura S, Vatsa AK (2011) A novel architecture and mechanism for congestion control in high speed network. Int J Next-Gener Netw 3(1):21–35
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Uma, S.V., Gurumurthy, K.S. (2014). Congestion Control by Heuristics in High-Speed Networks Using ANN. In: Sridhar, V., Sheshadri, H., Padma, M. (eds) Emerging Research in Electronics, Computer Science and Technology. Lecture Notes in Electrical Engineering, vol 248. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1157-0_33
Download citation
DOI: https://doi.org/10.1007/978-81-322-1157-0_33
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1156-3
Online ISBN: 978-81-322-1157-0
eBook Packages: EngineeringEngineering (R0)