ee122 tas past and present give you.. transport algorithms stop and wait go back n selective...

33
Transport Algorithms & Some Router Architecture EE122 TAs past and present give you….

Upload: ami-reed

Post on 19-Jan-2018

221 views

Category:

Documents


0 download

DESCRIPTION

Alice Bob (1) ACK(1) (3) ACK(2) (2) ACK(3) (3) ACK(4) (4) ACK(5) (5) Timeout!

TRANSCRIPT

Page 1: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

Transport Algorithms &Some Router Architecture

EE122 TAs past and present give you….

Page 2: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

Today

Transport Algorithms Stop and Wait Go Back N Selective Repeat

Router Architecture Longest-Prefix-Match Head of Line Blocking

Page 3: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(i)Alice Bob

(1)ACK(1)

(3)ACK(2)

(2)

ACK(3)(3)

ACK(4)(4)

ACK(5)(5)

Timeout!

Page 4: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

Transport Algorithms

Tips and Tricks: Always draw a timing diagram when

trying to understand a new protocol! If the homework/midterm asks for how

long something takes, the timing diagram will help you calculate it.

Page 5: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(ii)Alice Bob

(1)ACK(1)

ACK(2)(2)

ACK(3)(3)

ACK(4)(4)

ACK(5)(5)

Transmission Delay for one packet: 2msPropagation Delay for one packet: 30ms

10 packets sent.

32 * 10 = 320 ms

Page 6: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iii)Alice Bob

(1)(2)

(3)1 2 3 4 5

Sliding Window

Page 7: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iii)Alice Bob

(1)(2)

(3)1 2 3 4 5ACK (1)

(4)

Sliding Window

Page 8: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iii)Alice Bob

(1)(2)

(3)1 2 3 4 5ACK (1)

ACK (2) (4)(5)

Sliding Window

Page 9: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iii)Alice Bob

(1)(2)

(3)1 2 3 4 5ACK (1)

ACK (2) (4)(5)ACK (3)

ACK (4)ACK (5)

Sliding Window

Page 10: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iii)Alice Bob

(1)(2)

(3)ACK (1)ACK (2) (4)

(5)ACK (3)

ACK (4)ACK (5)

How long did it take for the LAST packet to be ACKed back to Alice?

Page 11: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iii)Alice Bob

(1)(2)

(3)ACK (1)ACK (2) (4)

(5)ACK (3)

ACK (4)ACK (5)

How long did it take for the LAST packet to be ACKed back to Alice?

= 130ms

2ms

64ms

64ms

Page 12: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iv)Alice BobAlice Bob

(1)(2)

(3)ACK (1)ACK (2)ACK (3)

(4)(5)

….timeout!(4)(5)

ACK (4)ACK (5)

How long did it take for the LAST packet to be ACKed back to Alice?

Page 13: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(iv)Alice BobAlice Bob

(1)(2)

(3)ACK (1)ACK (2)ACK (3)

(4)(5)

….timeout!(4)(5)

ACK (4)ACK (5)

64ms

100ms

2ms

64ms

How long did it take for the LAST packet to be ACKed back to Alice?

= 230ms

Page 14: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(v)Alice Bob

(1)(2)

(3)ACK (1)ACK (2)ACK (3)

How long did it take for the LAST packet to be ACKed back to Alice?

Page 15: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(v)Alice BobAlice Bob

(1)(2)

(3)ACK (1)ACK (2)ACK (3)

(4)(5)

(4)

ACK (4)

ACK (5)

How long did it take for the LAST packet to be ACKed back to Alice?

….timeout!

Page 16: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

(v)Alice BobAlice Bob

(1)(2)

(3)ACK (1)ACK (2)ACK (3)

(4)(5)

(4)

ACK (4)

ACK (5)

How long did it take for the LAST packet to be ACKed back to Alice?

= 228ms.

….timeout!

64ms

64ms

100ms

Page 17: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

Longest Prefix Match

Tips and Tricks: Convert everything to binary first. Always match from left-to-right. Looking for the longest exact match

starting from the first bit.

Page 18: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

2)

00001000 00000000 00000000 0000000000001001 00000000 00000000 0000000000001000 11000000 11000000 0000000000001000 11000000 10000000 0000000000001000 10000000 00000000 0000000000001000 11000000 00000000 00000000

Page 19: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

2)

00001000 00000000 00000000 0000000000001001 00000000 00000000 0000000000001000 11000000 11000000 0000000000001000 11000000 10000000 0000000000001000 10000000 00000000 0000000000001000 11000000 00000000 00000000

9.8.4.56 00001001 000011000 00000100 001110002

Page 20: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

2)

00001000 00000000 00000000 0000000000001001 00000000 00000000 0000000000001000 11000000 11000000 0000000000001000 11000000 10000000 0000000000001000 10000000 00000000 0000000000001000 11000000 00000000 00000000

7.63.23.5 00000111 00111111 00010111 000001015

Page 21: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

2)

8.192.130.43 00001000 11000000 10000010 00101011

00001000 00000000 00000000 0000000000001001 00000000 00000000 0000000000001000 11000000 11000000 0000000000001000 11000000 10000000 0000000000001000 10000000 00000000 0000000000001000 11000000 00000000 00000000

1

Page 22: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

2)

00001000 00000000 00000000 0000000000001001 00000000 00000000 0000000000001000 11000000 11000000 0000000000001000 11000000 10000000 0000000000001000 10000000 00000000 0000000000001000 11000000 00000000 00000000

8.178.54.3 00001000 10110010 00110110 00000011

3

Page 23: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

2)

00001000 00000000 00000000 0000000000001001 00000000 00000000 0000000000001000 11000000 11000000 0000000000001000 11000000 10000000 0000000000001000 10000000 00000000 0000000000001000 11000000 00000000 00000000

8.192.200.1400001000 11000000 11010000 000011102

Page 24: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

2)

00001000 00000000 00000000 0000000000001001 00000000 00000000 0000000000001000 11000000 11000000 0000000000001000 11000000 10000000 0000000000001000 10000000 00000000 0000000000001000 11000000 00000000 00000000

8.0.192.0 00001000 00000000 11000000 000000001

Page 25: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

Head of Line Blocking

Tips and Tricks: Draw out your queues with the packets

in them. Cross out all of the packets that can go

across the interconnect in a single round.

Mark “1” Repeat with the remaining packets,

marking 2 after you’ve “scheduled” one round.

Repeat again: 3, 4, etc until all packets are gone.

Page 26: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3i)

(1)

(2)

(3)

(1)

(1)

(2)(3)

(3)

(3)

Page 27: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3i)

(1)

(2)

(3)

(1)

(1) (2)

(3)

(3)

(3)

(1)

Page 28: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3i)

(1)

(2)

(3)

(1)

(3)

(3)

(3)

(1,2)

Page 29: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3i)

(1)

(2)

(3)

(3)

(3)

(1,2,3,4)

Page 30: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3ii)

(1)

(2)

(3)

3

1

13

2

3

(1)

Page 31: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3ii)

(1)

(2)

(3)3

1 1

32

3

(1)

Page 32: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3ii)

(1)

(2)

(3)

1

3

3

(1,2)

Page 33: EE122 TAs past and present give you..  Transport Algorithms  Stop and Wait  Go Back N  Selective Repeat  Router Architecture  Longest-Prefix-Match

3ii)

(1)

(2)

(3)

3

(1,2,3)