1 / 7

6.033 Lecture 10 Layering and Reliability

slides: http ://mit.edu/6.033/www/assignments/lec10.pdf. Key Ideas: 3 Layer Network At least once delivery At most once delivery Sliding window protocol. 6.033 Lecture 10 Layering and Reliability. Quiz 1 Scores. March 8, 2010. End-to-end Interface. Src

nat
Télécharger la présentation

6.033 Lecture 10 Layering and Reliability

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. slides: http://mit.edu/6.033/www/assignments/lec10.pdf • Key Ideas: • 3 Layer Network • At least once delivery • At most once delivery • Sliding window protocol 6.033 Lecture 10Layering and Reliability Quiz 1 Scores March 8, 2010

  2. End-to-end Interface Src conn=open_stream(dest,port) send(conn,bytes1) send(conn,bytes2) close_stream(conn) Dest conn= listen(port) bytes=recv(conn)

  3. RTT Is Variable

  4. Exponentially Weighted Moving Average (EWMA) measure = new RTT measurement rtt = α(measure) + (1-α)(rtt) ; α = 1/8 timeout = β * rtt ; β = 2

  5. 6 a2 p2 Sliding Window in Action window = 1-5 window = 2-6 4 3 2 1 5 Sndr a1 Rcvr p1

  6. 6 7 a3 a2 p2 p3 Sliding Window in Action window = 2-6 window = 3-7 4 3 2 1 5 Sndr a1 Rcvr p1 Send next packet as acks arrive, rather than waiting for all acks in window

  7. 7 6 a4 a3 a5 a2 p5 p4 p2 p3 Still may wait idle idle idle window = 2-3 window = 1-2 window = 3-4 4 3 2 1 5 Sndr a1 Rcvr p1

More Related