Scribd
Upload
18 views

Assignment 2

Uploaded by

Matt Ma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Assignment 2

Uploaded by

Matt Ma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ECE463/514 Assignment 2

1. Consider the queue of a bank ATM machine. Customers arrival process


can be modeled as a Markovian process that every minute, the probability
of one customer arrive is a. The customer departure process can also be
approximated as a Markovian process that every minute, the probability of
the customer (currently using the ATM machine) finishing his/her transition
and leaving is c. We can use a discrete time M/M/1 queue to analyze the
system with a = 0.1 and c = 0.2.
a) What is the probability that when a customer arrives, nobody is using the
ATM machine, i.e., queue is empty. (Hint: find out s0 )
b) What is the average waiting time of the customers using the ATM ma-
chine?
c) When a customer arrives the ATM machine, he/she will be unhappy if
there are more than 4 people standing in front of him/her. What is the per-
centage of unhappy customers?
d) We assume that all customers will decide not to use the ATM machine
if there are 4 people in the queue (including the one currently using the
machine). What is the average waiting time of the customers using the
ATM machine? (Hint: using M/M/1/B queue)

2. One packet will arrive at a router with probability a = 0.4 per time step. The
probability of the packet (currently in the server) being served and leaving
the router per time step is c = 0.5. What is the appropriate buffer size (B)
such that the packet loss ratio (L) is less than 1%.

3. At the Markov Coffee Shop, there is only one cashier. Due to the limited
space, she allows at most 3 customers to line before her at any time. In
other words, if a customer finds there are 3 customers there (including the
one currently being served by the cashier), the new arriving customer will
leave the Shop immediately (be blocked).
Every minute, the following may occur:

• one new customer arrives with probability 0.8


2k
, where k is the number
of customers in the Shop (including the one currently being served by
the cashier);
• one customer leaves the Shop with probability 0.5 after being served;

1
(a) This problem can be modeled as an M/M/1/B system. Define appro-
priate states, find the state transition probabilities, and draw the state
transition graph.
(b) After the Coffee Shop has been open for a long time (in steady state),
what is the probability that the cashier is idle, i.e., no customer in the
Shop.
(c) In steady state, calculate on the average how many customers are in
the Shop.
(d) In steady state, what is the probability that a customer is blocked. (L).

You might also like