Skip to main content
SpringerLink
Log in

Optimal Markovian Coupling and Exponential Convergence Rate for the TCP Process

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

In this work, by constructing optimal Markovian couplings we investigate exponential convergence rate in the Wasserstein distance for the transmission control protocol process. Most importantly, we provide a variational formula for the lower bound of the exponential convergence rate.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bardet, J., Christen, A., Guillin, A., et al.: Total variation estimates for the TCP process. Electron. J. Probab., 18, 1–21 (2013)

    Article  MathSciNet  Google Scholar 

  2. Chafaï, D., Malrieu, F., Paroux, K.: On the long time behavior of the TCP window size process. Stoch. Proc. Appl., 120, 1518–1534 (2010)

    Article  MathSciNet  Google Scholar 

  3. Chen, M. F.: Optimal Markovian couplings and applications. Acta Math. Sin., Engl. Ser., 10, 260–275 (1994)

    Article  MathSciNet  Google Scholar 

  4. Cloez, B.: Wasserstein decay of one dimensional jump-diffusions, arXiv:1202.1259v2, 2012

  5. Dumas, V., Guillemin, F., Robert, P.: A Markovian analysis of additive-increase multiplicative-decrease algorithms. Adv. in Appl. Probab., 34, 85–111 (2002)

    Article  MathSciNet  Google Scholar 

  6. Floyd, S.: Connections with multiple congested gateways in packet-switched networks 1: One way traffic. Computer Comm. Rev., 21, 30–47 (1991)

    Article  Google Scholar 

  7. Guillemin, F., Robert, P., Zwart, B.: AIMD algorithms and exponential functionals. Ann. Appl. Probab., 14, 90–117 (2004)

    Article  MathSciNet  Google Scholar 

  8. Meyn, S. P., Tweedie, R. L.: Markov Chains and Stochastic Stability, Springer-Verlag, Berlin, 1993

    Book  Google Scholar 

  9. Monmarché, P.: On ℌ1 and entropic convergence for contractive PDMP. Electron. J. Probab., 20, 30 pp. (2015)

  10. Padhye, J., Firoiu, V., Towsley, D., et al.: Modeling TCP throughput: A simple model and its empirical validation. In: ACM Sigconm’98, ACM, New York, 1998

    Google Scholar 

  11. Roberts, G., Rosenthal, J.: Quantitative bounds for convergence rates of continuous time Markov processes, Electron. J. Probab., 1, 1–21 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We thank the referees for their time and comments.

Author information

Authors and Affiliations

  1. Center for Applied Mathematics, Tianjin University, Tianjin, 300072, P. R. China

    Jian Hai Bao & Jing Hai Shao

  2. Department of Mathematics, Central South University, Changsha, 410083, P. R. China

    Jian Hai Bao

Authors
  1. Jian Hai Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Hai Shao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jian Hai Bao.

Additional information

Supported NNSF of China (Grant Nos. 11771327, 2018JJ2478, 11831014, 12071340)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bao, J.H., Shao, J.H. Optimal Markovian Coupling and Exponential Convergence Rate for the TCP Process. Acta. Math. Sin.-English Ser. 37, 378–388 (2021). https://doi.org/10.1007/s10114-021-9187-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-021-9187-1

Keywords

MR(2010) Subject Classification

Search

Navigation