QUEUING SYSTEMS SIMULATION EXERCISE QUEU M/M/1/10 In a queuing system M/M/1/10 with a maximum number of clients 10, including the one that is being served, we have Poisson arrivals, with average rhythm λ=0.5, λ=1, λ=1.5 clients/sec (3 cases) and exponential service with average rhythm μ=2clients/sec. With a simulation find and make the graphics: 1) The average number of clients in the system for the 3 cases of the average input rhythm λ, in the way that the system is being developed during the simulation, until a convergence's criterio. The 3 average numbers should be in graphic representations with the number of the repetitions(arrivals). 2) The possibilities of the queu's situation after the convergence (question 1) for every price of the average input rhythm. 3) The throughput of the c servant after the convergence (question 1) for every price of the input rhythm. 4) Comment the results as far as the convergence speed is concerned. 5) Compare the results of te simulation (question 1,2,3) with the results that come from the theoretic solution of the M/M/1/10 problem for the 3 prices of the average input rhythm. Use C programming language.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.