Scribd
Upload
15 views

Assignment 3 - Data Link Layer - CH 11 Error and Flow Management

This document contains an assignment on data link layer error and flow management with 12 questions. The assignment covers topics like stop-and-wait ARQ, go-back-N ARQ, selective-repeat ARQ, and calculating optimal frame lengths.

Uploaded by

Mostafa Magdy
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
15 views

Assignment 3 - Data Link Layer - CH 11 Error and Flow Management

This document contains an assignment on data link layer error and flow management with 12 questions. The assignment covers topics like stop-and-wait ARQ, go-back-N ARQ, selective-repeat ARQ, and calculating optimal frame lengths.

Uploaded by

Mostafa Magdy
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

Due on Monday, Feb 5th

Assignment 3
Data Link Layer - Error and Flow
Management CH 11
Hint: Please check the Text book (Mischa Schwartz)

1. Using 5-bit sequence numbers, what is the maximum size of the send and receive windows for
each of the following protocols?
a) Stop-and-Wait ARQ
b) Go-Back-NARQ
c) Selective-Repeat ARQ

2. For the behavior of Stop-and-Wait ARQ at the sender site. What does it mean?
a) Sn = 0
b) Sn = 1
c) Changing from Sn = 0 to Sn = 1
d) Changing from Sn = 1 to Sn = 0

3. For the behavior of Stop-and-Wait ARQ at the receiver site. What does it mean?
a) Rn = 0
b) Rn = 1
c) Changing from Rn = 0 to Rn = 1
d) Changing from Rn = 1 to Rn = 0

4. For Stop-and-Wait ARQ. What does it mean?


a) Sn = 1 and Rn = 0 then changing to Sn = 1 and Rn = 1
b) Sn = 1 and Rn = 1 then changing to Sn = 0 and Rn = 1
c) Sn = 0 and Rn = 1 then changing to Sn = 0 and Rn = 0
d) Sn = 0 and Rn = 0 then changing to Sn = 1 and Rn = 0

5. The timer of a system using the Stop-and-Wait ARQ Protocol has a time-out of 6 ms. Draw the
flow diagram for four frames if the round-trip delay is 4 ms. Assume no data frame or control
frame is lost or damaged.

6. Repeat the previous problem if the time-out is 4 ms and the round-trip delay is 6.

7. Repeat Problem 11 if the first frame (frame 0) is lost.

8. A system uses the Stop-and-Wait ARQ Protocol. If each packet carries 1000 bits of data, how
long does it take to send 1 million bits of data if the transmission rate is 1000,1000 b/s, the
distance between the sender and receiver is 5000 Km and the propagation speed is 200,000
Km/s? Ignore the overhead due to the header and trailer, Ack transmission, waiting, and
processing delays. We assume no data or control frame is lost or damaged.

9. Repeat the previous problem using the Go-back-N ARQ Protocol with a window size of 7 and
consider the worst case, we send a full window of size 7 and then wait for the acknowledgment
of the whole window.

10. Repeat the previous problem using the Selective-Repeat ARQ Protocol with a window size of
4.

1/2
11. Calculate the optimal frame length and plot the normalized data throughput rate for the Go-
Back-N protocol as a function of the packet length for the following cases:
a) 𝑙 ′ = 48 bits, the link length is 1500 Km, the propagation speed is 150000 Km/sec,
processing delay is 30 m sec, 𝑝𝑏 = 10−5 , 𝐶 = 1200 bps. Bit errors are independently
distributed. Let 𝑡𝑜𝑢𝑡 = 2𝑡𝑝 + 𝑡𝑝𝑟𝑜𝑐 + 2𝑡𝐼 for more safety with processing time included
in the propagation delay.
b) Repeat for 𝐶 = 9600 bps.

𝑙′
12. If (𝑙 ′ + 𝑙) 𝑝𝑏 << 1, then 𝑝~ (𝑙 ′ + 𝑙) 𝑝𝑏 and 𝑙𝑜𝑝𝑡 = √𝑝 − 𝑙 ′ . Calculate the optimal frame
𝑏
length and the data throughput rate for the Go-Back-N protocol for the following cases:
a) 𝑙 ′ = 48 bits, the link length is 300 Km, the propagation speed is 150000 Km/sec,
processing delay is negligible, 𝑝𝑏 = 10−5 , 𝐶 = 1200 bps.
b) Repeat for 𝐶 = 9600 bps.

2/2

You might also like