Debian Codegraph @

rfc2092.html

raw
1 <pre>Network Working Group S. Sherry
2 Request for Comments: 2092 Xyplex
3 Category: Informational G. Meyer
4 Shiva
5 January 1997
6
7
8 <span class="h1">Protocol Analysis for Triggered RIP</span>
9
10 Status of this Memo
11
12 This memo provides information for the Internet community. This memo
13 does not specify an Internet standard of any kind. Distribution of
14 this memo is unlimited.
15
16 Abstract
17
18 As required by Routing Protocol Criteria [<a href="#ref-1" title="&quot;Internet Engineering Task Force Internet Routing Protocol Standardization Criteria&quot;">1</a>], this report documents
19 the key features of Triggered Extensions to RIP to Support Demand
20 Circuits [<a href="#ref-2" title="&quot;Triggered Extensions to RIP to Support Demand Circuits&quot;">2</a>] and the current implementation experience.
21
22 As a result of the improved characteristics of Triggered RIP, it is
23 proposed that Demand RIP [<a href="#ref-5" title="&quot;Extensions to RIP to Support Demand Circuits&quot;">5</a>] be obsoleted.
24
25 Acknowledgements
26
27 The authors wish to thank Johanna Kruger and Jim Pearl of Xyplex for
28 many comments and suggestions which improved this effort.
29
30 <span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Protocol Documents</span>
31
32 "Triggered Extensions to RIP to Support Demand Circuits" [<a href="#ref-2" title="&quot;Triggered Extensions to RIP to Support Demand Circuits&quot;">2</a>] suggests
33 an enhancement to the "Routing Internet Protocol" (RIP) [<a href="#ref-3" title="&quot;Routing Information Protocol&quot;">3</a>] and
34 "RIP-2" [<a href="#ref-4" title="&quot;RIP Version 2 - Carrying Additional Information&quot;">4</a>] to allow them to run more cost-effectively on Wide Area
35 Networks (WANs).
36
37 <span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Applicability</span>
38
39 Triggered RIP requires that there is an underlying mechanism for
40 determining unreachability in a finite predictable period.
41
42 The triggered extensions to RIP are particularly appropriate for WANs
43 where the cost - either financial or packet overhead - would make
44 periodic transmission of routing (or service advertising) updates
45 unacceptable:
46
47 o Connection oriented Public Data Networks - for example X.25 packet
48 switched networks or ISDN.
49
50
51
52 <span class="grey">Sherry &amp; Meyer Informational [Page 1]</span></pre>
53 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
54 <span class="grey"><a href="./rfc2092">RFC 2092</a> Triggered RIP Protocol Analysis January 1997</span>
55
56
57 o Point-to-point links supporting PPP link quality monitoring or
58 echo request to determine link failure.
59
60 A triggered RIP implementation runs standard RIP on Local Area
61 Networks (LANs) allowing them to interoperate transparently with
62 implementations adhering to the original specifications.
63
64 <span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Key Features</span>
65
66 The proposal shares the same basic algorithms as RIP or RIP-2 when
67 running on LANs; Packet formats, broadcast frequency, triggered
68 update operation and database timeouts are all unmodified.
69
70 The new features operate on WANs which use switched circuits on
71 demand to achieve intermittent connectivity; Or on permanent WAN
72 connections where there is a desire to keep routing packet overhead
73 to a minimum. Instead of using periodic 'broadcasts', information is
74 only sent as triggered updates. The proposal makes use of features
75 of the underlying connection oriented service to provide feedback on
76 connectivity.
77
78 <span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a> Triggered Updates</span>
79
80 Updates are only sent on the WAN when an event changes the routing
81 database. Each update is retransmitted until acknowledged.
82 Information received in an update is not timed out.
83
84 The packet format of a RIP response is modified (with a different
85 unique command field) to include sequence number information. An
86 acknowledgement packet is also defined.
87
88 <span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a> Circuit Manager</span>
89
90 The circuit manager running below the IP network layer is responsible
91 for establishing a circuit to the next hop router whenever there is
92 data (or a routing update) to transfer. After a period of inactivity
93 the circuit will be closed by the circuit manager.
94
95 If the circuit manager fails to make a connection a circuit down
96 indication is sent to the routing application. The circuit manager
97 will then attempt at (increasing) intervals to establish a
98 connection. When successful a circuit up indication is sent to the
99 routing application.
100
101
102
103
104
105
106
107
108 <span class="grey">Sherry &amp; Meyer Informational [Page 2]</span></pre>
109 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
110 <span class="grey"><a href="./rfc2092">RFC 2092</a> Triggered RIP Protocol Analysis January 1997</span>
111
112
113 <span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a> Technology Restrictions</span>
114
115 There is a small but nontrivial possiblility of an incorrectly
116 configured or poorly operating link causing severe data loss,
117 resulting in a 'black hole' in routing. This is often unidirectional
118 - the link that route updates cross works properly, but not the
119 return path.
120
121 Triggered RIP will NOT fuction properly (and should NOT be used) if a
122 routing information will be retained/advertised for an arbitrarily
123 long period of time (until an update in the opposite direction fails
124 to obtain a response).
125
126 To detect black holes in technologies which use PPP encapsulation,
127 either Echo Request/Response or Link Quality Monitoring should be
128 used. When a black hole is detected a circuit down indication must
129 be sent to the routing application.
130
131 Current (and future) technologies which do not use PPP, need to use
132 an equivalent 'are-you-there' mechanism - or should NOT be used with
133 Triggered RIP.
134
135 <span class="h3"><a class="selflink" id="section-3.4" href="#section-3.4">3.4</a> Presumption of Reachability</span>
136
137 In a stable network there is no requirement to propagate routing
138 information on a circuit, so if no routing information is (being)
139 received on a circuit it is assumed that:
140
141 o The most recently received information is accurate.
142
143 o The intervening path is operational (although there may be no
144 current connection).
145
146 If the circuit manager determines that the intervening path is NOT
147 operational routing information previously received on that circuit
148 is timed out. It is worth stressing that it can be ANY routed
149 datagram which triggers the event.
150
151 When the circuit manager re-establishes a connection, the application
152 exchanges full routing information with its peer.
153
154 <span class="h3"><a class="selflink" id="section-3.5" href="#section-3.5">3.5</a> Routing Information Flow Control</span>
155
156 If the circuit manager reports a circuit as down, the routing
157 application is flow controlled from sending further information on
158 the circuit.
159
160
161
162
163
164 <span class="grey">Sherry &amp; Meyer Informational [Page 3]</span></pre>
165 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
166 <span class="grey"><a href="./rfc2092">RFC 2092</a> Triggered RIP Protocol Analysis January 1997</span>
167
168
169 <span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Relationship to Demand RIP</span>
170
171 The Triggered RIP proposal [<a href="#ref-2" title="&quot;Triggered Extensions to RIP to Support Demand Circuits&quot;">2</a>] has a number of efficiency advantages
172 over the Demand RIP proposal [<a href="#ref-5" title="&quot;Extensions to RIP to Support Demand Circuits&quot;">5</a>]:
173
174 o When routing information changes Demand RIP sends the full
175 database to its partner.
176
177 Once a router has exchanged all routing information with its
178 partner, Triggered RIP sends only the changed information to the
179 partner. This can dramatically decrease the quantity of
180 information requiring propagation when a route change occurs.
181
182 o Demand RIP requires a full routing update to be stored by the
183 receiver, before applying changes to the routing database.
184
185 A Triggered RIP receiver is able to apply all changes immediately
186 upon receiving each packet from its partner. Systems therefore
187 need to use less memory than Demand RIP.
188
189 o Demand RIP has an upper limit of 255 fragments in an update. This
190 sets an upper limit on the sizes of routing and service
191 advertising databases which can be propagated.
192
193 This restriction is lifted in Triggered RIP (which does not use
194 fragmentation).
195
196 In all other respects Demand RIP and Triggered RIP perform the same
197 function.
198
199 <span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Obsoleting Demand RIP</span>
200
201 While it is possible that systems could be able to support Demand RIP
202 and Triggered RIP, the internal maintenance of structures is likely
203 to differ significantly. The method of propagating the information
204 also differs significantly. In practice it is unlikely that systems
205 would support Demand RIP and Triggered RIP.
206
207 As a result of the improved characteristics of Triggered RIP, it is
208 proposed that Demand RIP [<a href="#ref-5" title="&quot;Extensions to RIP to Support Demand Circuits&quot;">5</a>] be obsoleted.
209
210 <span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Implementations</span>
211
212 At this stage there are believed to be two completed implementation.
213
214
215
216
217
218
219
220 <span class="grey">Sherry &amp; Meyer Informational [Page 4]</span></pre>
221 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
222 <span class="grey"><a href="./rfc2092">RFC 2092</a> Triggered RIP Protocol Analysis January 1997</span>
223
224
225 The Xyplex implementation supports all the features outlined for IP
226 RIP-1, IP RIP-2, IPX RIP, and IPX SAP. However, it only supports one
227 outstanding acknowledgement per partner. The implementation has been
228 tested against itself on X.25, ISDN, Frame Relay, V42bis CSU/DSUs,
229 and asynchronous modems. It has also been tested in operation with
230 various router and host implementations on Ethernet LANs.
231
232 The DEC implementation supports IP RIP-1 over ISDN, Frame Relay,
233 leased lines and V.25bis. The Xyplex and DEC IP RIP-1
234 implementations have been checked for interoperability over ISDN
235 without problems.
236
237 <span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Restrictions</span>
238
239 Demand RIP relies on the ability to place a call in either direction.
240 Some dialup services - for example DTR dialing - allow calls to be
241 made in one direction only.
242
243 Demand RIP can not operate with third-party advertisement of routes
244 on the WAN. The next hop IP address in RIP-2 should always be
245 0.0.0.0 for any routes advertised on the WAN.
246
247 <span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Security Considerations</span>
248
249 Security is provided through authentication of the logical and
250 physical address of the sender of the routing update. Incoming call
251 requests are matched by the circuit manager against a list of
252 physical addresses (used to make outgoing calls). The routing
253 application makes a further check against the logical address of an
254 incoming update.
255
256 Additional security can be provided by RIP-2 authentication [<a href="#ref-2" title="&quot;Triggered Extensions to RIP to Support Demand Circuits&quot;">2</a>] where
257 appropriate.
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276 <span class="grey">Sherry &amp; Meyer Informational [Page 5]</span></pre>
277 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
278 <span class="grey"><a href="./rfc2092">RFC 2092</a> Triggered RIP Protocol Analysis January 1997</span>
279
280
281 References
282
283 [<a id="ref-1">1</a>] Hinden, R., "Internet Engineering Task Force Internet Routing
284 Protocol Standardization Criteria", <a href="./rfc1264">RFC 1264</a>, Bolt Beranek and
285 Newman, Inc, October 1991.
286
287 [<a id="ref-2">2</a>] Meyer. G.M. and Sherry, S., "Triggered Extensions to RIP to
288 Support Demand Circuits", <a href="./rfc2091">RFC 2091</a>, Shiva and Xyplex, Aug 1995.
289
290 [<a id="ref-3">3</a>] Hedrick. C., "Routing Information Protocol", <a href="./rfc1058">RFC 1058</a>, Rutgers
291 University, June 1988.
292
293 [<a id="ref-4">4</a>] Malkin. G., "RIP Version 2 - Carrying Additional Information",
294 <a href="./rfc1723">RFC 1723</a>, Xylogics, November 1994.
295
296 [<a id="ref-5">5</a>] Meyer. G., "Extensions to RIP to Support Demand Circuits",
297 Spider Systems, February 1994.
298
299 Authors' Address:
300
301 Steve Sherry
302 Xyplex
303 295 Foster St.
304 Littleton, MA 01460
305
306 Phone: (US) 508 952 4745
307 Fax: (US) 508 952 4887
308 Email: [email protected]
309
310 Gerry Meyer
311 Shiva Europe Ltd
312 Stanwell Street
313 Edinburgh EH6 5NG
314 Scotland, UK
315
316 Phone: (UK) 131 561 4223
317 Fax: (UK) 131 561 4083
318 Email: [email protected]
319
320
321
322
323
324
325
326
327
328
329
330
331
332 Sherry &amp; Meyer Informational [Page 6]
333 </pre>