Analysis of ECN/RED and SAP-LAW with simultaneous TCP and UDP traffic

Internetworking often requires a large amount of users to share a common gateway to obtain connectivity to the Internet. Congestion avoidance mechanisms are used to prevent the saturation of the gateway which represents a bottleneck of the system. The most popular congestion avoidance mechanisms are the Explicit Congestion Notification (ECN) and the Random Early Detection (RED). Recently, a new method for the congestion avoidance has been proposed: the Smart Access Point with Limited Advertised Window (SAP-LAW). The main idea is to hijack the acknowledge packets in the TCP connections in order to artificially reduce the advertised destination window according to some bandwidth allocation policy. Therefore, the flux control mechanism is artificially exploited to control the congestion at the bottleneck. The advantage of this approach is that it does not require any modification in the TCP implementations at the clients. In this paper, we propose stochastic models for the ECN/RED and SAP-LAW mechanisms in order to compare their performances under different scenarios. The models are studied in mean field regime, i.e., under a great number of TCP connections and UDP based transmissions. Augmenting previous work on ECN/RED, we consider the presence of UDP traffic with bursts, and short lived TCP connections. The models for SAP-LAW are totally new. The comparison is performed in terms of different performance indices including average queue length, system throughput and expected queuing time.

Internetworking often requires a large amount of users to share a common gateway to obtain connectivity to the Internet. Congestion avoidance mechanisms are used to prevent the saturation of the gateway which represents a bottleneck of the system. The most popular congestion avoidance mechanisms are the Explicit Congestion Notification (ECN) and the Random Early Detection (RED). Recently, a new method for the congestion avoidance has been proposed: the Smart Access Point with Limited Advertised Window (SAP-LAW). The main idea is to hijack the acknowledge packets in the TCP connections in order to artificially reduce the advertised destination window according to some bandwidth allocation policy. Therefore, the flux control mechanism is artificially exploited to control the congestion at the bottleneck. The advantage of this approach is that it does not require any modification in the TCP implementations at the clients. In this paper, we propose stochastic models for the ECN/RED and SAP-LAW mechanisms in order to compare their performances under different scenarios. The models are studied in mean field regime, i.e., under a great number of TCP connections and UDP based transmissions. Augmenting previous work on ECN/RED, we consider the presence of UDP traffic with bursts, and short lived TCP connections. The models for SAP-LAW are totally new. The comparison is performed in terms of different performance indices including average queue length, system throughput and expected queuing time. (C) 2016 Elsevier B.V. All rights reserved.