000			01754nkm a2200385Ia 4500
001			ocn888036093
003			OCoLC
005			20180530133753.0
006			m o c
007			cr cna
007			vz czazuu
008			140820s2014 xx 049 s vleng d
035			_a(OCoLC)888036093
037			_aCL0500000466 _bSafari Books Online
040			_aDLC _beng _cDLC _dSafari Books Online, LLC _dAU
049			_aAlfaisal Main Library
090			_aQA166.22
100	1		_aDoyle, Jeff.
245	1	0	_aUnderstanding the shortest path first algorithm LiveLessons _h[electronic resource] : _bnetworking talks / _cJeff Doyle.
260			_a[S.l.] : _bAddison-Wesley Professional, _cc2014.
300			_a1 streaming video file ( 48 min., 25 sec.) : _bdigital, sd., col.
490	1		_aLiveLessons
500			_aTitle from resource description page (viewed Aug. 13, 2014).
511	0		_aPresenter, 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.
650		0	_aPaths and cycles (Graph theory)
650		0	_aTrees (Graph theory)
650		0	_aAlgorithms.
655		7	_aElectronic books. _2local
710	2		_aSafari eBooks.
830		0	_aLiveLessons.
856	4	0	_uhttp://ezproxy.alfaisal.edu/login?url=http://academic.safaribooksonline.com/?uiCode=sdl&xmlId=9780133990874
942			_2lcc _cEBOOKS
994			_a02 _bUMI
264			_cc2014.
999			_c556203 _d556203