Single-Area OSPF

From Mycomputer Notes

(Difference between revisions)
(→OSPF Rules)
(→Link State Routing Protocols Features)
Line 42: Line 42:
</table>
</table>
 +
=Link State Routing Concepts=
===Link State Routing Protocols Features===
===Link State Routing Protocols Features===

Revision as of 15:43, 26 October 2006

OSPF is a link state routing protocol that is based on a open standard, meaning open to the public and is non proprietary. OSPF is the preffered IGP if comparaed to RIP (v1&v2); it the prefered IGP because it is scalable. OSPF gives majors advantages to the administrator and it gives them extensive control of the routing updates, Area definition reduces routing overhead, speeds up convergence, confines network instability to an area, and improves performance.

  1. RIP is limited to 15 hops
  2. converges slowly
  3. chooses slow routes because it ignores critical factors such as bandwidth in route determination.
  4. Draw back of OSPF is that it only supports TCP/IP
Link State and Distance Vector Routing Protocols
Protocol Examples Characteristics
Distance Vector RIP v1 & Rip V2
  • Copies Routing table to neightbors
  • Updates frequentlu
  • RIP v1 & v2 use hop count as metric
  • View the network from the perspective of the neighbors
  • Slow to converge
  • Susceptible to routing loops
  • Easy to configure and administer
  • Consumes a lot of bandwith
Link-State OSPF IS-IS
  • Uses shortest path
  • Updates are event triggered
  • Sends Link-state packets to all network routers
  • Has common view of network
  • Fast to converge
  • Not as susceptible to routing loops
  • Harder to configure
  • Requires more memory and processing power than distance vector.
  • Consummes less bandwith than distance vector.

Contents

Link State Routing Concepts

Link State Routing Protocols Features

Link state protocols collect routing data from all other routers in the network or within a defined area of the network. Once the information is collected each router calculates the best paths to all destinations in the network. Each router has it own map of the network so it is less likelly to propagate incorrect information.

The following are some link-state routing protocol functions:

  1. Respond quickly to network changes
  2. Send triggered updates only when a network change has occurred
  3. Send periodic updates known as link-state refreshes (a.k.a Hello packets)
  4. Use a hello mechanism to determine the reachability of neighbors.

Each router multicast an hello packets to keep tracks of the state of the nighbor routers. Each router LSAs tracks all the routers in its area on the network. The hello packets contain information about the networks that are attached to the router. Routers that use link-state routing protocols have the following features:

  • Use the hello information and LSAs received from other routers to build a database about the network.
  • Use the SPF algorithm to calculate the shortest route to each network.
  • Store the route information in the routing table.

How routing information is maintained

The routing information is maintained the same way for any Link State Routing protocol:

  • LSAs
  • Topological Database
  • SFP Alogarithm
  • SPF Tree
  • Routing table of paths and ports to determine the best path for packets for each network.

Link states routing alogarithms

Link-state routing algorithms maintain a complex database of the network topology by exchanging link-state advertisements (LSAs) with other routers in a network. Link-state routing algorithms have the following characteristics:

  • They are known collectively as SPF protocols.
  • They maintain a complex database of the network topology.
  • They are based on the Dijkstra algorithm.
  • Link-state protocols develop and maintain full knowledge of the network routers and how they interconnect. This is achieved through the exchange of LSAs with other routers in the network.

Each router constructs a topological database from the LSAs that it receives. The SPF algorithm is then used to compute the reachability of destinations. This information is used to update the routing table. This process can discover changes in the network topology caused by component failure or network growth. An LSA exchange is triggered by an event in the network instead of periodic updates. This speeds up the convergence process because there is no need to wait for a series of timers to expire before the routers can converge.

Advantages & Disadvatages of Link State routing
Advantages Disadvantages
  • Fast Convergence times, as changes are reported immediatelly by the source affected
  • It provides robustness againts routing loops
  • Routers known the topology
  • Link-state packets are sequenced and aged
  • The link-state database sizes can be minimized with carefull network design.
  • Significant demands on memory and processing resources
  • Requires very strict network design
  • Requires a knowledgeable network administrator
  • Initial flooding can impede network performance.

OSPF Concepts

OSPF Rules

Link-State Advertissements (LSAs)

  • Hello Interval
  • Dead Interval

The LSAs are sent out only after a dead interval has been received.

Link-State Update

  • Updates are sent to the DR & BDR and contains the LSA
  • The DR will sent back an LSAck to the orignator & LSUs to the other routers.
  • The other routers will send back an LSAck as well as the LSU if necessary to other

routers they may be connected to.

OSPF Definitions

Link
Interface on a router
Link-State
The status of a link between two routers. Also a router interface and its relationship to neighbor routers.
Link-State Database (topological database)
A list of information about all other routers in an internetwork.
Area
A collection of networks and routers that has the same area identifification. Each router within an area has the same link-state information. A router within an area is called Internal Router.
Cost
The value assiged to a link. Link state protocols assign a cost to a link based on the bandwidth of the link or transmission speed. This is used instead of hops.
Routing Table
This is also called fowarding database. A routing table is generated when an algorith is run on a link-state database. The routing table for each router is unique.
Adjancency database
A list of all the neighbor routers to which a router has established biderectional communication. This is unique to each router.
Designated Router (DR) & Backup Designated Router (BDR)
A router that is elected by all other routers on the same LAN to represent all the routers. Each network has a DR and BDR.



OSPF Configuration
  • An area must be specified. If only 1 area exist Area is 0 ELSE area could be between 0 - 65535
  • A process ID must be defined (1 and 65535)
  • A wilcard mask is recommended to indentify the participating IP address.
  • Needs to have and active RouterID
  • OSPF chooses the highest local active IP address to be the Router ID.
  • IF the interface choosen to be the Router ID becomes inactive (down) the OSPF process will stop
  • An loopback interface (virtual) needs to be configued to avoid the OSPF process to Stop.
How DR & BDR are elected
  • The DR on a network is elected according to its priority.
  • The higher the priority number the better the chances of been DR.
  • Priority values vary between 0 and 255
  • With an equal priority on a broadcast network, the router with the highest Router ID wins.

For the purpose of electing DR/BDR the router needs an active Router ID.

External Link

For more details on read this article on Open Shortest Path First

Retrieved from "http://editthis.info/mycomputer_notes/Single-Area_OSPF"
Personal tools