Understanding the shortest path first algorithm LiveLessons : networking talks /

"Understanding the Shortest Path First (SPF) Algorithm LiveLessons-Networking Talks explains basic SPF calculation through a combination of bullet points and whiteboard demonstrations. The lessons also demonstrate how SPF takes into account Equal-Cost MultiPath (ECMP) and multi-access links suc...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Doyle, Jeff (Computer scientist)
Formato: Electrónico Video
Idioma:Inglés
Publicado: [Place of publication not identified] : Addison-Wesley Professional, ©2014.
Colección:LiveLessons.
Temas:
Paths and cycles (Graph theory)
Trees (Graph theory)
Algorithms.
Algorithms
Chemins et cycles (Théorie des graphes)
Arbres (Théorie des graphes)
Algorithmes.
algorithms.
Acceso en línea:Texto completo (Requiere registro previo con correo institucional)
Descripción
Sumario:"Understanding the Shortest Path First (SPF) Algorithm LiveLessons-Networking Talks explains basic SPF calculation through a combination of bullet points and whiteboard demonstrations. The lessons also demonstrate how SPF takes into account Equal-Cost MultiPath (ECMP) and multi-access links such as Ethernet. By understanding SPF calculations, engineers can better understand and troubleshoot Link State protocols."--Resource description page.
Notas:Title from resource description page (viewed Aug. 13, 2014).
Descripción Física:1 online resource (1 streaming video file (48 min., 25 sec.)).

Ejemplares similares