Home | Routing Introduction | Terminology | Overview | The Topology Database | Establishing Neighbors | Exchanging Topology Information | Creating The Routing Table | OSPF Routing

Welcome!

The site you are now viewing is a tutorial of the OSPF routing protocol. It contains overviews of various aspects of the protocol and details its operations.

This site is our final project for the course "Protocols and Computer Networks" of Dr. Debby Koren, taught at Tel-Aviv university in the spring semester of 2002.

Who we are

We are:
  • Gil Berkovski
  • Meir Marom

Navigating this site

This site consists of many pages, each page detailing a different aspect of OSPF. You can navigate through and to those pages by using the links at the top of each page, or by using the following links (ordered in the suggested reading order):

But first, here's a general description of OSPF to get you started and give you a general idea of what's on this site.

So, what is OSPF?

OSPF stands for Open Shortest Path First, which means it's an open standard which implements a solution to the Shortest Path First problem. OSPF is a dynamic-routing protocol built by the Internet Engineering Task Force (IETF) with TCP/IP in mind. It is a routing protocol for using within a single controlled network of networks (internetwork). It's designed to be fast, scale well, and to use as little traffic as possible for its control messages, and therefore competes with older yet more popular and widely deployed dynamic-routing protocols for that purpose. The protocol is a transport layer protocol, whose protocol number is 89.

The protocol is a link-state protocol, which means that every router connected to the internetwork holds the exact and complete topography of the entire internetwork in the form of a database. Each of those routers learn of the topology dynamically, constructs a graph from the topology database, and then runs an algorithm on it to find the shortest path to each of the vertices on that graph. The algorithm results construct the routing table for each router, and the protocol ensures that each router will have a correct and complete routing table.

The protocol is designed to support all the latest developments of the Internet, such as routing according to the type of service (TOS) field in the IP header, support of CIDR and subnet masking, and more. The routers that run OSPF are identified and can even be authenticated cryptographically by the protocol, to protect against malicious users distributing false topology information.

Bibliography

"Internetworking with TCP/IP" (volume 1, fourth edition), by Douglas E. Comer

"TCP/IP Illustrated" (volume 1), by W. Richard Stevens

"Computer Networks and Internets" (third edition), by Douglas E. Comer

"Interconnections" (second edition), by Radia Perlman

RFCs: 1131, 1247, 1583, 2178, 2328

The old OSPF tutorial website at rad.co.il/networks/1995/ospf/ospf.htm. This website updates and obsoletes it.

Created 2002 by Meir Marom & Gil Berkovski