Scribd
Upload
14 views2 pages

Tut 1

This document provides a tutorial sheet covering various topics in communication networks. It includes 10 questions related to circuit switching capacity, ATM header CRC calculation, stop-and-wait protocol throughput, frame transmission probabilities, polynomial multiplication properties, expected times for stop-and-wait transmissions, frame error probabilities, references to communication network textbooks, and determining the optimal packet size to minimize total delay.

Uploaded by

20ELB355 MOHAMMAD ESAAM
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
14 views2 pages

Tut 1

This document provides a tutorial sheet covering various topics in communication networks. It includes 10 questions related to circuit switching capacity, ATM header CRC calculation, stop-and-wait protocol throughput, frame transmission probabilities, polynomial multiplication properties, expected times for stop-and-wait transmissions, frame error probabilities, references to communication network textbooks, and determining the optimal packet size to minimize total delay.

Uploaded by

20ELB355 MOHAMMAD ESAAM
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

TUTORIAL SHEET I - 2023

ELC4410
COMMUNICATION NETWORKS
1. Suppose users share a 50 Mbps link and each user requires 1000 Kbps when it is active. Also,
each user is inactive 75 % of the time and transmits 25 % of time. (i) With circuit
switching how many users can be supported. (ii) Now consider packet switching with 50
users. What is the probability that exactly 10 users are active?
2. ATM uses an eight bit CRC on the information contained in the header. The header has
six fields: First 4 bits GFC field, Next 8 bits VPI field, Next 16 bits VCI field, Next 3 bits
Type field, Next 1 bit CLP field, Next 8 bits CRC
(i) The CRC is calculated using the following polynomial x 8  x 2  x  1 .
Find the CRC bits if the GFC, VPI, Type and CLP fields are all zero and VCI
field is 01214. Assume the GFC bits correspond to the highest order bits in the
polynomial.
(ii) Can the code detect single errors? Explain why?
3. A stop-and-wait protocol uses acks and time-outs only. The ack arrives at the transmitter
at time ts after the frame transmission. Take tout > ts. Frames are all of length tf and are
always available for transmission. A frame is received in error for probability p. Find the
maximum frame throughput.
4. Assume that frame transmission times  are exponential with pdf f()=e-, for ≥0.
Assume that a new frame always starts in each direction as soon as the previous one in
that direction terminates. Assume that transmission times are all independent and that
processing and propagation delays are negligible. Show that the probability q that a given
frame is not acked before n – 1 additional frames heave been sent is q = (1+n)2-n.
5. Let g ( x)  x L  g L1 x L1    g1 x  1 (assume that L>0). Let z(x) be a nonzero
polynomial with highest and lowest order terms of degree j and i, respectively; that is,
z ( x)  x j  z j 1 x j 1    x i [or z ( x)  x j , if i  j ]. Show that g(x)z(x) has at least
two nonzero terms
6. (a) Let Tf be the expected transmission time for sending a data frame. Let Tr be the
feedback transmission time for sending an ack or nak frame. Let Tp be the expected
propagation and processing delay in one direction (same in each direction). Find the
expected time T between successive frame transmissions in a stop-and-wait system
(assume that there are no other delays and that no frames get lost). (b) Let pf be the
probability of frame error in a data frame (independent of frame length), and pr the
probability of error in a feedback ack or nak frame. Find the probability q that a data
packet is correctly received and acked on a given transmission. Show that 1/q is the
expected number of times a packet must be transmitted for a stop-and-wait system.
7. 5.18 ‘Communication Networks’ by Leon Garcia
8. 5.22,
9. 5.67
10. Suppose that x bits of user data are to be transmitted over a k hop path in a packet
switched network as a series of packets, each containing p data bits and h header bits,
with x >> p + h. The bit rate of the lines is b bps and the propagation delay is negligible.
What value of p minimizes the total delay?

You might also like