IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v91y2019i1d10.1007_s11134-018-9594-x.html
   My bibliography  Save this article

An asymptotic approximation for TCP CUBIC

Author

Listed:
  • Sudheer Poojary

    (University of Avignon
    Indian Institute of Science
    Qualcomm India Private Limited)

  • Vinod Sharma

    (Indian Institute of Science)

Abstract

In this paper, we derive an expression for computing the average window size of a single TCP CUBIC connection under random losses. For this we consider a throughput expression for TCP CUBIC computed earlier under deterministic periodic packet losses. We validate this expression theoretically. We then use insights from the deterministic loss-based model to scale appropriately a sequence of Markov chains with random losses indexed by the probability of loss p. We show that this sequence converges to a limiting Markov chain as p tends to 0. The stationary distribution of the limiting Markov chain is then used to derive the average window size for small packet error rates. We then use a simple approximation to extend our current results with negligible queuing to a setup with multiple connections and non-negligible queuing. We validate our model and approximations via simulations.

Suggested Citation

  • Sudheer Poojary & Vinod Sharma, 2019. "An asymptotic approximation for TCP CUBIC," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 171-203, February.
    • Handle: RePEc:spr:queues:v:91:y:2019:i:1:d:10.1007_s11134-018-9594-x
    DOI: 10.1007/s11134-018-9594-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-018-9594-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-018-9594-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Vladimir V. Kalashnikov, 1993. "Mathematical methods in queueing theory," International Journal of Stochastic Analysis, Hindawi, vol. 6, pages 1-1, January.
    2. Sudheer Poojary & Vinod Sharma, 2017. "An asymptotic approximation for TCP compound," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 211-247, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:91:y:2019:i:1:d:10.1007_s11134-018-9594-x. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.