Open Shortest Path First(OPSF)

introduction

In the 1980s the end, distance vector routing protocol deficiency - has become more and more obvious. An attempt to improve the network expansibility of the effort is to use based on link - state to calculate routing, not by jogging number or other distance vector.

Links are network in the connection between the two routers. Link-state including the transmission speed and delayed level attribute.

This chapter examines the in-depth Internet engineering task force (IETF) link - state, internal gateway routing protocol type: Open Shortest Path Shortest Path First priority (Open, OSPF). OSPF first embodied in RFC1131. This temporary norms were soon RFC1247 eliminated. Two OSPF between qualitative difference between that RFC1247 OSPF called OSPF version 2. OSPF version 2 continues to mature and evolution. After some changes appeared in RFC1583, 2178 and 2328 (the latest version). Due to the Internet and IP were highly dynamic, therefore OSPF are likely to continue development in order to keep up with the Internet and IP progress.

OSPF origin

In order to satisfy building -- IETF is more and more big based on IP networks need, formed a group, specially for the development of open mode, link - state routing protocols, in order to in large, heterogeneous IP network. New routing protocol to have achieved some success a series of personal, and manufacturers related, the shortest path priority (SPF) routing protocol based on the market, SPF widely used. Including OSPF inside, all the SPF algorithm based on a mathematical routing protocol -- Dijkstra algorithm. This algorithm can make routing based on link - state, rather than distance vector.

OSPF by IETF in the late 1980s development, OSPF is SPF class routing protocol of open version. Initial OSPF regulating embodied in RFC1131. The first edition (OSPF version 1) were soon make a significant improvement, this new version is replaced RFC1247 ontology now document. RFC1247OSPF called OSPF version 2 is to explicitly pointed out in its stability and functional substantial improvement. This OSPF version has many updated document, each updates are on open standards elaborate improvement. The next some normative appeared in RFC1583, 2178 and 2328.

The latest edition of OSPF version 2 embodied in RFC2328. The latest edition will only and RFC2138, by 1583 and 1247 by the regulations of version to interoperability. This chapter to the current open OSPF standard cycle development process not discussed, but focus on discussing the latest version RFC2328 standardization of OSPF function, characteristics and use.

Understand RFC2328OSPF, version 2

OSPF is designed specifically for autonomous systems within the IP routing protocol. So then, it cannot transmit other routing network such as the IPX or AppleTalk message. If a user's network must apply a variety of routing protocols, be about to consider using other rather than OSPF routing protocol.

Based on IP data header in the SPF destination IP address to calculate routing and does not provide a destination to the IP routing computation. Moreover, various OSPF information directly sealed in the IP: no other protocol (TCP and UDP, etc) to transmission.

OSPF was also designed for rapid detection of autonomous systems within the topology changes, and changes in the discovery after convergence to new topology. Routing decisions in autonomous system within the router Internet between link-state based. These routers each maintain a the same database, which records the network link-states. This database contains is router state, one of the available interface, can arrive of the adjacent routers and link, status information.

Routing table updates, namely Link - state radio (Link - state of, lsas), directly send it to router area of all adjacent routers. This update process technology termed igapo (which), this term will give people negative impression, cause of OSPF performance features of the wrong cognition.

In fact, OSPF networks can be very fast convergence. Network in all routers running the same routing algorithms and directly between transmit a message routing table updates. These messages are used to establish the network and link view. Each router's network view use class - UNIX tree structure and to their own as roots. The tree called shortest path tree (shortest path tree), record - reaching autonomous systems inside each destination of the shortest path. Autonomous outside the system of destination can pass to an external network border gateway to obtain, border gateway appeared in the shortest path tree structure on the leaves. Such a destination and/or network link - state data maintenance, because they are not located outside OSPF network. Therefore, they do not appear in the shortest path tree branches.