ECE487 Assignment 4- Stop-and-Wait ARQ protocol Solved

30.00 $

Category:
Click Category Button to View Your Next Assignment | Homework

You'll get a download link with a: zip solution files instantly, after Payment

Securely Powered by: Secure Checkout

Description

5/5 - (3 votes)

Note: normally the timer value of an ARQ protocol is much more than the round-trip propagation delay (which is the summation of the propagation delay from the sender to the receiver and the propagation delay from the receiver to the sender). In Q1~Q3 of this assignment, we consider some extreme cases when the timer value is less than the round-trip propagation delay. In other words, the timer value is not appropriately set. We assume that the maximal number of retransmissions for each frame is infinite. Please note that the procedure in Q1~Q3 is NOT endless.

  1. The timer of a system using the Stop-and-Wait ARQ protocol has a time-out of 3 ms. The round trip propagation delay is 4 ms. We ignore other delay (and therefore, the transmission time of a frame can be infinitely small). Draw a flow diagram similar to Fig. 11.11 on Slide 32 of Lecture 4 for delivery of two data frames. Assume that from the network layer, the request for the first data frame arrives at time instant 0 ms and the request for the second data frame arrives immediately after the first ACK frame for the first data frame is received at the sender. Also assume the first transmission attempt of the first data frame is corrupted. All subsequent data frame and ACK frame transmissions are successful.
  2. Repeat Question 1 when Go-back-N ARQ is used and we assume that from the network layer, the request for the first and the second data frame arrive at time instant 0 ms and 1 ms, respectively. The number of bits in a sequence number is m=2. We still assume that the first transmission attempt of the first data frame is corrupted, and all subsequent data frame and ACK frame transmissions are successful.
  3. Repeat Question 1 when Selective Repeat ARQ is used and we assume that from the network layer, the request for the first and the second data frame arrive at time instant 0 ms and 1 ms, respectively. The number of bits in a sequence number is m=2. Different from Question 1, we assume that the first transmission attempt of the second data frame is corrupted. All other transmissions are successful.

 

 

 

  • Assign4_sol-fnmt8k.zip