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. All advertising materials mentioning features or use of this software
15 .\" must display the following acknowledgement:
16 .\" This product includes software developed by the University of
17 .\" California, Berkeley and its contributors.
18 .\" 4. Neither the name of the University nor the names of its contributors
19 .\" may be used to endorse or promote products derived from this software
20 .\" without specific prior written permission.
22 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 .\" $FreeBSD: src/usr.sbin/IPXrouted/IPXrouted.8,v 1.8.2.5 2003/03/11 21:13:47 trhodes Exp $
41 .Nd IPX Routing Information Protocol daemon
53 utility is invoked at boot time to manage the IPX routing tables.
54 The IPX routing daemon uses the Novell IPX Routing
55 Information Protocol in maintaining up to date kernel routing
59 .Bl -tag -width logfile
61 Do not reply on GetNearestServer SAP request.
63 Do not supply routing information (opposite of
69 to supply routing information whether it is acting as an internetwork
72 Do not supply Service Advertising Protocol
75 The default is to supply
79 All packets sent or received are
80 printed on the standard output. In addition,
82 will not divorce itself from the controlling terminal
83 so that interrupts from the keyboard will kill the process.
87 actions should be logged. This log contains information
88 about any changes to the routing tables and a history of
89 recent messages sent and received which are related to
96 for routing information packets. If the host is connected to
97 multiple IPX networks, it periodically supplies copies
98 of its routing tables to any directly connected hosts
103 is started, it uses the
107 directly connected interfaces configured into the
110 (the software loopback interface
111 is ignored). If multiple interfaces
112 are present, it is assumed the host will forward packets
116 utility then transmits a
118 packet on each interface (using a broadcast packet if
119 the interface supports it) and enters a loop, listening
124 packets from other hosts.
130 formulates a reply based on the information maintained in its
133 packet generated contains a list of known routes, each marked
136 metric (a count of 16, or greater, is
139 The metric associated with each
140 route returned provides a metric
141 .Em relative to the sender .
146 are used to update the routing tables if one of the following
147 conditions is satisfied:
150 No routing table entry exists for the destination network
151 or host, and the metric indicates the destination is ``reachable''
152 (i.e. the hop count is not infinite).
154 The source host of the packet is the same as the router in the
155 existing routing table entry. That is, updated information is
156 being received from the very internetwork router through which
157 packets for the destination are being routed.
159 The existing entry in the routing table has not been updated for
160 some time (defined to be 90 seconds) and the route is at least
161 as cost effective as the current route.
163 The new route describes a shorter route to the destination than
164 the one currently stored in the routing tables; the metric of
165 the new route is compared against the one stored in the table
169 When an update is applied,
171 records the change in its internal tables and generates a
173 packet to all directly connected hosts and networks.
176 of time (no more than 30 seconds) before modifying the kernel's
177 routing tables to allow possible unstable situations to settle.
179 In addition to processing incoming packets,
181 also periodically checks the routing table entries.
182 If an entry has not been updated for 3 minutes, the entry's metric
183 is set to infinity and marked for deletion. Deletions are delayed
184 an additional 60 seconds to insure the invalidation is propagated
187 Hosts acting as internetwork routers gratuitously supply their
188 routing tables every 30 seconds to all directly connected hosts
193 receives a SIGINFO signal the current contents of the RIP and SAP
194 tables are appended to the file /var/log/ipxrouted.dmp.