Open Access Open Access  Restricted Access Subscription or Fee Access

Enhancing Congestion Avoidance Mechanism in Wired & Wireless Networks

M. Muthuselvi, M. Malleswaran

Abstract


This paper presents Neighborhood learning automata like (NLAL) mechanism for congestion avoidance in wired and wireless networks. The gateway and node detects incipient congestion by computing the average queue size. The gateway and node could notify connections of congestion by dropping packets arriving at the gateway and node. When the average queue size exceeds a preset threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of queue size. Here Neighborhood Learning Automata Like Random Early Detection (NLALRED) is founded on the principles of the operations of existing LALRED congestion avoidance mechanisms along with a LAL philosophy. The primary objective of NLALRED is to optimize the value of the average size of the queue used for congestion avoidance and to consequently reduce the total loss of packets at the queue. The LAL scheme chooses the action that possesses the maximal ratio between the number of times the chosen action is rewarded and the number of times that it has been chosen. NLALRED minimizes the number of packet drops in wired & wireless networks. This approach helps to improve the performance of congestion avoidance & Throughput by adaptively minimizing the average queue size. Simulation results obtained using Network Simulator (NS2) establish the improved performance of NLALRED over the traditional RED methods. Simulations of a Transmission Control Protocol/Internet Protocol (TCP/IP) network are used to illustrate the performance of NLALRED gateway and nodes.

Keywords


IP, LA, LAL, LALRED, NLALRED, RED, TCP

Full Text:

PDF

References


G.F.Ali Ahammed,Reshma Banu “Analyzing the performance of Active Queue Management Algorithms,”IJCNC..,vol.2,No.2,March 2010.

NS2 Network Simulator, Last accessed on Feb. 3, 2009. [Online].Available: http://www.isi.edu/nsnam/ns/

R. Verma, A. Iyer, and A. Karandikar, “Active queue management using adaptive RED,” J. Commun. Netw., vol. 5, no. 3, pp. 275–281,Sep. 2008.

B. J. Oommen, S. Misra, and O.-C. Granmo, “Routing bandwidth guaranteed paths in MPLS traffic engineering: A multiple race track learning approach,” IEEE Trans. Comput., vol. 56, no. 7, pp. 959–976, Jul. 2007.

S. Misra and B. J. Oommen, “An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks,” IEEE Trans. Comput., vol. 55, no. 6, pp. 686–702, Jun. 2006.

S. Misra and B. J. Oommen, “GPSPA: A new adaptive algorithm for maintaining shortest path routing trees in stochastic networks,” Int. J.Commun. Syst., vol. 17, no. 10, pp. 963–984, Dec. 2004

QualNet. Network simulator. Available at http://www.qualnet.com, 2003.

B. Zheng and M. Atiquzzaman, “Low pass filter/over drop avoidance (LPF/ODA): An algorithm to improve the response time of RED gateways,” Int. J. Commun. Syst., vol. 15, no. 10, pp. 899–906,Dec. 2002.

Y. Zhang and F. Wang. Improving TCP performance over mobile ad-hoc networks with out-of-order detection and response. Proceedings of ACM MobiHoc’02, June 2002

S. Xu and T. Saadawi. Revealing TCP unfairness behavior in 802.11 based wireless multi-hop networks.Proceedings of IEEE PIMRC’01, Oct. 2001.

D. Katabi and M. Handley, “Enhancing Internet congestion control using explicit and precise feedback,” in Proc. Oxygen Workshop, Jul. 2001,pp. 1–2.

S. Xu and T. Saadawi. Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks? IEEE Communications Magazine, Jun. 2001.

C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. Proceedings of IEEE WMCSA’99, Feb. 1999.

S. Floyd and V. Jacobson, “Random Early Detection gateways for congestion avoidance,” IEEE/ACM Trans. Netw., vol. 1, no. 4, pp. 397–413,Aug. 1993.

M. A. L. Thathachar and P. S. Sastry, “A class of rapidly converging algorithms for learning automata,” IEEE Trans. Syst., Man, Cybern.,vol. SMC-15, no. 1, pp. 168–175, Jan./Feb. 1985.

S. Lakshmivarahan, Learning Algorithms Theory and Applications. NewYork: Springer-Verlag, 1981.

M. A. L. Thathachar and B. J. Oommen, “Discretized reward–inaction learning automata,” J. Cybern. Inf. Sci., vol. 2, no. 1, pp. 24–29, Spring 1979.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.