+7 (495) 957-77-43

T-Comm_Article 8_6_2020

Извините, этот техт доступен только в “Американский Английский”. For the sake of viewer convenience, the content is shown below in the alternative language. You may click the link to switch the active language.

APPROXIMATION OF THE AVERAGE WAITING TIME FOR THE HE2/HE2/1 QUEUING SYSTEM USING SIMULATION

DOI: 10.36724/2072-8735-2020-14-6-53-60

Kada,Othmane,  PSUTI, Samara, Russia, otman2333@mail.ru

Abstract
In this article we present a simulation based method to approximate the average waiting time for the queuing system (QS) HE2/HE2/1 , Which is by Kendall’s definition belonging to the class G/G/1, with probabilistic Mixing Distribution of second order hypererlangian distribution inputs for both inter arrival and service time functions Our methods consists of creating a virtual model of Traffic flows ,first by using different methods and algorithms of generating random numbers from hypererlangian distribution using a random variate generator and a Discrete event simulator based on a queuing system (QS) of type HE2/HE2/1 then use the results to analyse the behavior of the system during different etapes of execution , The results obtained for the average waiting time from our simulation method are very identical to our theoretical results ,in the end this work leads us to evaluate accuracy of our theoretical methods. and to collect a big data-set that can be used for other proprieties to find a solution for real problems of modern teletraffic theory.

Keywords: discrete event simulator, queuing  system, hypererlangian,average waiting time.

References

  1. Kleinrock (1976). Queueing Systems: Theory. Wiley. 448 p.
  2. N. Tarasov. (2016). Analysis of queues with hyperexponential arrival distributions. Problems of Information Transmission. Vo. 52. No.1, pp.14-23. DOI:10.1134/S0032946016010038
  3. N. Tarasov. (2018). Analysis and comparison of two queueing systems with hypererlangian input distributions. Radio Electronics, Computer Science, Control. Vol. 47. No.4, pp.61-70. DOI 10.15588/1607-3274-2018-4-6 (in Russian)
  4. N. Tarasov, E.G. Akhmetshina, O. Kada. (2019). Properties of hyperexponential and hypererlangian distributions. PIC S&T’2019.
  5. Health Services and Delivery Research. 3.20. Chapter 5. Bookshelf ID: NBK293948.
  6. G/G/1 Queueing Systems, John C.S. Lui.
  7. Smmer, Discrete-Event Simulation for R, https://r-simmer.org.
  8. distr, Object Oriented Implementation of Distributions. http://distr.r-forge.r-project.org/
  9. Roberta Briesemeister and Antônio G.N. Novaes. Comparing an Approximate Queuing Approach withSimulation for the Solution of a Cross-Docking Problem DOI 4987127.
  10. Queue Simulation theory,The theoretical study of waiting lines https://www.austincc.edu/akochis/COSC2415/queue-sim.htm.
  11. Sanjay K. Bose, Simulation Techniques for Queues and Queueing Networks.
  12. Heriot-Watt University, Simulation and Queueing Theory.
  13. Jinsung Choi. Simulation of controlled queuing systems and its application to optimal resource management in multiservice cellular networks.
    14. J E Beasley, simulation. http://people.brunel.ac.uk/ ~mastjjb/jeb/or/sim.htm.

Information about author:

Kada Othmane, PhD student, PSUTI, Samara, Russia