Question

Consider a single-server queueing system with arrival and service details as: Interarrival times: 3, 2, 6,...

Consider a single-server queueing system with arrival and service details as: Interarrival times: 3, 2, 6, 2, 4, 5 Service times: 2, 5, 5, 8, 4, 5 Prepare a table show below for the given data. Stop simulation when the clock reaches 20. Write a Java program, to implement this single-server queueing system, print out the table shown below: You should create a future event list in your Java code, and print out the contents of FE list in each loop. Clock LQ(t) LS(t) B MQ Future Event List B: total server busy time MQ: maximum queue length LS(t): the number of customers being served (0 or 1) at time t. LQ(t): the number of customers in the waiting queue Also, output the following statistics information when simulation stops: 1.average number of customers in queue 2.average delay in queue 3.Server utilization The answer should look like: Single-server queueing system simulation Interarrival times: 3, 2, 6, 2, 4, 5 Service times: 2, 5, 5, 8, 4, 5 Simulation Ending Time: 20 Clock LQ LS B MQ FE List 0 0 0 0.0 0 (1,3) (3,20) 3 0 1 0.0 0 (2,5) (1,5) (3,20) 5 0 0 2.0 0 (1,5) (3,20) 5 0 1 2.0 0 (2,10) (1,11) (3,20) 10 0 0 7.0 0 (1,11) (3,20) 11 0 1 7.0 0 (1,13) (2,16) (3,20) 13 1 1 9.0 1 (2,16) (1,17) (3,20) 16 0 1 12.0 1 (1,17) (3,20) 17 1 1 13.0 1 (3,20) Average delay in queue 0.75 minutes Average number in queue 0.30 Server utilization 0.80 Number of delays completed 4

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Queueing networks have been used to model the performance of a variety of complex systems. Since exact results exist for only a limited class of networks, the decomposition methodology has been used extensively to obtain approximate results. In this paper, we consider open queueing networks with multiple product classes, deterministic routings and general arrival and service distributions. We examine the decomposition method for such systems and show that it provides estimates of key parameters with an accuracy that is not acceptable in many practical settings. Recognizing this weakness, we enrich the approach by modeling a phenomenon previously ignored. We consider interference among products and describe its effect on the variance of the departure streams. The recognition of this effect significantly improves the performance of this methodology. We provide extensive experimental results based on the data of a manufacturer of semiconductor devices.

Add a comment
Know the answer?
Add Answer to:
Consider a single-server queueing system with arrival and service details as: Interarrival times: 3, 2, 6,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Assume that a single-server queueing system has a Poisson interarrival process with a rate of 10 customers per hour.

     Problem 3: Assume that a single-server queueing system has a Poisson interarrival process with a rate of 10 customers per hour. Also, assume that the service time is exponential with at a rate of 12 customers per hour. Answer the following questions to 3 significant digits: a) What is the expected utilization of the server? b) What is the log-run time average of number of customers in the system? c) Using Little's law, use the answer from part (b) to calculate the average waiting...

  • Consider a queueing system with 4 servers, exponentially distributed interarrival and serviceies and a queue with...

    Consider a queueing system with 4 servers, exponentially distributed interarrival and serviceies and a queue with a capacity of 1 customer. The arrival rate is 8 customers per hour, and each server has a service rate of 3 customers per hour Determine the steady-state probabilities pa, i 0,1,2,.5, of having i customers in the systm The probabilities should be given as decimals and might be rouded to four digits after the deeimal point

  • Customer Interarrival times Arrival times 1 4 2 2 3 3 4 1 5 2 Discrete Event Si...

    Customer Interarrival times Arrival times 1 4 2 2 3 3 4 1 5 2 Discrete Event Simulation, Hand simulation Table. The system is idle at time=0. Please determine the arrival times of the customers, respectively. Then, fill the values into the table above. Thanks.

  • Problem 1 Given the data below for a single-server single-queue system, find the following performance measures....

    Problem 1 Given the data below for a single-server single-queue system, find the following performance measures. Customer Arrival Time Service Time (min) Time Customer Waits in Queue (min) Time Customer spends in System (min) Idle Time of Server (min) 04 0) Average Waiting Time (11) Probability of a customer to be waiting (i.e., number of waiting customers over total number of customers) (II) Probability of idle server (i.e., proportion of idle time over total running time) (iv) Average Service Time...

  • Question 1 Simulate the operation of a first-in-first-out queuing system until time TE = 30 minutes,...

    Question 1 Simulate the operation of a first-in-first-out queuing system until time TE = 30 minutes, using the interarrival and service-times given below (in minutes) in the given order. Interarrival times: 4, 3, 1, 1, 5, 7, 10 Service times: 4, 4, 6, 9, 8, 7, 4, 6 Given that the first arrival occurs at time t = 0, create a record of hand simulation (on the table given in the last page) using the event-scheduling algorithm and compute the...

  • Jobs arrive at a single-CPU computer facility with interarrival times the are IID exponential ran...

    Jobs arrive at a single-CPU computer facility with interarrival times the are IID exponential random variables with mean 1 minute. Each job specifies upon arrival the maximum amount of processing time it requires, and the maximum times for successive jobs are IID exponential random variable with mean 1.1 minutes. However, if m is the specified maximum processing time for a particular job, the actual processing time is distributed uniformly between 0.55m and 1.05m. The CPU will never process a job...

  • 3. For a single-server, single-line, single-phase waiting line system, where l represents the mean arrival rate...

    3. For a single-server, single-line, single-phase waiting line system, where l represents the mean arrival rate of customers and m represents the mean service rate, what is the formula for the average utilization of the system? a) l / m b) l / (m-l) c) l2 / m(m-l) d) 1 / (m-l) e) l / m(m-l) 4. For a single-server, single-line, single-phase waiting line system, where l represents the mean arrival rate of customers and m represents the mean service...

  • 1) Consider a (MMI3GDk(oo) queueing system with k-4, an arrival rate 2 -3, and a service rate a) ...

    helpp 1) Consider a (MMI3GDk(oo) queueing system with k-4, an arrival rate 2 -3, and a service rate a) Nicely draw the rate diagram for this queueing system (similar to Figures 9 and 10, page 1065, in b) Explicitly write the system of differential equations for the birth-death process corresponding to μ = 3/2· your textbook). this queueing system (see your class notes). You need to write k+1 differential equations, one for each the states of the system. c) Solve...

  • Problem 8: 10 points Consider a queuing system M/M/1 with one server. Customer arrivals form a...

    Problem 8: 10 points Consider a queuing system M/M/1 with one server. Customer arrivals form a Poisson process with the intensity A 15 per hour. Service times are exponentially distributed with the expectation3 minutes Assume that the number of customers at t-0, has the stationary distribution. 1. Find the average queue length, (L) 2. What is the expected waiting time, (W), for a customer? 3. Determine the expected number of customers that have completed their services within the 8-hour shift

  • Consider a simple queuing system in which customers arrive randomly such that the time between successive...

    Consider a simple queuing system in which customers arrive randomly such that the time between successive arrivals is exponentially distributed with a rate parameter l = 2.8 per minute. The service time, that is the time it takes to serve each customer is also Exponentially distributed with a rate parameter m = 3 per minute. Create a Matlab simulation to model the above queuing system by randomly sampling time between arrivals and service times from the Exponential Distribution. If a...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT