ps3_ee550_fall08

ps3_ee550_fall08 - UNIVERSITY OF SOUTHERN CALIFORNIA, FALL...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: UNIVERSITY OF SOUTHERN CALIFORNIA, FALL 2008 1 EE 550: Problem Set # 3 Due: Wednesday Sept. 24, 2008 I. BOOK PROBLEMS Book Problem 2 . 16 , 2 . 18 , 2 . 19 , 2 . 20 , and 2 . 21 . II. PROOFS OF CORRECTNESS Consider a modified version of Go-Back-n, as follows: The receiver keeps RN ( t ) values as before, but in order to reduce power expenditure at the receiver, it only transmits requests when the RN requested value is a multiple of k for some integer k . (That is, it transmits requests only for RN ( t ) { ,k, 2 k, 3 k, 4 k,... } ). The sender does the same algorithm as before, but ensures that it repeatedly, and in order, transmits: { SN min ( t ) ,SN min ( t ) + 1 ,...,SN min ( t ) + n- 1 } . It then goes back and repeats the same order, and so on, until it receives an error-free RN message requesting something larger than SN min ( t ) . a) Show that SN min ( t ) RN ( t ) SN min ( t ) + n . b) Prove that the algorithm is correct if k = n . Hint: To prove liveness, suppose that RN = i at a particular time t . Show that RN...
View Full Document

This note was uploaded on 12/21/2010 for the course EE 550 taught by Professor Neely during the Fall '08 term at USC.

Ask a homework question - tutors are online