DATA COMMUNICATION - KT 6134

SOLUTION EXERCISES CHAPTER 3 – FLOW & ERROR CONTROL

A stop & wait protocol is used in a half-duplex communication network with the following
characteristics: the propagation delay d is negligible, the processing time for each frame tp is
100 ms, the data rate b is 10 Mbps. Piggyback acknowledgment is assumed.

a) What is the minimum frame length l necessary to achieve a Line Utilization of 90%?

14
What is the EDR then?

LU = (2×l/b) / (2×d + 2×l/b +2×tp) = 0.9

ay i
 (1+b×tp/ l) = 1/LU

20
M d
 b×tp/ l = 1/LU – 1

he
 l = b×tp/(1/LU-1) = 10e6×100e-3/(1/0.9-1) = 9 Mbits!

EDR = 90%×10 Mbps = 9 Mbps

②
om a
C Z

b) Is this frame length reasonable? Why?

No, because of the memory buffer limitations + effect of error would be disastrous on the
d

throughput. ②
at on

Exercise 2

A pipeline protocol is used in a full-duplex satellite communication channel with the following
parameters: propagation delay of 300 ms (half way), frame processing time of 10 ms, data rate
D m

of 100 kbps, frame length of 1000 bits.

a) What should be the size of the sender window to achieve a LU of 100% when there are
Ed

no errors?
a

Ws = 2 × ((d+tp)×b/l + 1) = 2 × (310e-3 × 100e3/1000 + 1) = 64 ②

a) What is the throughput if the size of the receiver window is 1 and there are no errors
and ignoring frame overhead?
If no errors ==> all channels are fully transmitting data ==> EDR = 100 kbps
b) What is the throughput if the size of the receiver window is 1 and the BER = 10-6 ignoring
frame overhead?

Exercises - Edmond Zahedi 2014 Page 1

If we neglect the ack + control frames, the only source of overhead is the ARQ. So we need to
compute the number of frames retransmitted in every 1e6 bits = 1000 frames. ①

We know that Wr = 1  1 single error requires retransmission of Ws = 64 frames  on

 Throughput = (1000 – 63)/1000 * 100 kbps = 93.7 kbps ②

c) What shall be the size of the receiver window to achieve the best possible throughput?

14
Wr = 2 × (a + 1) = 2 × (b×d/l + 1) = 2 × (100e3×310e-3/1000 + 1) = 64

If Wr = 64  1 error results in 1 retransmission only! ②

ay i
20
M d
a) What shall be the size of the transmitter window to achieve the best possible
throughput?

he
Ws = 4 × (a + 1) -1 = 4 × (b×d/l + 1) -1 = 4 × (100e3×310e-3/1000 + 1) -1 = 128 -1 = 127 ②
om a
C Zd
at on
D m
Ed
a

Exercises - Edmond Zahedi 2014 Page 2

Exercise 3

a) Compute the FCS appended to the following data bits using the following G: x5+x2+1.

Message Data = 1 0 1 1 1 0 1 1 0 1 0 1 1 0 . Represent the data bits of the whole frame.

x5 x4 x3 x2 x1 x0
1 0 1 1 1 0 1 1 0 1 0 1 1 0 0 0 0 0 0 1 0 0 1 0 1
1 0 0 1 0 1
1 0 1 1 1 1

14
1 0 0 1 0 1
1 0 1 0 0 1
1 0 0 1 0 1

ay i
1 1 0 0 0 1

20
M d
1 0 0 1 0 1
1 0 1 0 0 1

he 1 0 0
1
1
1
1
0
1
0
0
0
0
1
0
1
1
0
0
0
0
1
1 0
R
om a
1 0 0 1 0 1
1 1 1 1 0 0
C Z

1 0 0 1 0 1
1 1 0 0 1 0
1 0 0 1 0 1
d

1 0 1 1 1
at on

Sent Frame ②

10111011010110 1 0 1 1 1
D m

①
Ed
a

Exercises - Edmond Zahedi 2014 Page 3

Verification @ receiver (remainder should be = 0):

x5 x4 x3 x2 x1 x0
1 0 1 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 1 1 0 0 1 0 1
1 0 0 1 0 1
1 0 1 1 1 1
1 0 0 1 0 1
1 0 1 0 0 1
1 0 0 1 0 1
1 1 0 0 0 1

14
1 0 0 1 0 1
1 0 1 0 0 1
1 0 0 1 0 1

ay i
20
1 1 0 0 0 1 R

M d
1 0 0 1 0 1

he 1
1
0
0
1
0
1
1
0
1
1
0
0
0
0
0
0
1
1
1
1
0
1
1
om a
1 0 0 1 0 1
1 0 0 1 0 1
C Z

0 0 0 0 0

→ R(x) = 0 → no errors have occurred!

b) Represent the message if an error occurs in the 3rd and 7th bit (from rightmost bit
which is the first one).
②
D m

10111010010010
Ed

c) Will this error be detected if an odd parity bit is used?

No because parity can't detect any occurrence of pairs of bits in error. ②

Exercises - Edmond Zahedi 2014 Page 4

d) Will this bit error be detected if the above CRC is used? Show your working.

x5 x4 x3 x2 x1 x0
1 0 1 1 1 0 1 1 0 1 0 1 0 0 1 0 0 1 1 1 0 0 1 0 1
1 0 0 1 0 1
1 0 1 1 1 1
1 0 0 1 0 1
1 0 1 0 0 1
1 0 0 1 0 1
1 1 0 0 0 1

14
1 0 0 1 0 1
1 0 1 0 0 0
1 0 0 1 0 1

ay i
20
1 1 0 1 0 1 R

M d
1 0 0 1 0 1

he 1
1
0
0
0
0
0
1
1
1
0
0
0
0
0
1
1 0 1 1
0 1 0 1
om a
0 1 1 1 1
C Z

R(x) ≠ 0  Error detected! ③

Exercises - Edmond Zahedi 2014 Page 5