Adaptive CHOKe: An algorithm to increase the fairness in Internet Routers
Journal: International Journal of Advanced Networking and Applications (Vol.1, No. 06)Publication Date: 2010-05-03
Authors : K.Chitra; G.Padamavathi;
Page : 382-386
Keywords : Congestion; Drop Probability; Fairness; Queue length; Misbehaving flows;
Abstract
Routers in Internet face the problem of congestion due to the increased use of Internet. AQM algorithm is a solution to the problem of congestion control in the Internet routers. As data traffic is bursty in routers, burstiness must be handled without comprising the high link utilization and low queuing delay. Congested link causes many problems such as large delay, unfairness among flows, under utilization of the link and packet drops in burst. There are various existing algorithms that have been evolved over the past few years to solve these problems of congestion in routers. RED based algorithms use queue length as congestion indicator while some of them use flow information for more accurate congestion indication. In this paper, we propose an AQM scheme that considers only the advantages of both these queue length based and flow based algorithm and satisfies the QOS requirements of the network. This proposed scheme aims to provide good service under heavy load and shields the responsive flows form unresponsive flows to offer a good QOS to all users.
Other Latest Articles
- Remote Administrative Suite for Unix-Based Servers
- Efficient Bio Metric IRIS Recognition System Using Fuzzy Neural Network
- Data Hiding and Water Marking Security based on nested lattices
- Content-Based Color Image Retrieval Using Adaptive Lifting
- Exploring Round Trip Time fairness for Adaptive Layered Transmission Control Protocol
Last modified: 2015-12-05 20:10:34