Open Access Open Access  Restricted Access Subscription Access

Adaptive CHOKe:An Algorithm to Increase the Fairness in Internet Routers


Affiliations
1 D.J. Academy for Managerial Excellence, Coimbatore, Tamil Nadu, India
2 Dept. of Computer Science, Avinashilingam University for Women, Coimbatore, Tamil Nadu, India
 

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, underutilization 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.

Keywords

Congestion, Drop Probability, Fairness, Queue Length, Misbehaving Flows.
User
Notifications
Font Size

Abstract Views: 276

PDF Views: 0




  • Adaptive CHOKe:An Algorithm to Increase the Fairness in Internet Routers

Abstract Views: 276  |  PDF Views: 0

Authors

K. Chitra
D.J. Academy for Managerial Excellence, Coimbatore, Tamil Nadu, India
G. Padamavathi
Dept. of Computer Science, Avinashilingam University for Women, Coimbatore, Tamil Nadu, India

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, underutilization 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.

Keywords


Congestion, Drop Probability, Fairness, Queue Length, Misbehaving Flows.