Skip to main content
SpringerLink
Log in

Utility function of TCP Reno under precise end-to-end drop probability

  • Brief Report
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

TCP Reno can be regarded as a distributed algorithm over the Internet to maximize aggregate utility subject to capacity. The equilibrium reached by the interaction of many competing TCPs, each implemented only on the source and destination computers, is effectively maximizing an objective function for the entire network. In this paper, a new utility function is derived for TCP Reno under the precise end-to-end drop probability. The results show theoretically that the TCP Reno model proposed by Kelly [1] is reasonable. And simulation results are provided.

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

References

  1. Kelly F P. The mathematics of traffic in network. In: Timothy G, June B G, Imre L, eds. The Princeton Companion to Mathematics. Princeton: Princeton University Press, 2008. 862–870

    Google Scholar 

  2. Kelly F P. Mathematical modeling of the Internet. In: Engquist B, Schmid W, eds. Mathematics Unlimited-2001 and Beyond. Berlin: Springer, 2001. 685–702

    Chapter  Google Scholar 

  3. Low S H, Paganini F, Doyle J C. Internet congestion control. IEEE Control Syst Mag, 2002, 22: 28–43

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. Li R, Eryilmaz A, Ying L, et al. A unified approach to optimizing performance in networks serving heterogeneous flows. IEEE/ACM Trans Netw, 2011, 19: 223–236

    Article  Google Scholar 

  6. Xu K, Liu H Y, Liu J C, et al. LBMP: a logarithm-barrier-based multipath protocol for Internet traffic management. IEEE Trans Parallel Distrib Syst, 2011, 22: 476–488

    Article  Google Scholar 

  7. Low S H, Lapsley D E. Optimization flow control-I: basic algorithm and convergence. IEEE/ACM Trans Netw, 1999, 7: 861–874.

    Article  Google Scholar 

  8. Chiang M, Low S H, Calderbank A R, et al. Layering as optimization decomposition: a mathematical theory of network architectures. Proc IEEE, 2007, 95: 255–312

    Article  Google Scholar 

  9. Kelly F P, Maulloo A, Tan D. Rate control for communication networks: shadow prices, proportional fairness and stability. J Oper Res Soc, 1998, 49: 237–252

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Network Sciences and Cyberspace, Tsinghua University, Beijing, 100084, China

    Ying Liu

  2. State Key Laboratory of Software Development Environment, Beihang University, Beijing, 100191, China

    He Li

  3. School of Mathematics and Systems Science, Beihang University, Beijing, 100191, China

    HongYing Liu

Authors
  1. Ying Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. He Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. HongYing Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ying Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Y., Li, H. & Liu, H. Utility function of TCP Reno under precise end-to-end drop probability. Sci. China Inf. Sci. 56, 1–6 (2013). https://doi.org/10.1007/s11432-012-4703-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-012-4703-7

Keywords

Search

Navigation