Scribd
Upload
88 views

Assign1 PDF

This document contains 6 questions about modeling and analyzing telecommunications networks. Question 1 asks to derive the Erlang C formula for the probability of all servers being busy in an M/M/N/∞ queue. Question 2 compares the average system time and variance of waiting time for packet traffic under statistical multiplexing versus separate channels. Question 3 gives a formula for the steady state probabilities in an M/M/1 queue where arrival and service rates depend on the number of customers.

Uploaded by

Prathiksha Ravishankar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
88 views

Assign1 PDF

This document contains 6 questions about modeling and analyzing telecommunications networks. Question 1 asks to derive the Erlang C formula for the probability of all servers being busy in an M/M/N/∞ queue. Question 2 compares the average system time and variance of waiting time for packet traffic under statistical multiplexing versus separate channels. Question 3 gives a formula for the steady state probabilities in an M/M/1 queue where arrival and service rates depend on the number of customers.

Uploaded by

Prathiksha Ravishankar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ELEC 6171 Modelling and Analysis of

Telecommunications Networks
Assignment 1
1. For the M/M/N/∞ system, the probability that an arrival will find all servers busy and will be forced
to wait in queue is an important measure of performance of the M/M/N/∞ system. This probability
is given by
P0 ρN
PQ =
N !(1 − ρ/N )
and is known as the Erlang C formula. Please derive the equation. What is the expected number of
customers waiting in the queue (not in service)?
2. A communication line is divided in two identical channels each of which will serve a packet traffic
stream where all packets have equal transmission time T and equal interarrival time R > T . Consider,
alternatively, statistical multiplexing of the two traffic streams by combining the two channels into a
single channel with transmission time T /2 for each packet. Show that the average system time of a
packet will be decreased from T to something between T /2 and 3T /4, while the variance of waiting
time in queue will be increased from 0 to as much as T 2 /16.
3. Consider a system which is the same as M/M/1 except that the rate λn and service rate µn when there
are n customers in the system depend on n. Show that
Pn+1 = (ρ0 , . . . , ρn )P0
where
ρk = λk /µk+1
X∞
P0 = [1 + (ρ0 · · · ρk )]−1 .
k=0

4. One hundred voice sources are multiplexed at an ATM access buffer. Each voice source has an average
talk spurt length of 0.8sec. Its average silent interval is 1.2sec.
(a) What is the probability that a voice source is in talk spurt?
(b) When in talk spurt, a source generates ATM cells at the rate of 100 cells/sec. Find the link
capacity CL , in cells/sec, if the link utilization ρ is to be set at 0.7.
(c) Determine the overload region for the 100 sources, based on (b) above.
(d) Fluid analysis is used to size the buffer. Approximate the survivor function by the G(x) ≈ e−rx .
What is r in this case if the unit of x is cells.
5. A communication line capable of transmitting at a rate of 50kbits/sec will be used to accommodate
10 sessions each generating Poisson traffic at a rate 150 packets/min. Packet lengths are exponentially
distributed with mean 1000 bits.
For each session, find the average number of packets in queue, the average number in the system, and
the average delay per packet when the line is allocated to the sessions by using

1
(a) 10 equal-capacity time-division multiplexed channels;
(b) statistical multiplexing.

6. Write down your own understanding of the differences among Public Switching Telephone Network
(PSTN), Internet and ATM.

You might also like