20092ee132B_1_hw5

20092ee132B_1_hw5 - U CLA Electrical Engineering Department...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UCLA Electrical Engineering Department EE132B HW Set #5 Professor Izhak Rubin Problem 1 Consider a selective-repeat ARQ in which the window size N is equal to 4 (i.e., the time out duration allows the transmission of four data frames, including itself). Assume that the originating node wishes to transmit 10 data frames which are labeled D1, D2, …, D10. In this particular session, frames D3, D4, D8, D10 are retransmitted once, while Frame D2 is retransmitted three times. Other frames do not require retransmission. Draw a simple time diagram demonstrating the correct sequence of events, identifying the timeout threshold used. Problem 2 In a sequence of frame transmissions, data frame D0 has just been positively acknowledged. Four more frames – D1, D2, D3, and D4 – are transmitted. The next returned transmission, received after D4 has been transmitted, is a negative acknowledgement to D2. Assume that this implicitly acknowledges any previously transmitted but unacknowledged data frames. a. What action does a go-back-N protocol take?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/12/2010 for the course EE 132B taught by Professor Izhakrubin during the Spring '09 term at UCLA.

Page1 / 2

20092ee132B_1_hw5 - U CLA Electrical Engineering Department...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online