Analysis And Study On Implement Of OSPF Protocol Based On IP Network

Open Shortest Path First (OSPF) is widely used as a routing protocol inmany TCP/IP networks. It is a link state protocol that is open — it isn'tproprietary to any vendor or organization. Like all link state protocols, OSPF isa robust protocol with excellent network expansive ability, and its majoradvantage over distance vector protocols is fast reconvergence. The use ofareas, which reduces the protocol's impact on CPU and memory, makespossible the construction of much larger and complicated Internet topologies.OSPF was developed by the Internet Engineering Task Force (IETF), andOSPF Version 2 is the current version and is specified in RFC 2328.Each OSPF router sends links state advertisements (LSAs) over alladjacencies. The LSAs describe all of the router's links, or interfaces, and thestate of the links. Because of the varying types of link state information, OSPFdefines multiple LSA types. All valid LSAs received by a router are stored in itslink state database (LSDB). The LSAs collected will describe a graph of thearea topology. Using the Shortest Path First algorithm, each router calculatesits own shortest-path tree (SPT) using itself as the root. From this information,entries may be maked into the routing table.It's important for an advanced network administrator to master theprinciple and characteristics of OSPF. Because OSPF is one of the mostcomplicated protocols, the maintenance and application of OSPF networkprove to be difficult. We carried on experiments about OSPF protocol underthe circumstances of Broadcast network and Point-to-Point network, and wecollect a lot of related data. The author with practised experience maked a lotof experiments on OSPF protocol and acquired a great deal of experimentsdata and implemented the routing calculation process. This thesis gives a newunderstanding about OSPF to network administrators ,which is useful for theirworks.