Gateway Feedback Congestion Control (GFCC) algorithm

Rawad Luay Al-Momni, Bijan Karimi · 2018

The extensive use of the Internet has been growing over time, so networks need a robust and stable algorithm that can provide high performance over various loads. Congestion in the data network occurs at a gateway when there is more incoming traffic than the outgoing data. Congestion reduces system throughput, stability, and fairness, and it increases packet drop. Most congestion-avoidance algorithms control a network traffic by dropping incoming packets. A method of congestion control for TCP networks is proposed which shows performance improvement over Random Early Detection (RED) method in terms of throughput and packet drop, fairness, and queue length stability. The average percentage of packet loss for RED is 7.88% of the received packets where GFC has a zero packet loss and the average percentage improvement of throughput in GFC is 9.34%. This method, Gateway Feedback Congestion Control (GFCC) is based on determining the maximum number of bytes or packets that each user is allowed to send in order to avoid congestion and improve throughput. GFCC divides users into active and inactive users to calculate the maximum number of bytes (MNB) that each active user can send. When each active user sends its fair share of data, no congestion can occur. GFCC uses TCP characteristics to detect active users that allows the gateway to adjust the value of MNB.

Read the paper · More papers on PaperTik