1 .\" Copyright (c) 1986, 1991, 1993
2 .\" The Regents of the University of California. All rights reserved.
4 .\" Copyright (c) 1995 John Hay. All rights reserved.
6 .\" Redistribution and use in source and binary forms, with or without
7 .\" modification, are permitted provided that the following conditions
9 .\" 1. Redistributions of source code must retain the above copyright
10 .\" notice, this list of conditions and the following disclaimer.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
12 .\" notice, this list of conditions and the following disclaimer in the
13 .\" documentation and/or other materials provided with the distribution.
14 .\" 3. Neither the name of the University nor the names of its contributors
15 .\" may be used to endorse or promote products derived from this software
16 .\" without specific prior written permission.
18 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 .\" $FreeBSD: src/usr.sbin/IPXrouted/IPXrouted.8,v 1.8.2.5 2003/03/11 21:13:47 trhodes Exp $
31 .\" $DragonFly: src/usr.sbin/IPXrouted/IPXrouted.8,v 1.4 2008/05/09 20:31:04 swildner Exp $
38 .Nd IPX Routing Information Protocol daemon
50 utility is invoked at boot time to manage the IPX routing tables.
51 The IPX routing daemon uses the Novell IPX Routing
52 Information Protocol in maintaining up to date kernel routing
56 .Bl -tag -width logfile
58 Do not reply on GetNearestServer SAP request.
60 Do not supply routing information (opposite of
66 to supply routing information whether it is acting as an internetwork
69 Do not supply Service Advertising Protocol
72 The default is to supply
76 All packets sent or received are
77 printed on the standard output. In addition,
79 will not divorce itself from the controlling terminal
80 so that interrupts from the keyboard will kill the process.
84 actions should be logged. This log contains information
85 about any changes to the routing tables and a history of
86 recent messages sent and received which are related to
93 for routing information packets. If the host is connected to
94 multiple IPX networks, it periodically supplies copies
95 of its routing tables to any directly connected hosts
100 is started, it uses the
104 directly connected interfaces configured into the
107 (the software loopback interface
108 is ignored). If multiple interfaces
109 are present, it is assumed the host will forward packets
113 utility then transmits a
115 packet on each interface (using a broadcast packet if
116 the interface supports it) and enters a loop, listening
121 packets from other hosts.
127 formulates a reply based on the information maintained in its
130 packet generated contains a list of known routes, each marked
133 metric (a count of 16, or greater, is
136 The metric associated with each
137 route returned provides a metric
138 .Em relative to the sender .
143 are used to update the routing tables if one of the following
144 conditions is satisfied:
147 No routing table entry exists for the destination network
148 or host, and the metric indicates the destination is ``reachable''
149 (i.e. the hop count is not infinite).
151 The source host of the packet is the same as the router in the
152 existing routing table entry. That is, updated information is
153 being received from the very internetwork router through which
154 packets for the destination are being routed.
156 The existing entry in the routing table has not been updated for
157 some time (defined to be 90 seconds) and the route is at least
158 as cost effective as the current route.
160 The new route describes a shorter route to the destination than
161 the one currently stored in the routing tables; the metric of
162 the new route is compared against the one stored in the table
166 When an update is applied,
168 records the change in its internal tables and generates a
170 packet to all directly connected hosts and networks.
173 of time (no more than 30 seconds) before modifying the kernel's
174 routing tables to allow possible unstable situations to settle.
176 In addition to processing incoming packets,
178 also periodically checks the routing table entries.
179 If an entry has not been updated for 3 minutes, the entry's metric
180 is set to infinity and marked for deletion. Deletions are delayed
181 an additional 60 seconds to insure the invalidation is propagated
184 Hosts acting as internetwork routers gratuitously supply their
185 routing tables every 30 seconds to all directly connected hosts
192 signal the current contents of the RIP and SAP
193 tables are appended to the file
194 .Pa /var/log/ipxrouted.dmp .