There is a series combination of two queues in WAPDA’s office for new domestic connection. Any customer who applies for a new connection is fed to Queue 1. If the application is successful, the customer is sent out of the network, otherwise he/she has to go through a problem correction queue (i.e. Queue 2) and then is looped back to Queue 1 again. If the maximum number of customers allowed in the network at any given time are 4: (a) Identify number of unique states in the network (b)If the incoming rate in queue i follows a Poisson process with rate λi and the services rate is exponential distributed with rate μi, draw the complete state transition diagram for the network (c) Show that for each of the two queues, the state transition graph (STG) of the equivalent continuous time Markov chain is equivalent to the reachability graph of the corresponding stochastic petri net
Answers
Answered by
0
Answer:
Complete Step by Step Answer:
The falling object is subjected to the opposition force from the air surrounding it and it is termed as air resistance. ... Therefore, as the air resistance is more, the sheet of paper falls slower than one that is crumpled into a ball.
Similar questions