IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/30b080a4-7564-4668-ae8a-01e80786b10c.html
   My bibliography  Save this paper

The power-series algorithm applied to the shortest-queue model

Author

Listed:
  • Blanc, J.P.C.

    (Tilburg University, School of Economics and Management)

Abstract

An iterative numerical technique for the evaluation of queue length distribution is applied to multiserver systems with queues in parallel in which customers join (one of) the shortest queues upon arrival. The technique is based on power-series expansions of the state probabilities as functions of the load of the system. The convergence of the series is accelerated by applying a modified form of the epsilon algorithm. The shortest-queue model lends itself particularly well to a numerical analysis by means of the power-series algorithm due to a specific property of this model. Numerical values for the mean and the standard deviation of the total number of customers and the waiting times in stationary symmetrical systems are obtained for practically all values of the load for systems with up to ten queues and for a load not exceeding 75% for systems with up to 30 queues. Data are also presented for systems with four queues and unequal service rates.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Blanc, J.P.C., 1989. "The power-series algorithm applied to the shortest-queue model," Other publications TiSEM 30b080a4-7564-4668-ae8a-0, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:30b080a4-7564-4668-ae8a-01e80786b10c
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/1139621/BJ5616320.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Blanc, J.P.C., 1988. "A numerical approach to cyclic-service queueing models," Research Memorandum FEW 312, Tilburg University, School of Economics and Management.
    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.
    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. 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.
    2. 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.
    3. 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.
    4. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    5. 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.
    6. van den Hout, W.B. & Blanc, J.P.C., 1994. "The Power-Series Algorithm for a Wide Class of Markov Processes," Discussion Paper 1994-87, Tilburg University, Center for Economic Research.
    7. 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.
    8. 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.
    9. Blanc, J.P.C., 1990. "Performance evaluation of polling systems by means of the power-series algorithm," Other publications TiSEM a5f5fb56-c17c-4c46-8d5e-b, Tilburg University, School of Economics and Management.
    10. van den Hout, W.B. & Blanc, J.P.C., 1994. "The power-series algorithm for Markovian queueing networks," Discussion Paper 1994-67, Tilburg University, Center for Economic Research.
    11. 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.

    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. 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.
    2. 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.
    3. 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.
    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. 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.
    6. Blanc, J.P.C., 1990. "The power-series algorithm applied to cyclic polling systems," Other publications TiSEM a12e414f-2048-4266-a7f7-9, Tilburg University, School of Economics and Management.
    7. 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.
    8. 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.
    9. Kevin Granville & Steve Drekic, 2020. "A 2-class maintenance model with dynamic server behavior," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 34-96, April.
    10. Koole, Ger & Pot, Auke, 2006. "Workload minimization in re-entrant lines," European Journal of Operational Research, Elsevier, vol. 174(1), pages 216-233, October.
    11. Blanc, J.P.C. & van der Mei, R.D., 1993. "The power-series algorithm applied to polling systems with a dormant server," Other publications TiSEM ab862d96-146f-419e-a56e-2, Tilburg University, School of Economics and Management.
    12. 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.
    13. Blanc, J.P.C., 1990. "Cyclic polling systems : Limited service versus Bernoulli schedules," Other publications TiSEM 15b29eed-4029-4465-b6ab-6, Tilburg University, School of Economics and Management.
    14. Frey, Andreas & Schmidt, Volker, 1996. "Taylor-series expansion for multivariate characteristics of classical risk processes," Insurance: Mathematics and Economics, Elsevier, vol. 18(1), pages 1-12, May.
    15. 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.
    16. Kevin Granville & Steve Drekic, 2021. "The unobserved waiting customer approximation," Queueing Systems: Theory and Applications, Springer, vol. 99(3), pages 345-396, December.
    17. 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.

    More about this item

    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:tiu:tiutis:30b080a4-7564-4668-ae8a-01e80786b10c. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.