Skip to main content
Log in

An improved preference method for the FAST TCP protocol parameter

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Aiming at the weaknesses of FAST TCP in choosing protocol parameter for static mapping. A slow time-scale iterative search preference parameter method based on the difference between each path traffic service intensity and its transmission bandwidth is proposed. The stochastic model and its fluid model was derived, in which each path TCP connection followed Poisson process and the size of transport files obeyed the exponential distribution. A Lyapunov function including TCP connection’s mean waiting time was constructed to prove that, for those links which are in heavy traffic, if each path’s traffic service intensity was equal to its transmission bandwidth, the number of each path’s active TCP connection would stay stable, and the average waiting time will reach the minimum. Thereby the proposed method is theoretically feasible. Moreover, NS-2 simulations are presented to verify this effective method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Wei, D.X., Jin, C., Low, S.H.: FAST TCP: motivation, architecture, algorithms, performance. IEEE Trans. Netw. 14(6), 1246–1259 (2006)

    Article  Google Scholar 

  2. Nagaraj, K., Bharadia, D., Mao, H., Chinchali, S., Alizadeh, M.: NUMFabric: fast and flexible bandwidth allocation in datacenters. In: SIGCOMM ‘16: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 188–201. New York: ACM (2016)

  3. Zhang, H., Chen, L.: CODA: toward automatically identifying and scheduling coflows in the dark. In: SIGCOMM ‘16: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 160–173. ACM, New York (2016)

  4. Kelly, F.P., Williams, R.J.: State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann. Appl. Probab. 11(3), 1055–1083 (2007)

    Article  Google Scholar 

  5. Chen, X., Meng, X., Song, X., et al.: Coverage probability in cognitive radio networks powered by renewable energy with primary transmitter assisted protocol. Inf. Sci. 400(3), 14–29 (2017)

    Article  Google Scholar 

  6. Chen, L., Chen K.: Scheduling mix-flows in commodity datacenters with karuna. In: SIGCOMM ‘16: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 174–187. ACM, New York (2016)

  7. Wan, K., Luo, X.-F.: Flow oriented scheduling algorithm in SDN systems. J. Comput. 38(1), 62–81 (2015)

    Google Scholar 

  8. Chen, X., Meng, X., Song, X.: Coverage performance of cognitive radio networks powered by renewable energy. ANZIAM J 58(4), 287–305 (2017)

    MathSciNet  MATH  Google Scholar 

  9. Low, S.H.: A duality model of TCP and queue management algorithms. IEEE Trans. Netw. 11(4), 525–536 (2003)

    Article  Google Scholar 

  10. Sun, Y., Ma, H., Liu, L.: Service scheduling algorithm of service aware in multimedia sensor network. J. Syst. Simul. 19(23), 5591–5596 (2007)

    Google Scholar 

  11. Song, L., Chen, M., Zhang, R.: A FAST TCP improvement scheme based on measurement. J. Beijing Univ. Posts Telecommun. 28(4), 27–32 (2005)

    Google Scholar 

  12. Song, L., Wang, H., Zhang, R.: Congestion control mechanism based on network measurement and fuzzy control technology. J. South China Univ. Technol. 34(6), 89–95 (2006)

    Google Scholar 

Download references

Acknowledgements

The authors acknowledge the Zhejiang Natural Science Foundation of China (Grant: LY18F010018).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weibin Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, W., Chen, X., Wang, C. et al. An improved preference method for the FAST TCP protocol parameter. Cluster Comput 22 (Suppl 6), 14845–14853 (2019). https://doi.org/10.1007/s10586-018-2425-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-2425-3

Keywords

Navigation