Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico Video |
| Idioma: | Inglés |
| Publicado: |
[Place of publication not identified] :
Addison-Wesley Professional,
©2014.
|
| Colección: | LiveLessons.
|
| Temas: | |
| Acceso en línea: | Texto completo (Requiere registro previo con correo institucional) |
MARC
| LEADER | 00000cgm a2200000Ia 4500 | ||
|---|---|---|---|
| 001 | OR_ocn888036093 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o c | ||
| 007 | cr cna|||||||| | ||
| 007 | vz czazuu | ||
| 008 | 140820s2014 xx 049 o vleng d | ||
| 040 | |a UMI |b eng |e pn |c UMI |d OCLCF |d OCLCQ |d UAB |d OCLCO |d OCLCA | ||
| 035 | |a (OCoLC)888036093 | ||
| 037 | |a CL0500000466 |b Safari Books Online | ||
| 050 | 4 | |a QA166.22 | |
| 049 | |a UAMI | ||
| 100 | 1 | |a Doyle, Jeff |c (Computer scientist) | |
| 245 | 1 | 0 | |a Understanding the shortest path first algorithm LiveLessons : |b networking talks / |c Jeff Doyle. |
| 260 | |a [Place of publication not identified] : |b Addison-Wesley Professional, |c ©2014. | ||
| 300 | |a 1 online resource (1 streaming video file (48 min., 25 sec.)). | ||
| 336 | |a two-dimensional moving image |b tdi |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a LiveLessons | |
| 500 | |a Title from resource description page (viewed Aug. 13, 2014). | ||
| 511 | 0 | |a Presenter, Jeff Doyle. | |
| 520 | |a "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. | ||
| 590 | |a O'Reilly |b O'Reilly Online Learning: Academic/Public Library Edition | ||
| 650 | 0 | |a Paths and cycles (Graph theory) | |
| 650 | 0 | |a Trees (Graph theory) | |
| 650 | 0 | |a Algorithms. | |
| 650 | 2 | |a Algorithms | |
| 650 | 6 | |a Chemins et cycles (Théorie des graphes) | |
| 650 | 6 | |a Arbres (Théorie des graphes) | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a Algorithms. |2 fast |0 (OCoLC)fst00805020 | |
| 650 | 7 | |a Paths and cycles (Graph theory) |2 fast |0 (OCoLC)fst01054987 | |
| 650 | 7 | |a Trees (Graph theory) |2 fast |0 (OCoLC)fst01156136 | |
| 830 | 0 | |a LiveLessons. | |
| 856 | 4 | 0 | |u https://learning.oreilly.com/videos/~/9780133990874/?ar |z Texto completo (Requiere registro previo con correo institucional) |
| 994 | |a 92 |b IZTAP | ||