Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 3298605, 10 pages
https://doi.org/10.1155/2017/3298605
Research Article

A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

Department of Telecommunications and Information Processing, Ghent University, St. Pietersnieuwstraat 41, 9000 Gent, Belgium

Correspondence should be addressed to Dieter Fiems; eb.tnegu@smeif.reteid

Received 7 December 2016; Revised 24 February 2017; Accepted 15 March 2017; Published 2 April 2017

Academic Editor: Dario Piga

Copyright © 2017 Ekaterina Evdokimova et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. V. Malinkovskii, “Jackson networks with single-line nodes and limited sojourn or waiting times,” Automation and Remote Control, vol. 76, no. 4, pp. 603–612, 2015. View at Publisher · View at Google Scholar · View at Scopus
  2. K. Avrachenkov, E. Perel, and U. Yechiali, “Finite-buffer polling systems with threshold-based switching policy,” TOP, vol. 24, no. 3, pp. 541–571, 2016. View at Publisher · View at Google Scholar · View at Scopus
  3. T. Maertens, J. Walraevens, and H. Bruneel, “Priority queueing systems: from probability generating functions to tail probabilities,” Queueing Systems, vol. 55, no. 1, pp. 27–39, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Thomasian, “Analysis of fork/join and related queueing systems,” ACM Computing Surveys, vol. 47, no. 2, article 17, 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. W. Henderson and P. G. Taylor, “Product form in networks of queues with batch arrivals and batch services,” Queueing Systems, vol. 6, no. 1, pp. 71–87, 1990. View at Publisher · View at Google Scholar · View at Scopus
  6. D. A. Bini, G. Latouche, and B. Meini, Numerical Methods for Structured Markov Chains, Oxford University Press, 2005.
  7. G. Latouche, “Queues with paired customers,” Journal of Applied Probability, vol. 18, no. 3, pp. 684–696, 1981. View at Publisher · View at Google Scholar · View at Scopus
  8. W. J. Hopp and J. T. Simon, “Bounds and heuristics for assembly-like queues,” Queueing Systems, vol. 4, no. 2, pp. 137–155, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. K. De Turck, E. De Cuypere, S. Wittevrongel, and D. Fiems, “Algorithmic approach to series expansions around transient Markov chains with applications to paired queuing systems,” in Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS '12), pp. 38–44, October 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. E. De Cuypere, K. De Turck, and D. Fiems, “A Maclaurin-series expansion approach to multiple paired queues,” Operations Research Letters, vol. 42, no. 3, pp. 203–207, 2014. View at Publisher · View at Google Scholar · View at Scopus
  11. J. B. Lasserre, “A formula for singular perturbations of Markov chains,” Journal of Applied Probability, vol. 31, no. 3, pp. 829–833, 1994. View at Publisher · View at Google Scholar
  12. E. Altman, K. E. Avrachenkov, and R. Núnez-Queija, “Perturbation analysis for denumerable Markov chains with application to queueing models,” Advances in Applied Probability, vol. 36, no. 3, pp. 839–853, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. K. E. Avrachenkov, J. A. Filar, and P. G. Howlett, Analytic Perturbation Theory and Its Applications, SIAM, 2013. View at Publisher · View at Google Scholar
  14. W. B. van den Hout, The power-series algorithm: a numerical approach to Markov processes [Ph.D. thesis], Tilburg University, Tilburg, Netherlands, 1996.
  15. G. Koole, On the Power Series Algorithm, CWI, 1994.
  16. J. P. C. Blanc, “Performance analysis and optimization with the power-series algorithm,” in Performance Evaluation of Computer and Communication Systems, pp. 53–80, 1993. View at Google Scholar
  17. J. P. C. Blanc and R. D. van der Mei, “Optimization of polling systems with Bernoulli schedules,” Performance Evaluation, vol. 22, no. 2, pp. 139–158, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. B. Błaszczyszyn, T. Rolski, and V. Schmidt, “Light-traffic approximation in queues and related stochastic models,” in Advances in Queueing: Theory, Methods, and Open Problems, pp. 379–406, 1995. View at Google Scholar
  19. I. N. Kovalenko, “Rare events in queueing systems—a survey,” Queueing Systems, vol. 16, no. 1-2, pp. 1–49, 1994. View at Publisher · View at Google Scholar · View at Scopus