Asymptotic Stability Analysis of E-speed Start Congestion Control Protocol for TCP

All the proposed window based congestion control protocols use a single slow start algorithm. It has been shown in literature that slow start inefficiently utilizes bandwidth in a network with high bandwidth delay product (BDP). A multiple startup algorithm (E-speed start) was proposed in this work. E-speed start specifies a multiple selectable startup for Transmission Control Protocol (TCP). It is proposed that startup speed for TCP be selectable from n-arry startup algorithms. In E-speed start, a binary start was implemented based on a calculated value β which depends on the available bandwidth and other network conditions. A model for E-speed start was derived using utility maximization theory and the principle of decentralised solution. The model derived was shown to be stable by linear approximation, Laplace transform and by using the concept of Nyquist Stability criterion.