YI R alice bob Dha What nodes processeachpacket O to What nodes - - PDF document

▶
yi
SMART_READER_LITE
LIVE PREVIEW

YI R alice bob Dha What nodes processeachpacket O to What nodes - - PDF document

Apr 13, 2023 441 likes •554 views

Modifiedflood the EO deactivated = Set() on recv(pkt, ifin): if ifin in deactivated: HI return for i in interfaces: if (i !=ifin and i not in deactivated): send(pkt, i) D consider 1 I alice bob 71 1ae R alice bob consider Tht

slide-1
SLIDE 1

the

Modifiedflood

EO

HI

D

1

consider

alice

I

bob

1ae

71

bob

R

alice

Tht

consider

alice

Is

bob

Dha

YI

bob

R

alice

O

Whatnodes processeachpacket

1

to

What nodes need to

a

process

each packet

take

deactivated = Set()

  • n recv(pkt, ifin):

if ifin in deactivated: return for i in interfaces: if (i !=ifin and i not in deactivated): send(pkt, i)

slide-2
SLIDE 2

This lecture havefewer

nodes processeachpacket

Why

Scalability

Each link has alimit onthe rateat which it

can carry packets

Challenge

How toget

switchestodeliver without

flooding

hey

alicP

Header

DK

4h17 p

z 02

3

bob

R

alice

iF EE

Eats

R

slide-3
SLIDE 3

if

Learning

u t

i

i

At

eg

bob

2

table = dict()

  • n recv(p, iface):

table[p.src] = iface if p.dst in table: send(p, table[p.dst]) else: flood(p, iface)

slide-4
SLIDE 4

Et

ME

IN

ME

Howtohandle

hosts moving

I

2

y

2

tall

4

diet

Now for

something

different

HK

slide-5
SLIDE 5

notified

Enfield

A

I

I

I

n.EE

  • tefHeFLHoeHIf

1

Bet

Number of nodes between Number of nodes between

h2 h3

h2dh3

Capacity when hZsendsto Capacity when h2sendsto

hs and

hosendsto h34

hs and

hosendsto h

Can

we forward packets better

Generalized Forwarding

His

Problem

How to populate tablef

table = dict()

  • n recv(pkt, ifin):

if pkt.dst in table: send(pkt, table[pkt.dst]) else: # Drop the packet

slide-6
SLIDE 6

Q What paths tochoose

Shortest

11h11

destination

iface

it

Esl

Ht

destination

A

B

C

B

H

I

42

A

X

Y

Z

X

B

h3 12

How to compute shortest paths

Two

  • ptions

Use some extension tothe spanningtree protocol

Lab2 go

  • verthislater

Getallnodestolearntheentire

graphand

use

Dijkstra's

Go overthis first

slide-7
SLIDE 7

Protocol learn thegraph

learn neighbors

EH

9

Learn neighbors neighbor

i

Packet

id

I

nbas

El

FH

Oa

  • nboot

beastCid E3

  • nreer

1

737

A

  • nbat

Cid A

n6ns C3

b

new kid A Hors 137,1

slide-8
SLIDE 8

m.br

C3

Bit A

SFI

sendCA

yo

I

TO

d X

A

YXB

B

AC

c

B D

D

C

2J

P

id

adf.ES

add

Onboof

basepcid ads

  • nnectfdgq.dz.addCP idle

merge Cady

Rada

slide-9
SLIDE 9

Tf adz haschanged

beast

Cid ada