國立高雄大學圖資館 |

Language: English

Back

OSPFa network routing protocol /

SpringerLink (Online service)

OSPFa network routing protocol /

Record Type:	Electronic resources : Monograph/item
Title/Author:	OSPFby Phani Raj Tadimety.
Reminder of title:	a network routing protocol /
Author:	Tadimety, Phani Raj.
Published:	Berkeley, CA :Apress :2015.
Description:	xix, 144 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Open Shortest Path First (Computer network protocol)
Online resource:	http://dx.doi.org/10.1007/978-1-4842-1410-7
ISBN:	9781484214107$q(electronic bk.)

OSPFa network routing protocol /
Tadimety, Phani Raj.

OSPFa network routing protocol /[electronic resource] :by Phani Raj Tadimety. - Berkeley, CA :Apress :2015. - xix, 144 p. :ill., digital ;24 cm.

Chapter 1: Six Degrees of Separation -- Chapter 2: A Linkedin User's Professional Circles -- Chapter 3: Router Physiology 101 -- Chapter 4: The OSI Model-Division of Labor -- Chapter 5: The OSI Model-A Closer Look -- Chapter 6: Network Addresses -- Chapter 7: The Magnificent Internet Protocol -- Chapter 8: A Router's Got to Learn Its Routing Table… -- Chapter 9: "Hello" Greetings from a Router -- Chapter 10: Hello Again, Neighbor! -- Chapter 11: The Master Table -- Chapter 12: An Organizational Network -- Chapter 13: The Secret of Routing Powers -- Chapter 14: The Enterprise Network--Recognizing the Neighbors -- Chapter 15: Splitting the Autonomous System into Areas -- Chapter 16: Link State Advertisements -- Chapter 17: An Enterprise Network - The Neighborhood Activity -- Chapter 18: OSPF Messages -- Chapter 19: An Enterprise Network - Convergence of Data -- Chapter 20: Dijkstra's Algorithm - The First Look -- Chapter 21: Dijkstra's Algorithm - The Closest Look -- Chapter 22: Bibliography.

ISBN: 9781484214107$q(electronic bk.)

Standard No.: 10.1007/978-1-4842-1410-7doiSubjects--Topical Terms:

732807
Open Shortest Path First (Computer network protocol)

LC Class. No.: TK5105.578

Dewey Class. No.: 004.62

OSPFa network routing protocol /
LDR:01930nmm a2200301 a 4500 001 477775
003 DE-He213
005 20160510111945.0
006 m d
007 cr nn 008maaau
008 160614s2015 cau s 0 eng d
020 $a 9781484214107$q(electronic bk.)
020 $a 9781484214114$q(paper)
024 7 $a 10.1007/978-1-4842-1410-7 $2 doi
035 $a 978-1-4842-1410-7
040 $a GP $c GP
041 0 $a eng
050 4 $a TK5105.578
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
082 0 4 $a 004.62 $2 23
090 $a TK5105.578 $b .T121 2015
100 1 $a Tadimety, Phani Raj. $3 732806
245 1 0 $a OSPF $h [electronic resource] : $b a network routing protocol / $c by Phani Raj Tadimety.
260 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2015.
300 $a xix, 144 p. : $b ill., digital ; $c 24 cm.
505 0 $a Chapter 1: Six Degrees of Separation -- Chapter 2: A Linkedin User's Professional Circles -- Chapter 3: Router Physiology 101 -- Chapter 4: The OSI Model-Division of Labor -- Chapter 5: The OSI Model-A Closer Look -- Chapter 6: Network Addresses -- Chapter 7: The Magnificent Internet Protocol -- Chapter 8: A Router's Got to Learn Its Routing Table… -- Chapter 9: "Hello" Greetings from a Router -- Chapter 10: Hello Again, Neighbor! -- Chapter 11: The Master Table -- Chapter 12: An Organizational Network -- Chapter 13: The Secret of Routing Powers -- Chapter 14: The Enterprise Network--Recognizing the Neighbors -- Chapter 15: Splitting the Autonomous System into Areas -- Chapter 16: Link State Advertisements -- Chapter 17: An Enterprise Network - The Neighborhood Activity -- Chapter 18: OSPF Messages -- Chapter 19: An Enterprise Network - Convergence of Data -- Chapter 20: Dijkstra's Algorithm - The First Look -- Chapter 21: Dijkstra's Algorithm - The Closest Look -- Chapter 22: Bibliography.
650 0 $a Open Shortest Path First (Computer network protocol) $3 732807
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Computer Science, general. $3 274540
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-1-4842-1410-7
950 $a Professional and Applied Computing (Springer-12059)