IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v428y2022ics0096300322002892.html

Per-flow structure of losses in a finite-buffer queue

Author

Listed:
  • Chydzinski, Andrzej

Abstract

We analyze the structure of losses in individual flows, in a multi-flow, finite-buffer queueing system. Namely, a model with many separate flows (streams) of jobs arriving to a shared buffer, where they are subject to losses due to buffer overflows, is considered. (Such systems are common, for instance, in computer networking, where flows of packets arrive to the same router’s buffer from different network users). Assuming a general service time distribution and Poisson flows, we study the burst ratio parameter, which reflects the tendency of losses to cluster together, in long series. In particular, an explicit formula for the burst ratio in each individual flow is derived. Using this formula we show, among other things, that the per-flow burst ratio may vary significantly among flows and differ from the global burst ratio. This distinguishes the per-flow burst ratio from the per-flow loss ratio, which is the same for all flows. We demonstrate also the dependence of the per-flow burst ratio on the flow rate, number of flows, buffer size, system load and variance of the service time.

Suggested Citation

  • Chydzinski, Andrzej, 2022. "Per-flow structure of losses in a finite-buffer queue," Applied Mathematics and Computation, Elsevier, vol. 428(C).
    • Handle: RePEc:eee:apmaco:v:428:y:2022:i:c:s0096300322002892
    DOI: 10.1016/j.amc.2022.127215
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322002892
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127215?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

    for a different version of it.

    References listed on IDEAS

    as
    1. C. J. Ancker & A. V. Gafarian, 1961. "Queuing with Multiple Poisson Inputs and Exponential Service Times," Operations Research, INFORMS, vol. 9(3), pages 321-327, June.
    2. 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.
    3. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    4. Andrzej Chydzinski & Marek Barczyk & Dominik Samociuk, 2018. "The Single-Server Queue with the Dropping Function and Infinite Buffer," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-12, October.
    5. A. D. Banik & M. L. Chaudhry, 2017. "Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP / G /1/ N With or Without Vacation(s)," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 140-151, February.
    6. Chydzinski, Andrzej & Samociuk, Dominik & Adamczyk, Blazej, 2018. "Burst ratio in the finite-buffer queue with batch Poisson arrivals," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 225-238.
    7. 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.
    8. Susan L. Albin, 1986. "Delays for Customers from Different Arrival Streams to a Queue," Management Science, INFORMS, vol. 32(3), pages 329-340, March.
    9. Andrzej Chydzinski & Blazej Adamczyk, 2012. "Transient and Stationary Losses in a Finite-Buffer Queue with Batch Arrivals," Mathematical Problems in Engineering, Hindawi, vol. 2012, pages 1-17, December.
    10. Chydzinski, Andrzej, 2022. "On the structure of data losses induced by an overflowed buffer," Applied Mathematics and Computation, Elsevier, vol. 415(C).
    11. Lukasz Chrost & Andrzej Chydzinski, 2016. "On the deterministic approach to active queue management," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(1), pages 27-44, September.
    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.
    1. Andrzej Chydzinski, 2022. "Burst ratio for a versatile traffic model," PLOS ONE, Public Library of Science, vol. 17(8), pages 1-19, August.
    2. Chydzinski, Andrzej & Adamczyk, Blazej, 2020. "Response time of the queue with the dropping function," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    3. Chydzinski, Andrzej, 2022. "On the structure of data losses induced by an overflowed buffer," Applied Mathematics and Computation, Elsevier, vol. 415(C).
    4. Ananth V. Iyer & Apurva Jain, 2003. "The Logistics Impact of a Mixture of Order-Streams in a Manufacturer-Retailer System," Management Science, INFORMS, vol. 49(7), pages 890-906, July.
    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.
    7. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    8. Kella, Offer & Stadje, Wolfgang, 2006. "Superposition of renewal processes and an application to multi-server queues," Statistics & Probability Letters, Elsevier, vol. 76(17), pages 1914-1924, November.
    9. Mohebbi, Esmail & Hao, Daipeng, 2008. "An inventory model with non-resuming randomly interruptible lead time," International Journal of Production Economics, Elsevier, vol. 114(2), pages 755-768, August.
    10. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    11. Yanting Chen & Jingui Xie & Taozeng Zhu, 2023. "Overflow in systems with two servers: the negative consequences," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 838-863, September.
    12. Mohan L. Chaudhry & James J. Kim, 2016. "Analytically elegant and computationally efficient results in terms of roots for the $$GI^{X}/M/c$$ G I X / M / c queueing system," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 237-257, February.
    13. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "Stochastic and dynamic vehicle routing with general demand and interarrival time distributions," Working papers 3314-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    14. Ghasem Kahe & Amir Hossein Jahangir, 2019. "A self-tuning controller for queuing delay regulation in TCP/AQM networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 71(2), pages 215-229, June.
    15. Mohebbi, E., 2008. "A note on a production control model for a facility with limited storage capacity in a random environment," European Journal of Operational Research, Elsevier, vol. 190(2), pages 562-570, October.
    16. Perez Becker, Nicole & Arts, Joachim & Reichardt, Sven & Lange, Anne, 2024. "Managing inventories of reusable containers for food take-away at a restaurant," International Journal of Production Economics, Elsevier, vol. 267(C).
    17. Hassin, Refael & Haviv, Moshe & Oz, Binyamin, 2023. "Strategic behavior in queues with arrival rate uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 217-224.
    18. Huseyin C. Ozmutlu, 2009. "Markovian analysis for automatic new topic identification in search engine transaction logs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 737-768, November.
    19. Van Foreest, Nicky D. & Teunter, Ruud H. & Syntetos, Aris A., 2018. "Base-stock policies with reservations," Omega, Elsevier, vol. 81(C), pages 48-56.
    20. Buket Avci & Karan Girotra & Serguei Netessine, 2015. "Electric Vehicles with a Battery Switching Station: Adoption and Environmental Impact," Management Science, INFORMS, vol. 61(4), pages 772-794, April.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:apmaco:v:428:y:2022:i:c:s0096300322002892. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.