An algorithmic approach of retrial queuing system with one serving station. Part I: The description of the simulation algorithm

Authors

  • I. Florea Transilvania University of Brasov, Romania
  • C.-S. Nanau Transilvania University of Brasov, Romania

Keywords:

retrial queuing system, simulation algorithm, polynomial complexity

Abstract

Many systems in the real world are modeled by retrial queuing systems. Analytical formulas for this class of systems are complicated and address only particular cases. By algorithmic approach, one studies through simulation the cases that are not studied analytically. It is shown that the given algorithm has polynomial complexity.

Author Biographies

I. Florea, Transilvania University of Brasov, Romania

Faculty of Mathematics and Informatics, Department of Computer Science

C.-S. Nanau, Transilvania University of Brasov, Romania

Department of Computer science

Downloads

Published

2014-01-16

Issue

Vol. 6(55) No. 2 (2013)

Section

INFORMATICS