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
41 .Nd IPX Routing Information Protocol daemon
53 utility is invoked at boot time to manage the
58 routing daemon uses the Novell
60 Routing Information Protocol in maintaining up to date kernel routing
64 .Bl -tag -width logfile
66 Do not reply on GetNearestServer
70 Do not supply routing information (opposite of
76 to supply routing information whether it is acting as an internetwork
79 Do not supply Service Advertising Protocol
82 The default is to supply
86 All packets sent or received are
87 printed on the standard output.
90 will not divorce itself from the controlling terminal
91 so that interrupts from the keyboard will kill the process.
95 actions should be logged.
96 This log contains information
97 about any changes to the routing tables and a history of
98 recent messages sent and received which are related to
105 for routing information packets.
106 If the host is connected to
109 networks, it periodically supplies copies
110 of its routing tables to any directly connected hosts
115 is started, it uses the
119 directly connected interfaces configured into the
122 (the software loopback interface is ignored).
123 If multiple interfaces
124 are present, it is assumed the host will forward packets
128 utility then transmits a
130 packet on each interface (using a broadcast packet if
131 the interface supports it) and enters a loop, listening
136 packets from other hosts.
142 formulates a reply based on the information maintained in its
146 packet generated contains a list of known routes, each marked
149 metric (a count of 16, or greater, is
152 The metric associated with each
153 route returned provides a metric
154 .Em relative to the sender .
159 are used to update the routing tables if one of the following
160 conditions is satisfied:
163 No routing table entry exists for the destination network
164 or host, and the metric indicates the destination is
166 (i.e., the hop count is not infinite).
168 The source host of the packet is the same as the router in the
169 existing routing table entry.
170 That is, updated information is
171 being received from the very internetwork router through which
172 packets for the destination are being routed.
174 The existing entry in the routing table has not been updated for
175 some time (defined to be 90 seconds) and the route is at least
176 as cost effective as the current route.
178 The new route describes a shorter route to the destination than
179 the one currently stored in the routing tables; the metric of
180 the new route is compared against the one stored in the table
184 When an update is applied,
186 records the change in its internal tables and generates a
188 packet to all directly connected hosts and networks.
191 utility waits a short period
192 of time (no more than 30 seconds) before modifying the kernel's
193 routing tables to allow possible unstable situations to settle.
195 In addition to processing incoming packets,
197 also periodically checks the routing table entries.
198 If an entry has not been updated for 3 minutes, the entry's metric
199 is set to infinity and marked for deletion.
200 Deletions are delayed
201 an additional 60 seconds to insure the invalidation is propagated
204 Hosts acting as internetwork routers gratuitously supply their
205 routing tables every 30 seconds to all directly connected hosts
212 signal the current contents of the
216 tables are appended to the file
217 .Pa /var/log/ipxrouted.dmp .
223 utility first appeared in