Tutorial Question 7
Assume a system having an incremental log on transactions W, S, T and U with immediate
updates has the following log entries, ending with a system crash.
<W, starts>
<W, X, 1, 5>
<S, starts>
<S, Z, 8, 12>
<S, commits>
<U, starts>
<W, Y
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
2010-11 Sem-A EE3313 Applied Queueing Systems
Tutorial 7 Erlang Delay Systems, Delay-Loss Systems
1. For a network with a very large customer base, calls arrive into a multiplexor of 16
out
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
EE3313 Applied Queueing Systems
Tutorial 5 Basic Concepts in Teletraffic and Queueing Theory
1. Some circuits have been measured to carry the following traffic during the last hour.
On aver
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
EE3313 Applied Queueing Systems
Tutorial 2 Distributions, Mean and Variance
1. Consider an experiment of tossing a die with 6 sides. Assume that the die is fair,
i.e., each side has the sam
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
EE3313 Applied Queueing Systems
Tutorial 1 Conditional Probability and Random Variables
1. Consider the experiment to be tossing a coin.
(a) What is the Sample Space?
(b) What are the event
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
EE3313 Applied Queueing Systems
Tutorial 6 TCP, D/D/1, D/D/2, M/M/k/k, M/M/
1. A packet is being transmitted between its source and its destination. Due to the
fact that the packet may be l
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
EE3313 Applied Queueing Systems
Tutorial 4 Poisson Random Variable (RV) and Process
1. Earthquakes in a certain city occur according to a Poisson process with a rate of 1
per 30 years. Find
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
EE3313 Applied Queueing Systems
Tutorial set 7: Markovian Loss and Delay Models and M/G/1
1.
A typical subscriber generates 2 calls within a peak hour and the average call
holding time is
2014-2015 Sem-A EE3313 Applied Queuing Systems Test
Question 1 (22 marks)
a. Write the innite series which give the probability of more than n customers in an M/M/1
queueing system.
Find an expression for the innity series? (Hint: see the Equation List)
[
2010-2011 Sem-A EE3313 Applied Queuing Systems ANSWERS to Test Even Seat
Question 1 ANSWERS Simulation (10 marks), Non-Pure-Chance System (11 marks)
a. In your simulations of an M/D/1 queueing system, you have 36 simulation runs for
= 0.8 with xed servic
2014-2015 Sem-A EE3313 Applied Queuing Systems ANSWERS to Test
Question 1 ANSWERS M/M/1; Erlang Loss; M/M/n, M/G/1 (22 marks)
a. For an M/M/1 queue, the probability that there are more than n customers in the system:
P (i) = (1 )i for M/M/1 ; we wish to n
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
EE3313 Applied Queueing Systems
Tutorial 3 Probability Distributions
1. Find the probability of finding 2 busy subscribers out of a total of 20 subscribers,
where the probability that a giv
MC questions for Unit 2
Red color indicates the correct answer.
=
Question 1
Transmission media are usually categorized as _.
fixed or unfixed
guided or unguided
determinate or indeterminate
metallic or nonmetallic
Question 2
The radio communication spect
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
2010-11 Sem-A EE3313 Applied Queueing Systems
Tutorial 6 Erlang Loss Systems
1.
A typical subscriber generates 2 calls within a peak hour and the average call
holding time is around 1.5 mi
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
2010-11 Sem-A EE3313 Applied Queueing Systems
Tutorial 5 M/M/1, M/D/1, M/M/, M/G/1, M/G/1 with priority
1. Data are arriving into a multiplexor according to a Poisson process with an averag
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
2010-11 Sem-A EE3313 Applied Queueing Systems
Tutorial 4 D/D/1, D/D/n
1. For the D/D/1 queue:
Draw the arrivals and departures; the system size, queue size versus time when
< .
Draw the
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
2010-11 Sem-A EE3313 Applied Queueing Systems
Tutorial 3 Basic Concepts for Teletrac
1. Some monitored circuits have been shown to carry the following loads during the
last hour. On average
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
2010-11 Sem-A EE3313 Applied Queueing Systems
Tutorial 2 Probability Distributions
1. Find the mean and the variance of the values of a fair Dice with 9-side.
2. Sketch pdf and CDF of a fai
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
2010-11 Sem-A EE3313 Applied Queueing Systems
Tutorial 1 Conditional Probability and Random Variables
1. Similar to the problem in the lecture note, however the incidence of lung cancer for
City University of Hong Kong
Dept of Electronic Engineering
Simulations: Overview and Examples
last revised: 10/2013
Simulations: Overview and Examples
1
City University of Hong Kong
Dept of Electronic Engineering
Contents
Why Simulation?
Steps in Simul
City University of Hong Kong
Dept of Electronic Engineering
EE3313 Applied Queuing Systems
Non-Pure-Chance Loss Systems
last revised: 11/2013
Non-Pure-Chance Loss Systems
1
City University of Hong Kong
Dept of Electronic Engineering
Contents
Hayward Appr
CITY UNIVERSITY OF HONG KONG
DEPARTMENT OF ELECTRONIC ENGINEERING
20092010 Sem-A EE3313 Applied Queueing Systems Test
Question 1 (20 marks)
/a./Packetized data streams arrive into a router according to a Poisson process with an
average rate of 20 packets
Test Canvas https:/cportal.cityu.edu.hk/webapps/assessment/do/authorinymodi f.
lon
WW> W>W> ESTCAWAS
Add modify, and remove questions Select a question type from the Add Question drop-down list and click Go to
add questions Use Creation Settings to establ
Test Canvas https:/eportal.cityucduhk/webappslassessmentldo/authoring/modifyAs.
lof3
W>W>W>ESTWAS
.u.
1 Test Canvas
Add, modify, and remove questions. Select a question type from the Add Question drop-down list and click Go to add
questions. Use Creatio
EE3313 Applied Queueing Systems
19-2-2016
Student Name: _
Student ID: _
Quiz Number 3
Question:
Consider a population of 30 customers in a restaurant. The probability that each one of the
customers wishes to use the phone at any point in time is 0.1. The
EE3313 Applied Queueing Systems
26-2-2016
Student Name: _
Student ID: _
Quiz Number 4
Question:
Consider a city where major earthquakes occur according to a Poisson process with rate one
every 25 years. Assume that you live in this city, and you consider
EE3313 Applied Queueing Systems
15-1-2016
Student Name: _
Student ID: _
Quiz Number 1
Question:
Suppose that you play the Monty Hall problem in a game show. What is
your probability to win the car if you swap?
Answer:
The probability to win the car if I s
EE3313 Applied Queueing Systems
4-3-2016
Student Name: _
Student ID: _
Quiz Number 5
Question:
Calculate the carried traffic in units of erlangs of a system that carries 5 calls per hour and the
average holding time is 3 minutes.
Answer:
3 [minutes] = 3/6