CS 4380 Data Communications

Homework 3

Assigned: APRIL 22,1998

Due: April 27, 1998

 

1.Tanenbaum Problem 3.3

 

2. Two neighboring nodes (A and B) use a sliding-window protocol with a 3-bit sequence number. The Go-back-N is used with a window size of 4 for ARQ protocol. A is the transmitter and B is the receiver. Show the window positions for both A and B in the following set of events.
  1. Before A sends any frames.
  2. After A sends frames 0,1,and 2 and B acknowledges 0,1 and the ACKs are received by A.
  3. After A sends frames 3,4, and 5 and B acknowledges 4 and ACK is received by A.

 

3. Draw the timing sequence for problem 2 with the notation (Frame type, A-state, B-state, [P/F]) after each transmission of frame(s) at transmitter and receiver. Use "d" to designate the idle state of the transmitter. Mark the transmitted frame(s) with correct frame types.

 

4. Tanenbaum Problem 4.1

 

5. Tanenbaum Problem 4.3