Documente Academic
Documente Profesional
Documente Cultură
RIP
Routing Information Protocol
Istorie
RIP
RIP v1
RIP v2
RIP v2
STUDIU DE CAZ
Response messages
Mesaj de raspuns
RIPv2
Network Address
Net-mask
Next-hop IP Address
Metric
RIPv2
IP address
Gateway
Interface
Metric
Timer
1.
Initializarea:
2.
RIPv2
3.
4.
5.
RIPv2
Probleme
Nr maxim de hopuri 15
STUDIU DE CAZ
#1 pachetele de la RB ajung in N1
prin RA cu un cost de 2
#2, legatura RA - N1 cedeaza. RA
schimba costul catre N1 la 16 (RIP
infinity).
RIPv2
Count to
Infinity
OSPF
Open Shortest Path First
Istorie
ISTORIE
Link
O interfata a routerului
Link state
Denumiri
uzuale
Idee
2.
3.
Functionare
OSPF
LSA Message
Router OSPF
Link State
Database LSD
Routing Table
Network
Algorithm
SPF
Dijkstra
LSA Message
broadcast
Next Hop
Metric
Etape ale
OSPF
(simplificat)
Etape ale
OSPF
(simplificat)
Etape ale
OSPF
(simplificat)
STUDIU DE CAZ
1
1
3
2
f
D
e
2
Link State
Database
Link State
Announcement
(LSA)
STUDIU DE CAZ
b
1
1
3
2
Tratarea
problemelor
Routerele A si B trimit
informatii catre toate
nodurile despre link-ul a
si conectivitatea este
refacuta
Bringing up Adjacency
Sincronizarea bazei de date prin compararea
numarului secventei
Interesting records numerele de secventa sunt
diferite
Se stabileste o reletie client - server mai intai
Designated
Router (DR)
Shortest
Path
Algorithm
STUDIU DE CAZ
Shortest
Path
Algorithm
R1
R2
R3
R4
R5
R6
R7
R8
R9
R10
R11
R12
N1
N2
N3
N4
N6
N7
N8
N9
N10
N11
N12
N13
N14
N15
R1 R2 R3 R4 R5 R6 R7 R8 R9R10R11R12 N3 N6 N8 N9
0
0
6
0
8
0
8
6 6
8
7
5
6
0
0
0
7
0 0
0
0
0
3
3
1 1 1 1
2
1 1
1
4
3 2
1
1 1
2
3
8
2
8
8
9
28
STUDIU DE CAZ
STUDIU DE CAZ
Shortest Path
Tree si Tabela de
R6
Routare R6
R5
N12 N13
N14
N4
R3 R10
R3
R3
R3
R3
R10
R10
R10
R10
R10
R10
10
10
7
8
8
12
10
11
13
14
RT5
RT7
RT5
RT10
6
8
N3
R4
R2
R1
N2
N1
R7
N6
N8
R11
R8
N12
N9
N7
R9
R12
N11
N10
N15
Tipuri de
routere
OSPF
Intra-area Route
Routere interne unei zone
Inter-area Route
Routere ce comunica intre zone (arii) prin ABR
External Route
Rute importate in OSPF prin alte protocoale
Tipuri de
routere
OSPF
(exemplu)
Common header
Hello protocol
Exchange protocol
Protocoale
OSPF
Flooding protocol
5 tipuri de pachete
1 hello
2 database description
3 link state request
4 link state update
5 link state ACK
Mesaje OSPF
Foloseste protocolul IP
protocol number 89
Hello:
Database Description:
Mesaje OSPF
updated al LSDB.
Mesaj de raspuns la request
broadcast sau multicast in mod regulat
Link State
Advertisement
(LSA)
source identification
sequence number
link state age
list of neighbors
The
Common
Header
hello packet (
type = 1 )
Description
packet ( type
=2)
Description
packet ( type
=2)
request
packet ( type
=3)
update
packet ( type
=4)
Link State
Update
Link State
ACK, type = 5
Avantaje
Concluzii
Dezavantaje
calculul SPF
foarte complex / necesita multe optimizari