IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v277y2019i2d10.1007_s10479-017-2636-7.html
   My bibliography  Save this article

Light-traffic analysis of random access systems without collisions

Author

Listed:
  • Dieter Fiems

    (Ghent University)

  • Tuan Phung-Duc

    (University of Tsukuba)

Abstract

We consider a retrial queueing model for random access protocols arising in local area networks such as carrier sense multiple access networks. In our model, one channel is shared among multiple nodes. Each node accesses the channel according to a Poison process and the holding time of the channel is exponentially distributed. Blocked users join the orbit and retry to access again after an exponentially distributed time depending on the number of retrials so far. As the model under study is not amenable for exact analysis, we focus on its performance in the light traffic regime. In particular, we describe a fast algorithm for calculating the terms in the Maclaurin series expansion of various performance measures, the arrival rate being the independent parameter of the expansion. We illustrate our approach by various numerical examples and verify the accuracy of the light traffic approximation by means of simulation.

Suggested Citation

  • Dieter Fiems & Tuan Phung-Duc, 2019. "Light-traffic analysis of random access systems without collisions," Annals of Operations Research, Springer, vol. 277(2), pages 311-327, June.
    • Handle: RePEc:spr:annopr:v:277:y:2019:i:2:d:10.1007_s10479-017-2636-7
    DOI: 10.1007/s10479-017-2636-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2636-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/s10479-017-2636-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. Langaris, Christos & Dimitriou, Ioannis, 2010. "A queueing system with n-phases of service and (n-1)-types of retrial customers," European Journal of Operational Research, Elsevier, vol. 205(3), pages 638-649, September.
    2. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power- Series Algorithm," Papers 9347, Tilburg - Center for Economic Research.
    3. van den Hout, W.B., 1996. "The power-series algorithm : A numerical approach to Markov processes," Other publications TiSEM ad00ca29-7daf-4bdb-b994-c, Tilburg University, School of Economics and Management.
    4. Blanc, J.P.C. & van der Mei, R.D., 1992. "Optimization of polling systems with Bernoulli schedules," Research Memorandum FEW 563, Tilburg University, School of Economics and Management.
    5. Yun Bae & Kyung Kim & Mi-Nam Moon & Bong Choi, 2008. "Analysis of IEEE 802.11 non-saturated DCF by matrix analytic methods," Annals of Operations Research, Springer, vol. 162(1), pages 3-18, September.
    6. Velika I. Dragieva, 2016. "Steady state analysis of the M/G/1//N queue with orbit of blocked customers," Annals of Operations Research, Springer, vol. 247(1), pages 121-140, December.
    7. Yang Song & Zaiming Liu & Yiqiang Q. Zhao, 2016. "Exact tail asymptotics: revisit of a retrial queue with two input streams and two orbits," Annals of Operations Research, Springer, vol. 247(1), pages 97-120, December.
    8. Falin, G. I. & Artalejo, J. R., 1998. "A finite source retrial queue," European Journal of Operational Research, Elsevier, vol. 108(2), pages 409-424, July.
    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. Dieter Fiems, 2024. "Performance of a Synchronisation Station with Abandonment," Mathematics, MDPI, vol. 12(5), pages 1-12, February.
    2. Velika I. Dragieva & Tuan Phung-Duc, 2020. "A finite-source M/G/1 retrial queue with outgoing calls," Annals of Operations Research, Springer, vol. 293(1), pages 101-121, October.

    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. Anatoly Nazarov & János Sztrik & Anna Kvach & Ádám Tóth, 2020. "Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs," Annals of Operations Research, Springer, vol. 288(1), pages 417-434, May.
    2. Blanc, J.P.C., 1996. "Optimization of Periodic Polling Systems with Non-Preemptive, Time-Limited Service," Discussion Paper 1996-63, Tilburg University, Center for Economic Research.
    3. Dieter Fiems, 2024. "Performance of a Synchronisation Station with Abandonment," Mathematics, MDPI, vol. 12(5), pages 1-12, February.
    4. Anatoly Nazarov & János Sztrik & Anna Kvach & Tamás Bérczes, 2019. "Asymptotic analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs," Annals of Operations Research, Springer, vol. 277(2), pages 213-229, June.
    5. Blanc, J.P.C., 1998. "The power-series algorithm for polling systems with time limits," Other publications TiSEM 3366bad3-964d-4039-82cc-a, Tilburg University, School of Economics and Management.
    6. Velika I. Dragieva & Tuan Phung-Duc, 2020. "A finite-source M/G/1 retrial queue with outgoing calls," Annals of Operations Research, Springer, vol. 293(1), pages 101-121, October.
    7. Shaul K. Bar-Lev & Hans Blanc & Onno Boxma & Guido Janssen & David Perry, 2013. "Tandem Queues with Impatient Customers for Blood Screening Procedures," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 423-451, June.
    8. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    9. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    10. Blanc, J.P.C. & Lenzini, L., 1995. "Analysis of communication systems with timed token protocols using the power-series algorithm," Discussion Paper 1995-100, Tilburg University, Center for Economic Research.
    11. Gaury, E.G.A., 2000. "Designing pull production control systems : Customization and robustness," Other publications TiSEM c9b49495-f647-4583-b2ef-0, Tilburg University, School of Economics and Management.
    12. Haque, Lani & Armstrong, Michael J., 2007. "A survey of the machine interference problem," European Journal of Operational Research, Elsevier, vol. 179(2), pages 469-482, June.
    13. Gong, X., 2001. "Empirical studies on the labor market and on consumer demand," Other publications TiSEM eed29455-f1bf-4cc3-aff5-c, Tilburg University, School of Economics and Management.
    14. Stremersch, S., 2001. "Essays on marketing strategy in technology-intensive markets," Other publications TiSEM 51d17923-2aae-485b-a59b-5, Tilburg University, School of Economics and Management.
    15. van den Hout, W.B. & Blanc, J.P.C., 1994. "The Power-Series Algorithm for a Wide Class of Markov Processes," Other publications TiSEM 54b74f52-9378-47b9-aa0f-5, Tilburg University, School of Economics and Management.
    16. Blanc, J.P.C., 2009. "Bad luck when joining the shortest queue," European Journal of Operational Research, Elsevier, vol. 195(1), pages 167-173, May.
    17. I. Padmavathi & A. Shophia Lawrence & B. Sivakumar, 2016. "A finite-source inventory system with postponed demands and modified M vacation policy," OPSEARCH, Springer;Operational Research Society of India, vol. 53(1), pages 41-62, March.
    18. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power-Series Algorithm," Other publications TiSEM a1a4fc9c-dcb5-4679-9ef1-e, Tilburg University, School of Economics and Management.
    19. Girndt, T., 2000. "Cultural diversity and work-group performance : Detecting the rules," Other publications TiSEM 79060da1-f8e7-45e5-bb6b-8, Tilburg University, School of Economics and Management.
    20. Anatoly Nazarov & János Sztrik & Anna Kvach & Ádám Tóth, 2022. "Asymptotic Analysis of Finite-Source M/GI/1 Retrial Queueing Systems with Collisions and Server Subject to Breakdowns and Repairs," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1503-1518, September.

    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:annopr:v:277:y:2019:i:2:d:10.1007_s10479-017-2636-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.