Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Explicit Congestion Control to Avoid the Packet Losses using XCP-WINF in Wireless Networks


Affiliations
1 Computer Science of Engineering in Mount Zion College of Engineering and Technology, Pudukkottai, Tamilnadu, India
2 Computer Science of Engineering in Anna University, Tiruchirapalli, Tamilnadu, India
     

   Subscribe/Renew Journal


Explicit congestion control (XCC) is one of the answers for the problem occurs in current TCP algorithm. TCP has the some limitations of the limited fairness, higher queuing retard, static dynamic range, unstable throughput. This approach requires large buffer size at bottleneck routers to prevent transient packet losses and is slower in convergence to steady-state as compared to other methods. Routers furnish multibit feedback to origins which increases the throughput more accurate for the path bandwidth with larger convergence times. We map three possible algorithms for Explicit Congestion Control which holds efficiency from queue dynamics. This paper proposes two additional protocols for new flow control which are XCP and RCP and both have been designed as xcp-winf and rcp-winf. This approach evaluates the performance of XCP, xcp-winf and compares them with existing TCP congestion control.

Keywords

Congestion Control, Bottleneck, Bandwidth, Feedback, XCP_WINF.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 240

PDF Views: 3




  • Explicit Congestion Control to Avoid the Packet Losses using XCP-WINF in Wireless Networks

Abstract Views: 240  |  PDF Views: 3

Authors

G. Surya
Computer Science of Engineering in Mount Zion College of Engineering and Technology, Pudukkottai, Tamilnadu, India
S. Anjuga
Computer Science of Engineering in Anna University, Tiruchirapalli, Tamilnadu, India
D. Elavarasi
Computer Science of Engineering in Mount Zion College of Engineering and Technology, Pudukkottai, Tamilnadu, India

Abstract


Explicit congestion control (XCC) is one of the answers for the problem occurs in current TCP algorithm. TCP has the some limitations of the limited fairness, higher queuing retard, static dynamic range, unstable throughput. This approach requires large buffer size at bottleneck routers to prevent transient packet losses and is slower in convergence to steady-state as compared to other methods. Routers furnish multibit feedback to origins which increases the throughput more accurate for the path bandwidth with larger convergence times. We map three possible algorithms for Explicit Congestion Control which holds efficiency from queue dynamics. This paper proposes two additional protocols for new flow control which are XCP and RCP and both have been designed as xcp-winf and rcp-winf. This approach evaluates the performance of XCP, xcp-winf and compares them with existing TCP congestion control.

Keywords


Congestion Control, Bottleneck, Bandwidth, Feedback, XCP_WINF.