Blocking and Deadlocking Phenomena in Two-Server Tandem Configuration with Optional Feedback – Modeling and Parameter Sensitivity Investigation

  • Walenty OniszczukEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9842)


Tandem queues provide good mathematical models of computer systems and networks, and their detailed examination is important for theory and applications. The study presented in this paper is based on performance analysis of a two-server computer network with blocking and deadlocking. New, practical results provided describe performance of a three-node Markovian queuing network with finite capacity buffers. The results highlight an area where measures of effectiveness, such as Quality of Service (QoS) are essential. In conclusion, a two-dimensional state graph is constructed, followed by a set of steady-state equations along with their probabilities for each of the states.


Tandem queues Feedback Deadlock Blocking probability 


  1. 1.
    Arivudainambi, D., Poongothai, V.: Analysis of a service facility with cross trained servers and optional feedback. Int. J. Oper. Res. 18(2), 218–237 (2013)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Atencia, I.: A discrete-time system with service control and repairs. Int. J. Appl. Math. Comput. Sci. 24(3), 471–484 (2014)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Balsamo, S., De Nito Persone, V., Onvural, R.: Analysis of Queueing Networks with Blocking. Kluwer Academic Publishers, Boston (2001)zbMATHCrossRefGoogle Scholar
  4. 4.
    Clo, M.C.: MVA for product-form cyclic queueing networks with blocking. Ann. Oper. Res. 79, 83–96 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Economou, A., Fakinos, D.: Product form stationary distributions for queueing networks with blocking and rerouting. Queueing Syst. 30(3/4), 251–260 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Gemikonakli, E., Mapp, G., Gemikonakli, O., Ever, E.: Exploring service and buffer management issues to provide integrated voice and data services in single and multi-channel wireless networks. In: 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA), pp. 1056–1063. IEEE Conference Publications (2013). doi: 10.1109/AINA.2013.57
  7. 7.
    Itoh, H., Fukumoto, H., Wakuya, H., Furukawa, T.: Bottom-up learning of hierarchical models in a class of deterministic POMDP environments. Int. J. Appl. Math. Comput. Sci. 25(3), 597–615 (2015)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Kim, C.S., Klimenok, V., Tsarenkov, G., Breuer, L., Dudin, A.: The BMAP/G/1-> ∙/PH/1/M tandem queue with feedback and losses. Perform. Eval. 64, 802–818 (2007)CrossRefGoogle Scholar
  9. 9.
    Kwiecień, J., Filipowicz, B.: Firefly algorithm in optimization of queueing systems. Bull. Pol. Acad.: Tech. 60(2), 363–368 (2012)Google Scholar
  10. 10.
    Malekian, R., Abdullah, A.H., Ye, N.: Novel packet queuing algorithm on packet delivery in mobile internet protocol version 6 networks. Appl. Math. Inf. Sci. 7(3), 881–887 (2013)CrossRefGoogle Scholar
  11. 11.
    Martin, J.B.: Large tandem queueing networks with blocking. Queueing Syst. 41(1/2), 45–72 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Oniszczuk, W.: Quality of service requirements in computer networks with blocking. In: Saeed, K., Pejas, J. (eds.) Information Processing and Security Systems, pp. 245–254. Springer Science+Business Media, New York (2005)CrossRefGoogle Scholar
  13. 13.
    Oniszczuk, W.: Modeling of dynamical flow control procedures in closed type queuing models of a computer network with blocking. Automat. Contr. Comput. Sci. 39(4), 60–69 (2005)Google Scholar
  14. 14.
    Oniszczuk, W.: Tandem models with blocking in the computer subnetworks performance analysis. In: Saeed, K., Pejas, J., Mosdorf, R. (eds.) Biometrics, Computer Security Systems and Artificial Intelligence Applications, pp. 259–267. Springer Science+Business Media, New York (2006)CrossRefGoogle Scholar
  15. 15.
    Oniszczuk, W.: Blocking and deadlock factors in series linked servers with HOL priority feedback service. Pol. J. Environ. Stud. 16(5B), 145–151 (2007)Google Scholar
  16. 16.
    Oniszczuk, W.: Analysis of an open linked series three-station network with blocking. In: Pejas, J., Saeed, K. (eds.) Advances in Information Processing and Protection, pp. 419–429. Springer Science+Business Media, New York (2007)CrossRefGoogle Scholar
  17. 17.
    Oniszczuk, W.: An intelligent service strategy in linked networks with blocking and feedback. In: Nguyen, N.T., Katarzyniak, R. (eds.) New Challenges in Applied Intelligence Technologies. SCI, vol. 134, pp. 351–361. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  18. 18.
    Oniszczuk, W.: Semi-Markov-based approach for analysis of open tandem networks with blocking and truncation. Int. J. Appl. Math. Comput. Sci. 19(1), 151–163 (2009)zbMATHCrossRefGoogle Scholar
  19. 19.
    Oniszczuk, W.: Analysis of linked in series servers with blocking, priority feedback service and threshold policy. Int. J. Comput. Syst. Sci. Eng. 5(1), 1–8 (2009)Google Scholar
  20. 20.
    Oniszczuk, W.: Loss tandem networks with blocking analysis – a semi-Markov approach. Bull. Pol. Acad.: Tech. 58(4), 673–681 (2010)zbMATHGoogle Scholar
  21. 21.
    Oniszczuk, W.: Open tandem networks with blocking analysis – two approaches. Control Cybern. 43(1), 111–132 (2014)MathSciNetzbMATHGoogle Scholar
  22. 22.
    Onvural, R.: Survey of closed queuing networks with blocking. Comput. Surv. 22(2), 83–121 (1990)CrossRefGoogle Scholar
  23. 23.
    Perros, H.G.: Queuing Networks with Blocking. Exact and Approximate Solution. Oxford University Press, New York (1994)zbMATHGoogle Scholar
  24. 24.
    Raghavendran, Ch.V., Naga Satish, G., Rama Sundari, M.V., Suresh Varma, P.: Tandem communication network model with DBA having non homogeneous Poisson arrivals and feedback for first node. Int. J. Comput. Technol. 13(9), 4922–4932 (2014)CrossRefGoogle Scholar
  25. 25.
    Sunitha, G.P., Kumar, S.M.D., Kumar, B.P.V.: A pre-emptive multiple queue congestion control for different traffic classes in WSN. In: 2014 International Conference on Circuits, Communication, Control and Computing, pp. 212–218. IEEE Conference Publications (2014). doi: 10.1109/CIMCA.2014.7057793
  26. 26.
    Tikhonenko, O., Kempa, W.M.: On the queue-size distribution in the multi-server system with bounded capacity and packet dropping. Kybernetika 49(6), 855–867 (2013)MathSciNetzbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2016

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (, which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  1. 1.Faculty of Computer ScienceBialystok University of TechnologyBialystokPoland

Personalised recommendations