Algorithm A1. Pseudo-Code of Congestion Control Algorithm.

While(1) { Recv ACK //Compute window’s smoothing rate     BC = Fs / (T − Ts);     B = (1 − α) ∗ B’ + α ∗ BC If(B > B’) //window’s smoothing rate increases     {       If((B − B’) > γ)       CWND = CWND’ + εj       Else       CWND = CWND’ + ζ       j++       } Else //window’s smoothing rate decreases     {       i++       if(i ≥ 3)         $\mathrm{If}(({\sum }_{k = 1}^3(\mathrm{B}’ - \mathrm{B})$) < δ)            {            If(SRTT ≤ η ∗ RTTMIN)            CWND = CWND’ + ζ            Else            CWND = CWND’            }         Else            CWND = β ∗ CWND’       else         CWND = CWND’ + ζ       } Recv NACK //packet loss occurs     CWND = β ∗ CWND’ }