|
|
|
|
| LEADER |
01907nmm a2200361 u 4500 |
| 001 |
EB001952866 |
| 003 |
EBX01000000000000001115768 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 050 |
|
4 |
|a QA166.22
|
| 100 |
1 |
|
|a Doyle, Jeff
|
| 245 |
0 |
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 streaming video file (48 min., 25 sec.)
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Chemins et cycles (Théorie des graphes)
|
| 653 |
|
|
|a Algorithms / http://id.loc.gov/authorities/subjects/sh85003487
|
| 653 |
|
|
|a Arbres (Théorie des graphes)
|
| 653 |
|
|
|a Paths and cycles (Graph theory) / http://id.loc.gov/authorities/subjects/sh85098695
|
| 653 |
|
|
|a Algorithmes
|
| 653 |
|
|
|a Paths and cycles (Graph theory) / fast / (OCoLC)fst01054987
|
| 653 |
|
|
|a Trees (Graph theory) / http://id.loc.gov/authorities/subjects/sh85137259
|
| 653 |
|
|
|a algorithms / aat
|
| 653 |
|
|
|a Algorithms / fast / (OCoLC)fst00805020
|
| 653 |
|
|
|a Trees (Graph theory) / fast / (OCoLC)fst01156136
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 490 |
0 |
|
|a LiveLessons
|
| 500 |
|
|
|a Title from resource description page (viewed Aug. 13, 2014)
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/videos/~/9780133990874/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 000
|
| 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
|