Scrigroup - Documente si articole

Username / Parola inexistente      

Home Documente Upload Resurse Alte limbi doc  


AccessAdobe photoshopAlgoritmiAutocadBaze de dateCC sharp
CalculatoareCorel drawDot netExcelFox proFrontpageHardware
HtmlInternetJavaLinuxMatlabMs dosPascal
PhpPower pointRetele calculatoareSqlTutorialsWebdesignWindows
WordXml

AspAutocadCDot netExcelFox proHtmlJava
LinuxMathcadPhotoshopPhpSqlVisual studioWindowsXml

Single-area OSPF

linux

+ Font mai mare | - Font mai mic



DOCUMENTE SIMILARE

Trimite pe Messenger
mv linux command
pwck linux command
dip linux command
merge linux command
stty linux command
The Point-to-Point Protocol
makedbm linux command
rexecd linux command
Comenzi Interne Linux
basename linux command


Single-area OSPF




Link-state distance vector routing protocol

distance vector:

copies of routing table neighbor

Bellman-Ford algorithms

not exact topology

link-state:

full knowledge

Dijkstras algorithm (SPF)

exact topoloy

1) hello info + LSAs to build a topological database

2) SPF algorithm tree of the network

3) shortest routes routing table

OSPF operation

Hello protocol

Hellos: every 10s

Multicast address 224.0.0.5

Elects DR and BDR

LSAs



Describe all of the router links

Link-state database

SPF algorithm

To calculate a loop free logical topology to every known network

Routing table

Shortest path with the lowest cost

Hello protocol

same hello and dead intervals

Router ID

highest local active IP address

Loopback interface

to ensure OSPF stability (if there is no active interface, the OSPF process will not start)

if configured, it is used as Router ID (highest loopback IP address)

DR

highest OSPF priority (broadcast default: priority = 1)

OSPF priorities = same DR = highest router ID

Priorities can be set: 0 to 255

BDR

second highest priority

OSPF cost metric

OSPF cost may be calculated using the formula 108/bandwidth






Politica de confidentialitate



DISTRIBUIE DOCUMENTUL

Comentarii


Vizualizari: 276
Importanta: rank

Comenteaza documentul:

Te rugam sa te autentifici sau sa iti faci cont pentru a putea comenta

Creaza cont nou

Termeni si conditii de utilizare | Contact
© SCRIGROUP 2022 . All rights reserved

Distribuie URL

Adauga cod HTML in site