IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v94y2020i1d10.1007_s11134-019-09636-9.html
   My bibliography  Save this article

Analysis of the shortest relay queue policy in a cooperative random access network with collisions

Author

Listed:
  • M. Saxena

    (Eindhoven University of Technology)

  • I. Dimitriou

    (University of Patras)

  • S. Kapodistria

    (Eindhoven University of Technology)

Abstract

The aim of this work concerns the performance analysis of systems with interacting queues under the join the shortest queue policy. The case of two interacting queues results in a two-dimensional random walk with bounded transitions to non-neighboring states, which in turn results in complicated boundary behavior. Although this system violates the conditions of the compensation approach due to the transitions to non-neighboring states, we show how to extend the framework of the approach and how to apply it to the system at hand. Moreover, as an additional level of theoretic validation, we have compared the results obtained with the compensation approach with those obtained using the power series algorithm and we have shown that the compensation approach outperforms the power series algorithm in terms of numerical efficiency. In addition to the fundamental contribution, the results obtained are also of practical value, since our analysis constitutes a first attempt toward gaining insight into the performance of such interacting queues under the join the shortest queue policy. To fully comprehend the benefits of such a protocol, we compare its performance to the Bernoulli routing scheme as well as to that of the single relay system. Extensive numerical results show interesting insights into the system’s performance.

Suggested Citation

  • M. Saxena & I. Dimitriou & S. Kapodistria, 2020. "Analysis of the shortest relay queue policy in a cooperative random access network with collisions," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 39-75, February.
    • Handle: RePEc:spr:queues:v:94:y:2020:i:1:d:10.1007_s11134-019-09636-9
    DOI: 10.1007/s11134-019-09636-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-019-09636-9
    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-019-09636-9?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. Blanc, J.P.C. & van der Hout, W., 1995. "Development and justification of the power-series algorithm for BMAP-systems," Other publications TiSEM 52264619-7960-46b6-9f5b-1, Tilburg University, School of Economics and Management.
    2. B. M. Rao & M. J. M. Posner, 1987. "Algorithmic and approximation analyses of the shorter queue model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 381-398, June.
    3. Gertsbakh, Ilya, 1984. "The shorter queue problem: A numerical study using the matrix-geometric solution," European Journal of Operational Research, Elsevier, vol. 15(3), pages 374-381, March.
    4. J. P. C. Blanc, 1992. "The Power-Series Algorithm Applied to the Shortest-Queue Model," Operations Research, INFORMS, vol. 40(1), pages 157-167, February.
    5. Grassmann, WK, 1980. "Transient and steady state results for two parallel queues," Omega, Elsevier, vol. 8(1), pages 105-112.
    6. Wojciech Szpankowski, 1988. "Stability Conditions for Multidimensional Queueing Systems with Computer Applications," Operations Research, INFORMS, vol. 36(6), pages 944-957, December.
    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. Danielle Tibi, 2019. "Martingales and buffer overflow for the symmetric shortest queue model," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 153-190, October.
    2. P. Patrick Wang, 2000. "Workload distribution of discrete‐time parallel queues with two servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(5), pages 440-454, August.
    3. Plinio S. Dester & Christine Fricker & Danielle Tibi, 2017. "Stationary analysis of the shortest queue problem," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 211-243, December.
    4. J. P. C. Blanc, 1992. "The Power-Series Algorithm Applied to the Shortest-Queue Model," Operations Research, INFORMS, vol. 40(1), pages 157-167, February.
    5. 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.
    6. Nur Sunar & Yichen Tu & Serhan Ziya, 2021. "Pooled vs. Dedicated Queues when Customers Are Delay-Sensitive," Management Science, INFORMS, vol. 67(6), pages 3785-3802, June.
    7. B. M. Rao & M. J. M. Posner, 1987. "Algorithmic and approximation analyses of the shorter queue model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 381-398, June.
    8. Zhang, Zhongju & Daigle, John, 2012. "Analysis of job assignment with batch arrivals among heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 217(1), pages 149-161.
    9. Partha Chakroborty & Rahul Gill & Pranamesh Chakraborty, 2016. "Analysing queueing at toll plazas using a coupled, multiple-queue, queueing system model: application to toll plaza design," Transportation Planning and Technology, Taylor & Francis Journals, vol. 39(7), pages 675-692, 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. Blanc, J.P.C., 1990. "Performance evaluation of polling systems by means of the power-series algorithm," Research Memorandum FEW 459, Tilburg University, School of Economics and Management.
    12. 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.
    13. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    14. Yina Lu & Andrés Musalem & Marcelo Olivares & Ariel Schilkrut, 2013. "Measuring the Effect of Queues on Customer Purchases," Management Science, INFORMS, vol. 59(8), pages 1743-1763, August.
    15. Boronico, Jess S. & Siegel, Philip H., 1998. "Capacity planning for toll roadways incorporating consumer wait time costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 297-310, May.
    16. Chaithanya Bandi & Dimitris Bertsimas & Nataly Youssef, 2018. "Robust transient analysis of multi-server queueing systems and feed-forward networks," Queueing Systems: Theory and Applications, Springer, vol. 89(3), pages 351-413, August.
    17. van den Hout, W.B. & Blanc, J.P.C., 1994. "The power-series algorithm for Markovian queueing networks," Other publications TiSEM 1312893d-c375-4b17-bbbe-3, Tilburg University, School of Economics and Management.
    18. Dieter Fiems & Balakrishna Prabhu & Koen Turck, 2013. "Analytic approximations of queues with lightly- and heavily-correlated autoregressive service times," Annals of Operations Research, Springer, vol. 202(1), pages 103-119, January.
    19. Chaithanya Bandi & Nikolaos Trichakis & Phebe Vayanos, 2019. "Robust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems," Management Science, INFORMS, vol. 65(1), pages 152-187, January.
    20. Kevin Granville & Steve Drekic, 2021. "The unobserved waiting customer approximation," Queueing Systems: Theory and Applications, Springer, vol. 99(3), pages 345-396, December.

    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:94:y:2020:i:1:d:10.1007_s11134-019-09636-9. 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.