ospfd/ospf6d man page cleanup:

Sync description of the OSPF protocol between ospfd(8) and ospf6d(8).
Document current shortcomings -- in particular, document that ospf6d(8)
needs manual IPsec setup for security. Clean up various grammatical errors,
re-order and re-phrase things a bit to improve readability.
Update RFC references. Remove IPv4-specific stuff from ospf6d.conf(5).

OK jmc@ claudio@

1 files changed, 39 insertions, 32 deletions

diff --git a/usr.sbin/ospfd/ospfd.8 b/usr.sbin/ospfd/ospfd.8
index 268994bf107..2e02b4e27ef 100644
--- a/usr.sbin/ospfd/ospfd.8
+++ b/usr.sbin/ospfd/ospfd.8
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: ospfd.8,v 1.26 2010/02/23 21:30:40 schwarze Exp $
+.\"	$OpenBSD: ospfd.8,v 1.27 2010/03/06 23:14:43 stsp Exp $
 .\"
 .\" Copyright (c) 2004, 2005, 2007 Esben Norby <norby@openbsd.org>
 .\"
@@ -14,7 +14,7 @@
 .\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 .\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 .\"
-.Dd $Mdocdate: February 23 2010 $
+.Dd $Mdocdate: March 6 2010 $
 .Dt OSPFD 8
 .Os
 .Sh NAME
@@ -37,70 +37,74 @@ This implementation supports OSPF version 2, thus it is only capable of
 maintaining IPv4 routing tables.
 .Pp
 OSPF is an interior gateway protocol designed to supersede RIP.
+It has several advantages over RIP.
+For instance, every router has an understanding of the complete network
+topology.
+Response to changes in the network is faster.
+Furthermore, failure detection is improved.
+.Pp
 The OSPF daemon maintains a Link State Database
 .Pq LSDB
-consisting of routers and networks.
-.Pp
-Dijkstra's shortest path first algorithm is used to compute the Route
-Information Base using the LSDB as input.
-The Forwarding Information Base a.k.a. the kernel route table is updated
-with information from the RIB.
+containing information about routers and networks within an Autonomous System
+.Pq AS .
 .Pp
-OSPF routers communicate via two multicast groups: 224.0.0.5 all Shortest
-Path First routers and 224.0.0.6 all Designated Routers.
-The IP protocol number 89 is reserved for OSPF, furthermore OSPF packets
-omit the use of TCP and UDP.
+Dijkstra's shortest path first algorithm is used to compute a Routing
+Information Base
+.Pq RIB
+using the LSDB as input.
+The Forwarding Information Base
+.Pq FIB ,
+a.k.a. the kernel routing table, is updated with information from the RIB.
 .Pp
-OSPF has several advantages over RIP.
-For example every router has a complete network topology.
-Response to changes in the network are faster.
-Furthermore fail detection is much improved.
+OSPF routers discover one another automatically via OSPF hello packets.
+OSPF routers communicate via two multicast groups: 224.0.0.5 (all Shortest
+Path First routers) and 224.0.0.6 (all Designated Routers).
+OSPF runs directly on top of IP and uses neither TCP nor UDP.
+IP protocol number 89 is reserved for OSPF.
 .Pp
-All routers in an OSPF network spend most of their time keeping each others
+All routers in an OSPF network spend most of their time keeping each others'
 LSDBs in sync.
 All routers must have the same information in the LSDB at all times.
 Every time the LSDB is updated the RIB is updated; if needed the FIB is
 also updated.
 .Pp
-OSPF aware routers discover each other via OSPF hello packets.
-.Pp
-In a multiaccess network such as Ethernet it is unfeasible for all routers
-to synchronize with all other routers in the network.
+In a multi-access network such as Ethernet, it is unfeasible for all routers
+to synchronize their LSDB with all other routers in the network.
 In such networks a Designated Router
 .Pq DR
 and a Backup Designated Router
 .Pq BDR
-is elected.
+are elected.
 The DR's responsibility is to synchronize with all routers; the BDR will
 not do much until the DR fails.
 The first router in a network is automatically elected DR, the second
 router BDR.
 All routers have a FULL adjacency with the DR and the BDR.
+Routers with FULL adjacency exchange information about their LSDBs.
 A router not elected either DR or BDR will have 2-WAY adjacency with all
 routers but the DR and BDR.
-Routers that form 2-WAY adjacency recognize that they know each other.
-In case a DR or BDR should fail another router is elected and all routers
-change state on the newly elected router and synchronize to it.
+Routers with 2-WAY adjacency recognize that they know each other,
+but do not exchange information about their LSDBs.
+If a DR or BDR fails another router is elected DR or BDR
+and all routers form FULL adjacencies with the newly elected DR or BDR.
 .Pp
-When routers are connected via point-to-point links, the DR and BDR
-election is skipped since only two routers are connected.
+When routers are connected via point-to-point links, DR and BDR
+election is skipped since only two routers are connected to the link.
 .Pp
 To limit the impact changes in the network have on the LSDB it is possible
 to segment an OSPF network into areas.
-Area 0.0.0.0 a.k.a. the backbone area must always be present.
+Area 0.0.0.0 (a.k.a. the backbone area) must always be present.
 Routers can be configured as Area Border Router
 .Pq ABR ,
 being part of multiple areas.
 Every area must have direct access to the backbone area.
 ABRs not directly connected to the backbone area need to establish a
 virtual link to a router in the backbone area.
-Virtual links are currently not available in
-.Nm .
 .Pp
 AS Border Routers
 .Pq ASBR
-are connected to an OSPF network and other external networks, BGP, RIP,
-or statically routed.
+are connected to an OSPF network and other external networks via BGP, RIP,
+or static routing, and provide connectivity to networks outside the AS.
 .Pp
 .Nm
 is usually started at boot time, and can be enabled by
@@ -178,3 +182,6 @@ The
 .Nm
 program first appeared in
 .Ox 3.7 .
+.Sh BUGS
+Virtual links are currently not available in
+.Nm .