Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Network Layer Concepts: Routing and Forwarding in IP Networks, Study notes of Engineering

A comprehensive overview of network layer concepts, focusing on routing and forwarding in ip networks. It explains the role of the network layer in transporting segments from the sending host to the receiving host, highlighting the key processes of routing and forwarding. The document delves into the ip datagram format, routing algorithms (dijkstra and bellman-ford), and the evolution of software defined networking (sdn) with openflow protocol. It also discusses the control plane and its role in managing network traffic flow.

Typology: Study notes

2023/2024

Available from 12/16/2024

mariam-ibrahim-7
mariam-ibrahim-7 🇨🇦

5 documents

1 / 20

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
!
Explicit congestion notification ECN
in the IP network
layer header there's aTos timeofservice feild two of
these bits ECN
bits
are originallyinitializedto 00 nocondition but as it travels thru network to arouter
they'llturn on 11 thenarrive to receiver so network layer notifies transport
layer which it
setsthe ECE bit goingballto source to 1then sender sendstoreur CWR 1which
confirms that cund isbeingreduced
Network layer Ch4
Networklayer transports segmentfrom
thesenting host to receivinghost
eachand
everyrouterhavethe network
protocolsrunning
sending
site the transport layersegmentsare
going
to
be
encapsulatedinto the tatagrams thentravelfromrouterto
router noweachrouters examinesthepacketheader
toknowand
decidewhere
topassit tonext then when
packetsarrive at thereceivingsidetakes
datagramand
removes packetheaderand
passsegment upto transport
layer
network
layerdoestwothings
1Rottingthis
happens
first it determines whichisthebestroute forthe packetfromsource
to
testusing
arts
2Fifwarffingmovespackets arouters input
to output
linkwhich
exit itknowsbased onthe
routing
routethats
ten
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14

Partial preview of the text

Download Network Layer Concepts: Routing and Forwarding in IP Networks and more Study notes Engineering in PDF only on Docsity!

Explicit

congestion

notification ECN

in

the IP

network

layer

header there's a

Tos

time
of

service

feild two of

these

bits ECNbits

are
originally

initialized

to

00 no

condition

but

as it

travels thru

network

to

a

router

they'llturn

on 11 thenarrive

to receiver

so

network

layer

notifies transport

layer

which

it

setsthe

ECE

bit

going

ball to

source to

1 then

sender sends

toreurCWR 1

which

confirms

that cund isbeing

reduced

Network

layer

Ch 4

Network

layer

transports segment

from

the

senting

host

to

receiving

host

each

and

every

routerhave

the

network protocols running

sending

site the

transport

layer

segments are going

to be

encapsulated into

the tatagrams

then

travelfromrouterto

router now

each

routers examines

the

packet

header

to

know and

decide whereto

pass

it to
next

then when

packets arrive at the receiving

side takes

datagram andremoves packet

header

and

pass

segment

up

to

transport

layer

network

layer

does

two

things

Rotting

this

happens first it

determines which

is

thebest

route

for

the

packet

from source

totestusing

arts

Fifwarffing

movespackets a

routers

input

to

output

link

which

exit

it

knows

based

onthe

routingroute

thats ten

Data plane

forwarding

it's
very

localeachrouter

determines

thenext

router

to

fund

it

further

to

when

the

packetcomes

in

it

looks at

the specific

packet

headerfeild

and

match

it withan entry

in the

forwarding table

to

know

which

output

to find

itto

Control

plane

it

implements

the routing

functionality

implementing the

intelligence

using

algorithms

has

individual

routing

algorithm

component

in

each

and

every

router

based on cost

8 time

Network

layer

service

model

it

only

takes packets

in

andfuts to next

hop

best

effort

service motel

no
bandwidth

loss

order

timing

garantees

routers made

as

simple as possible

Input

port

analoohuppTessorlok

into heater

felt

in the packet

out

looks

up

the

output

port using

futing

table

that

has

been installed

from

routing

processor

thats

alr

installed

in

input

memory

fut

to

switchfabric has to be

fast

enough

or it

gets

queued

Switching

fabric

transfers

packets

from
input

buffer

to

appropriate

output
buffer

Output

port

Per

ro her

Per

routeter

Forwarding

moving

packets

from

router's

input

to

appropriate

output

Destination

based

futing

Longest

prefix

matching

uses

the

longest

attress

prefix

that

matches destination

address

1

Centralized Global

LS all

routers

have complete

topology

link

costinfo

exchange

of

info

with

all

notes

accomplished

via link state

broadcast

all

nodes

have thesame

info

also

called Dijkstra

link

state

algorithm

algo

is

executed

in

each

router as

the

source

note

of direct

link

least

prev

note

just

b test

note

costpath

total

example

example

At

o

psuto

code

for Dijkstra

algo

source

of
path

not

two

outgoing

links ex

worst

case

goes
forever

Decentralized

neighbours

distance

vector

algo

Bellman

Ford

B

iterative

process of

computation

exchanging

info

with

neighbors routers

initially

only

know

link costs

to adjacent attached neighbors

Bellman

Ford

I

tell

my

neighbors

you

tell

us

thegood

news

of

shortest

path

1 cost

to neighbor

totalfrom

neighbor to

test

example

check

neighbors

n

cost from

each

n

total

cost
from

n test

find min one

from
them

good

news travel fast

dec

in cost

bad news

travel

slow

Line

in

cost

cuz 2

doesn't

know

cost

ye

x

increases
our

bad

news

until

it

gets

to 5.

which

will

thenbe

the

min

LS

vs

DV

SDN

Software Defined

Networking

Remote controller

computes

routingalgos

then installs forwarting
tables

in

routers

Generalized

funding

action isn't

just

fuding u can

fund

drop

motif or

send

to

ctrin

now

tables

are

called

flow

tables

cuz

not

is futing

anymore

Takshmathe

theft

whichone

does

it

to

that

has

used

this

route

blockinga

country

for

ex

mestiimuter

tophatqs.ie

É
c

SDN

Control

Plane

EE

L

logically

centralized

control

plane

functionality

of

routers

are

kept

very

simple

flow

tables

are

computed

by

a

central

unit

called

the

remote

controller which

establishes

these

OF

channels

to

the

control

agents

CA

the

channel

that

allows

the

remote controller

to

install

these

flow

tables

into

the

data planes

of the

routers

RC

is

in

charge of calculating all the

routes

for all

network

and

stores

network

topology

and

does

route

computations

then calls algos

computation

of

algos are

distributed

but

storage is

centralized

DV

With

traditional

routing

it's

very

hard

to

manipulate traffic flow

p

oaThkrtim

aht

take

Qm

TahETtition

SDN

control

plane

higher flexibility

of

controlling

traffic

flow but its

also

complex

so it's

open

application

hardware

interface

SDN

Controller

OS manager of all

the

hardware software components of

that

computer

system manger

of

entire SDN network

has

the

database

of

all

information

about

the

network

Missettpoons

stthorlaggeto

I

installs

flow

table

Open

Flow

protocol

open

standard

to

create a

flow

between

the

controller

andthe

switches it's

a TCP

flow

OF

controller

to

switch

reconfigor

install

OF

switch

to

controller

ack

msg

done

msg

SDN

control

plane

interaction