Skip to main content
Log in

Admission control strategies for tandem Markovian loss systems

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Motivated by communication networks, we study an admission control problem for a Markovian loss system comprised of two finite capacity service stations in tandem. Customers arrive to station 1 according to a Poisson process, and a gatekeeper, who has complete knowledge of the number of customers at both stations, decides whether to accept or reject each arriving customer. If a customer is rejected, a rejection cost is incurred. If an admitted customer finds that station 2 is full at the time of his service completion at station 1, he leaves the system and a loss cost is incurred. The goal is to find easy-to-implement policies that minimize long-run average cost per unit time. We formulate two intuitive, extremal policies and provide analytical results on their performances. We also present necessary and/or sufficient conditions under which each of these policies is optimal. Next, we show that for some states of the system it is always optimal to admit new arrivals. We also fully characterize the optimal policy when the capacity of each station is two and discuss some characteristics of optimal policies in general. Finally, we design heuristic admission control policies using these insights. Numerical experiments indicate that these heuristic policies yield near-optimal long-run average cost performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall Inc, Upper Saddle River (1992)

    Google Scholar 

  2. Chang, K.-H., Chen, W.-F.: Admission control policies for two-stage tandem queues with no waiting spaces. Comput. Oper. Res. 30(4), 589–601 (2003)

    Article  Google Scholar 

  3. Cheng, M.C.: New criteria for the simplex algorithm. Math. Program. 19(1), 230–236 (1980)

    Article  Google Scholar 

  4. Cheng, M.C.: Generalized theorems for permanent basic and nonbasic variables. Math. Program. 31(2), 229–234 (1985)

    Article  Google Scholar 

  5. de Nitto Persone, V., Grassi, V.: Solution of finite QBD processes. J. Appl. Probab. 33(4), 1003–1010 (1996)

    Article  Google Scholar 

  6. Ghoneim, H.A., Stidham, S.: Control of arrivals to two queues in series. Eur. J. Oper. Res. 21(3), 399–409 (1985)

    Article  Google Scholar 

  7. Gordon, W.J., Newell, G.F.: Closed queueing systems with exponential servers. Oper. Res. 15(2), 254–265 (1967)

    Article  Google Scholar 

  8. Hordijk, A., Kallenberg, L.C.M.: Linear programming and Markov decision chains. Manag. Sci. 25(4), 352–362 (1979)

    Article  Google Scholar 

  9. Hordijk, A., Koole, G.: On the assignment of customers to parallel queues. Probab. Eng. Inf. Sci. 6(3), 495–511 (1992)

    Article  Google Scholar 

  10. Hordijk, A., Koole, G.: On the shortest queue policy for the tandem parallel queue. Probab. Eng. Inf. Sci. 6, 63–79 (1992)

    Article  Google Scholar 

  11. Kallenberg, L.C.M.: Finite state and action MDPs. In: Handbook of Markov Decision Processes. Springer, pp. 21–87 (2002)

  12. Kim, B., Kim, J.: Optimal admission control for two station tandem queues with loss. Oper. Res. Lett. 42(4), 257–262 (2014)

    Article  Google Scholar 

  13. Kim, B., Kim, J.: Equilibrium strategies for a tandem network under partial information. Oper. Res. Lett. 44(4), 532–534 (2016)

    Article  Google Scholar 

  14. Kim, C., Dudin, S.: Priority tandem queueing model with admission control. Comput. Ind. Eng. 61(1), 131–140 (2011)

    Article  Google Scholar 

  15. Ku, C.-Y., Jordan, S.: Access control to two multiserver loss queues in series. IEEE Trans. Autom. Control 42(7), 1017–1023 (1997)

    Article  Google Scholar 

  16. Ku, C.-Y., Jordan, S.: Access control of parallel multiserver loss queues. Perform. Eval. 50(4), 219–231 (2002)

    Article  Google Scholar 

  17. Ku, C.-Y., Jordan, S.: Near optimal admission control for multiserver loss queues in series. Eur. J. Oper. Res. 144(1), 166–178 (2003)

    Article  Google Scholar 

  18. Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling, vol. 5. Siam, University City (1999)

    Book  Google Scholar 

  19. Leskelä, L., Resing, J.: A tandem queueing network with feedback admission control. In: Network Control and Optimization. Springer, pp. 129–137 (2007)

  20. Li, A.A., Whitt, W.: Approximate blocking probabilities in loss models with independence and distribution assumptions relaxed. Perform. Eval. 80, 82–101 (2014)

    Article  Google Scholar 

  21. Lippman, S.A.: Applying a new device in the optimization of exponential queuing systems. Oper. Res. 23(4), 687–710 (1975)

    Article  Google Scholar 

  22. Litvak, N., van Rijsbergen, M., Boucherie, R.J., van Houdenhoven, M.: Managing the overflow of intensive care patients. Eur. J. Oper. Res. 185(3), 998–1010 (2008)

    Article  Google Scholar 

  23. Paparrizos, K., Stephanides, G., Samaras, N.: Improved criteria for identifying optimal basic and nonbasic variables in LP. J. Comput. Anal. Appl. 3(1), 75–82 (2001)

    Google Scholar 

  24. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley-Interscience, Hoboken (1994)

    Book  Google Scholar 

  25. Sheu, R.-S., Ziedins, I.: Asymptotically optimal control of parallel tandem queues with loss. Queueing Syst. 65(3), 211–227 (2010)

    Article  Google Scholar 

  26. Shi, Y., Yu, P.-L., Zhang, D.: Eliminating permanently dominated opportunities in multiple-criteria and multiple-constraint level linear programming. J. Math. Anal. Appl. 183(3), 685–705 (1994)

    Article  Google Scholar 

  27. Silva, D.F., Zhang, B., Ayhan, H.: Optimal admission control for tandem loss systems with two stations. Oper. Res. Lett. 41(4), 351–356 (2013)

    Article  Google Scholar 

  28. Spicer, S., Ziedins, I.: User-optimal state-dependent routeing in parallel tandem queues with loss. J. Appl. Probab. 43, 274–281 (2006)

    Article  Google Scholar 

  29. Stidham Jr., S., Weber, R.: A survey of Markov decision models for control of networks of queues. Queueing Syst. 13(1–3), 291–314 (1993)

    Article  Google Scholar 

  30. Ye, Y.: Eliminating columns in the simplex method for linear programming. J. Optim. Theory Appl. 63(1), 69–77 (1989)

    Article  Google Scholar 

  31. Zhang, B., Ayhan, H.: Optimal admission control for tandem queues with loss. IEEE Trans. Autom. Control 58(1), 163–167 (2013)

    Article  Google Scholar 

  32. Zhang, R., Phillis, Y.A.: Fuzzy control of arrivals to tandem queues with two stations. IEEE Trans. Fuzzy Syst. 7(3), 361–367 (1999)

    Article  Google Scholar 

  33. Ziedins, I.: A paradox in a queueing network with state-dependent routing and loss. Adv. Decis. Sci. 2007, (Article ID 68280), (2007)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel F. Silva.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Silva, D.F., Zhang, B. & Ayhan, H. Admission control strategies for tandem Markovian loss systems. Queueing Syst 90, 35–63 (2018). https://doi.org/10.1007/s11134-017-9569-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-017-9569-3

Keywords

Mathematics Subject Classification

Navigation