TY - JOUR
T1 - Avoiding queue overflow and reducing queuing delay at eNodeB in LTE networks using congestion feedback mechanism
AU - N.D., A.
AU - A., Renuka
PY - 2019/10/15
Y1 - 2019/10/15
N2 - During congestion in LTE network, most of the algorithms succeed in either address the queue overflow problem or bufferbloat problem through implicit congestion control mechanism or using flow control technique. The flow control technique solves the bufferbloat problem but it affects the users while competing for shared resource in coexistence with conventional TCP or UDP users. The implementation of explicit congestion notification in LTE eNodeB is difficult because the network layers do not support it. Therefore, in this paper, congestion identification and feedback mechanisms are proposed to reduce the queuing delay and queue overflow problem by varying the congestion window size at sender based on the estimation of congestion level at eNodeB. The extensive experimental results illustrate that the proposed algorithms reduce the delay of the packets and increase the fairness among the users compared to drop-tail, RED, STRED and PIE methods. Moreover, the Packet Delivery Fraction (PDF) has been increased and further throughput of the system is maintained. In addition to that, it competes with other users of conventional methods for the shared resources in a fair manner.
AB - During congestion in LTE network, most of the algorithms succeed in either address the queue overflow problem or bufferbloat problem through implicit congestion control mechanism or using flow control technique. The flow control technique solves the bufferbloat problem but it affects the users while competing for shared resource in coexistence with conventional TCP or UDP users. The implementation of explicit congestion notification in LTE eNodeB is difficult because the network layers do not support it. Therefore, in this paper, congestion identification and feedback mechanisms are proposed to reduce the queuing delay and queue overflow problem by varying the congestion window size at sender based on the estimation of congestion level at eNodeB. The extensive experimental results illustrate that the proposed algorithms reduce the delay of the packets and increase the fairness among the users compared to drop-tail, RED, STRED and PIE methods. Moreover, the Packet Delivery Fraction (PDF) has been increased and further throughput of the system is maintained. In addition to that, it competes with other users of conventional methods for the shared resources in a fair manner.
UR - http://www.scopus.com/inward/record.url?scp=85070193687&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85070193687&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2019.07.015
DO - 10.1016/j.comcom.2019.07.015
M3 - Article
AN - SCOPUS:85070193687
SN - 0140-3664
VL - 146
SP - 131
EP - 143
JO - Computer Communications
JF - Computer Communications
ER -