BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI

Hyderabad Campus
Second Semester 2010-2011
Course Title
Test
Time
Max Marks : 60

: Communication Networks
Course Number
: ECE C394
: Test-1(Closed Book) - Makeup
: 5.30 6.20 PM
Date: 07/03/11
Note: Attempt all questions
Day: Monday

--------------------------------------------------------------------------------------------------------------------Question 1:
a) Calls arriving to a telephone exchange with c trunk lines follow Poisson process. What is
the condition on the offered load a, such that the blocking probability is minimum. You
may use the following appropriately.
(3M)

b) What are the minimum blocking probability and the offered load for such an exchange
with 40 trunks?
(3M)
c) What is the maximum arrival rate for such an exchange with 50 trunks and
corresponding blocking probability?
(4M)
Question 2:
Explain where the following fit into the OSI Model. Give appropriate reasons.
a)
b)
c)
d)

A 4 Khz analog connection across a telephone network

A 33.6 Kbps modem connection across a telephone network
A 64 Kbps digital connection across a telephone network
A 64 MB file transfer from source A to Destination B

(1M)
(1M)
(1M)
(2M)

Question 3:
a) To transfer a file from server to a client, the server breaks it into blocks of 512 bytes and
adds a header of 60 bytes. Find the efficiency of transmission for a Stop-and-Wait
protocol, in transmitting a 10MB file over a 10 Mbps Ethernet LAN that has a diameter
of 500 meters. The ack frames are 64 Byte long. Assume a signal propagation speed of 5
micro seconds per kilometer over the Ethernet cables.
(6M)
b) Compare the efficiency of a Go-Back-N protocol if a 3 bit sequence numbering is used
for the problem in bit a).
(6M)
c) Comment on the reasons for the difference in the results.
(3M)

Question 4:
Let g1(D) = D+1 and g2(D) = D3+D2+1. Let the information bits be [ 1 1 0 1 1 0].
a) Find the code word if g1(D) is used. Can the use of g1(D) help in detecting single, double
and triple errors ?
(3M)
b) Repeat bit a) with g2(D)
(3M)
c) Find the code word corresponding to a generator polynomial formed as a product of
g1(D) and g2(D). Comment on detection of single, double and triple errors?
(4M)

Question 5:
A message of size m bits to be transmitted over a L hop path, in a store and - forward packet
network, a series of N consecutive packets, each containing k bits of data and header of h bits.
Assume that m >> k+h. The transmission rate of each of the link is R bits/second. Propagation
and queuing delays are negligible.
a)
b)
c)
d)

What is the total number of bits to be transmitted ?

What is the total delay experienced by the message?
What value of k minimizes the total delay ?
Plot the nature of optimal number of data bits as a function of header bits.

(2M)
(4M)
(6M)
(3M)

Question 6:
a) Obtain a condition on the number of input lines for the first stage sub switch of a multi
stage non-blocking switch, for the number of cross points to be minimum.
(3M)
b) If the total number of input lines is 512, how many intermediate switches exists for this
non-blocking switch.
(2M)