IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v70y2019i2d10.1007_s11235-018-0476-7.html
   My bibliography  Save this article

Burst ratio in a single-server queue

Author

Listed:
  • Andrzej Chydzinski

    (Silesian University of Technology)

  • Dominik Samociuk

    (Silesian University of Technology)

Abstract

In contemporary packet networks, the possibility of packet loss is a negative, but inevitable aspect of the network design. One of the most important characteristics of the packet loss process is the burst ratio—a characteristic describing the tendency of losses to occur in long series, one after another. In this paper, we study the burst ratio in the queueing system with the finite buffer for packets. This is motivated by the fact, that most packet losses in wired networks occur due to queueing of packets in routers, and overflowing routers’ buffers. We firstly derive the exact formula for the burst ratio. Then we study its behaviour as the buffer size grows, and obtain a simplified formula for large buffers. Thirdly, we present numerical results for different system parameterizations as well as the comparison with simulation results. Then we show results of measurements of the burst ratio in the networking laboratory. Finally, we draw conclusions on the influence (or lack of it) of several factors on the burst ratio.

Suggested Citation

  • Andrzej Chydzinski & Dominik Samociuk, 2019. "Burst ratio in a single-server queue," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 70(2), pages 263-276, February.
    • Handle: RePEc:spr:telsys:v:70:y:2019:i:2:d:10.1007_s11235-018-0476-7
    DOI: 10.1007/s11235-018-0476-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-018-0476-7
    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/s11235-018-0476-7?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. Andrzej Chydzinski & Pawel Mrozowski, 2016. "Queues with Dropping Functions and General Arrival Processes," PLOS ONE, Public Library of Science, vol. 11(3), pages 1-23, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chydzinski, Andrzej, 2022. "Per-flow structure of losses in a finite-buffer queue," Applied Mathematics and Computation, Elsevier, vol. 428(C).
    2. Chydzinski, Andrzej, 2022. "On the structure of data losses induced by an overflowed buffer," Applied Mathematics and Computation, Elsevier, vol. 415(C).

    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.
    1. Chydzinski, Andrzej & Adamczyk, Blazej, 2020. "Response time of the queue with the dropping function," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    2. Chanintorn Jittawiriyanukoon & Vilasinee Srisarkun, 2020. "Cost Minimization for Unstable Concurrent Products in Multi-stage Production Line Using Queueing Analysis," International Journal of Economics & Business Administration (IJEBA), International Journal of Economics & Business Administration (IJEBA), vol. 0(1), pages 230-238.
    3. Konovalov, Mikhail & Razumchik, Rostislav, 2023. "Finite capacity single-server queue with Poisson input, general service and delayed renovation," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1075-1083.
    4. Chydzinski, Andrzej, 2022. "Per-flow structure of losses in a finite-buffer queue," Applied Mathematics and Computation, Elsevier, vol. 428(C).
    5. Marek Barczyk & Andrzej Chydzinski, 2022. "AQM based on the queue length: A real-network study," PLOS ONE, Public Library of Science, vol. 17(2), pages 1-21, February.
    6. Andrzej Chydzinski, 2021. "On the stability of queues with the dropping function," PLOS ONE, Public Library of Science, vol. 16(11), pages 1-16, November.

    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:telsys:v:70:y:2019:i:2:d:10.1007_s11235-018-0476-7. 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.