![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to XNSrouted.8 CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [CSRG BSD Unix] / 43BSDReno / sbin / XNSrouted|
Return to XNSrouted.8 CVS log | Up to [CSRG BSD Unix] / 43BSDReno / sbin / XNSrouted |
1.1 root 1: .\" Copyright (c) 1986 The Regents of the University of California.
2: .\" All rights reserved.
3: .\"
4: .\" Redistribution and use in source and binary forms are permitted provided
5: .\" that: (1) source distributions retain this entire copyright notice and
6: .\" comment, and (2) distributions including binaries display the following
7: .\" acknowledgement: ``This product includes software developed by the
8: .\" University of California, Berkeley and its contributors'' in the
9: .\" documentation or other materials provided with the distribution and in
10: .\" all advertising materials mentioning features or use of this software.
11: .\" Neither the name of the University nor the names of its contributors may
12: .\" be used to endorse or promote products derived from this software without
13: .\" specific prior written permission.
14: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
15: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
16: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
17: .\"
18: .\" @(#)XNSrouted.8 6.3 (Berkeley) 6/24/90
19: .\"
20: .TH XNSROUTED 8 "June 24, 1990"
21: .UC 6
22: .SH NAME
23: XNSrouted \- NS Routing Information Protocol daemon
24: .SH SYNOPSIS
25: .B XNSrouted
26: [
27: .B \-s
28: ] [
29: .B \-q
30: ] [
31: .B \-t
32: ] [
33: .I logfile
34: ]
35: .SH DESCRIPTION
36: .I XNSrouted
37: is invoked at boot time to manage the Xerox NS routing tables.
38: The NS routing daemon uses the Xerox NS Routing
39: Information Protocol in maintaining up to date kernel routing
40: table entries.
41: .PP
42: In normal operation
43: .I XNSrouted
44: listens
45: for routing information packets. If the host is connected to
46: multiple NS networks, it periodically supplies copies
47: of its routing tables to any directly connected hosts
48: and networks.
49: .PP
50: When
51: .I XNSrouted
52: is started, it uses the SIOCGIFCONF
53: .I ioctl
54: to find those
55: directly connected interfaces configured into the
56: system and marked ``up'' (the software loopback interface
57: is ignored). If multiple interfaces
58: are present, it is assumed the host will forward packets
59: between networks.
60: .I XNSrouted
61: then transmits a
62: .I request
63: packet on each interface (using a broadcast packet if
64: the interface supports it) and enters a loop, listening
65: for
66: .I request
67: and
68: .I response
69: packets from other hosts.
70: .PP
71: When a
72: .I request
73: packet is received,
74: .I XNSrouted
75: formulates a reply based on the information maintained in its
76: internal tables. The
77: .I response
78: packet generated contains a list of known routes, each marked
79: with a ``hop count'' metric (a count of 16, or greater, is
80: considered ``infinite''). The metric associated with each
81: route returned provides a metric
82: .IR "relative to the sender" .
83: .PP
84: .I Response
85: packets received by
86: .I XNSrouted
87: are used to update the routing tables if one of the following
88: conditions is satisfied:
89: .TP
90: (1)
91: No routing table entry exists for the destination network
92: or host, and the metric indicates the destination is ``reachable''
93: (i.e. the hop count is not infinite).
94: .TP
95: (2)
96: The source host of the packet is the same as the router in the
97: existing routing table entry. That is, updated information is
98: being received from the very internetwork router through which
99: packets for the destination are being routed.
100: .TP
101: (3)
102: The existing entry in the routing table has not been updated for
103: some time (defined to be 90 seconds) and the route is at least
104: as cost effective as the current route.
105: .TP
106: (4)
107: The new route describes a shorter route to the destination than
108: the one currently stored in the routing tables; the metric of
109: the new route is compared against the one stored in the table
110: to decide this.
111: .PP
112: When an update is applied,
113: .I XNSrouted
114: records the change in its internal tables and generates a
115: .I response
116: packet to all directly connected hosts and networks.
117: .I Routed
118: waits a short period
119: of time (no more than 30 seconds) before modifying the kernel's
120: routing tables to allow possible unstable situations to settle.
121: .PP
122: In addition to processing incoming packets,
123: .I XNSrouted
124: also periodically checks the routing table entries.
125: If an entry has not been updated for 3 minutes, the entry's metric
126: is set to infinity and marked for deletion. Deletions are delayed
127: an additional 60 seconds to insure the invalidation is propagated
128: to other routers.
129: .PP
130: Hosts acting as internetwork routers gratuitously supply their
131: routing tables every 30 seconds to all directly connected hosts
132: and networks.
133: .PP
134: Supplying the
135: .B \-s
136: option forces
137: .I XNSrouted
138: to supply routing information whether it is acting as an internetwork
139: router or not.
140: The
141: .B \-q
142: option is the opposite of the
143: .B \-s
144: option. If the
145: .B \-t
146: option is specified, all packets sent or received are
147: printed on the standard output. In addition,
148: .I XNSrouted
149: will not divorce itself from the controlling terminal
150: so that interrupts from the keyboard will kill the process.
151: Any other argument supplied is interpreted as the name
152: of file in which
153: .IR XNSrouted 's
154: actions should be logged. This log contains information
155: about any changes to the routing tables and a history of
156: recent messages sent and received which are related to
157: the changed route.
158: .SH "SEE ALSO"
159: ``Internet Transport Protocols'', XSIS 028112, Xerox System Integration
160: Standard.
161: .br
162: idp(4)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.