| 1 |
<pre>Network Working Group D. Cansever |
| 2 |
Request for Comments: 2333 GTE Laboratories, Inc. |
| 3 |
Category: Standards Track April 1998 |
| 4 |
|
| 5 |
|
| 6 |
<span class="h1">NHRP Protocol Applicability Statement</span> |
| 7 |
|
| 8 |
Status of this Memo |
| 9 |
|
| 10 |
This document specifies an Internet standards track protocol for the |
| 11 |
Internet community, and requests discussion and suggestions for |
| 12 |
improvements. Please refer to the current edition of the "Internet |
| 13 |
Official Protocol Standards" (STD 1) for the standardization state |
| 14 |
and status of this protocol. Distribution of this memo is unlimited. |
| 15 |
|
| 16 |
Copyright Notice |
| 17 |
|
| 18 |
Copyright (C) The Internet Society (1998). All Rights Reserved. |
| 19 |
|
| 20 |
Abstract |
| 21 |
|
| 22 |
As required by the Routing Protocol Criteria [<a href="./rfc1264">RFC 1264</a>], this memo |
| 23 |
discusses the applicability of the Next Hop Resolution Protocol |
| 24 |
(NHRP) in routing of IP datagrams over Non-Broadcast Multiple Access |
| 25 |
(NBMA) networks, such as ATM, SMDS and X.25. |
| 26 |
|
| 27 |
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Protocol Documents</span> |
| 28 |
|
| 29 |
The NHRP protocol description is defined in [<a href="#ref-1" title=""NMBA Next Hop Resolution Protocol (NHRP)"">1</a>]. The NHRP MIB |
| 30 |
description is defined in [<a href="#ref-2" title=""NHRP Management Information Base"">2</a>]. |
| 31 |
|
| 32 |
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Introduction</span> |
| 33 |
|
| 34 |
This document summarizes the key features of NHRP and discusses the |
| 35 |
environments for which the protocol is well suited. For the purposes |
| 36 |
of description, NHRP can be considered a generalization of Classical |
| 37 |
IP and ARP over ATM which is defined in [<a href="#ref-3" title=""Classical IP and ARP over ATM"">3</a>] and of the Transmission |
| 38 |
of IP Datagrams over the SMDS Service, defined in [<a href="#ref-4" title=""The Transmission of IP datagrams over the SMDS service"">4</a>]. This |
| 39 |
generalization occurs in 2 distinct directions. |
| 40 |
|
| 41 |
Firstly, NHRP avoids the need to go through extra hops of routers |
| 42 |
when the Source and Destination belong to different Logical Internet |
| 43 |
Subnets (LIS). Of course, [<a href="#ref-3" title=""Classical IP and ARP over ATM"">3</a>] and [<a href="#ref-4" title=""The Transmission of IP datagrams over the SMDS service"">4</a>] specify that when the source |
| 44 |
and destination belong to different LISs, the source station must |
| 45 |
forward data packets to a router that is a member of multiple LISs, |
| 46 |
even though the source and destination stations may be on the same |
| 47 |
logical NBMA network. If the source and destination stations belong |
| 48 |
to the same logical NBMA network, NHRP provides the source station |
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
<span class="grey">Cansever Standards Track [Page 1]</span></pre> |
| 53 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 54 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 55 |
|
| 56 |
|
| 57 |
with an inter-LIS address resolution mechanism at the end of which |
| 58 |
both stations can exchange packets without having to use the services |
| 59 |
of intermediate routers. This feature is also referred to as |
| 60 |
"short-cut" routing. If the destination station is not part of the |
| 61 |
logical NBMA network, NHRP provides the source with the NBMA address |
| 62 |
of the current egress router towards the destination. |
| 63 |
|
| 64 |
The second generalization is that NHRP is not specific to a |
| 65 |
particular NBMA technology. Of course, [<a href="#ref-3" title=""Classical IP and ARP over ATM"">3</a>] assumes an ATM network |
| 66 |
and [<a href="#ref-4" title=""The Transmission of IP datagrams over the SMDS service"">4</a>] assumes an SMDS network at their respective subnetwork |
| 67 |
layers. |
| 68 |
|
| 69 |
NHRP is specified for resolving the destination NBMA addresses of IP |
| 70 |
datagrams over IP subnets within a large NBMA cloud. NHRP has been |
| 71 |
designed to be extensible to network layer protocols other than IP, |
| 72 |
possibly subject to other network layer protocol specific additions. |
| 73 |
|
| 74 |
As an important application of NHRP, the Multiprotocol Over ATM |
| 75 |
(MPOA) Working Group of the ATM Forum has decided to adopt and to |
| 76 |
integrate NHRP into its MPOA Protocol specification [<a href="#ref-5">5</a>]. As such, |
| 77 |
NHRP will be used in resolving the ATM addresses of MPOA packets |
| 78 |
destined outside the originating subnet. |
| 79 |
|
| 80 |
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Key Features</span> |
| 81 |
|
| 82 |
NHRP provides a mechanism to obtain the NBMA network address of the |
| 83 |
destination, or of a router along the path to the destination. NHRP |
| 84 |
is not a routing protocol, but may make use of routing information. |
| 85 |
This is further discussed in <a href="#section-5">Section 5</a>. |
| 86 |
|
| 87 |
The most prominent feature of NHRP is that it avoids extra router |
| 88 |
hops in an NBMA with multiple LISs. To this goal, NHRP provides the |
| 89 |
source with the NBMA address of the destination, if the destination |
| 90 |
is directly attached to the NBMA. If the destination station is not |
| 91 |
attached to the NBMA, then NHRP provides the source with the NBMA |
| 92 |
address of an exit router that has connectivity to the destination. |
| 93 |
In general, there may be multiple exit routers that have connectivity |
| 94 |
to the destination. If NHRP uses the services of a dynamic routing |
| 95 |
algorithm in fulfilling its function, which is necessary for robust |
| 96 |
and scalable operation, then the exit router identified by NHRP |
| 97 |
reflects the selection made by the network layer dynamic routing |
| 98 |
protocol. In general, the selection made by the routing protocol |
| 99 |
would often reflect a desirable attribute, such as identifying the |
| 100 |
exit router that induces the least number of hops in the original |
| 101 |
routed path. |
| 102 |
|
| 103 |
|
| 104 |
|
| 105 |
|
| 106 |
|
| 107 |
|
| 108 |
<span class="grey">Cansever Standards Track [Page 2]</span></pre> |
| 109 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 110 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 111 |
|
| 112 |
|
| 113 |
NHRP is defined for avoiding extra hops in the delivery of IP packets |
| 114 |
with a single destination. As such, it is not intended for direct |
| 115 |
use in a point-to-multipoint communication setting. However, |
| 116 |
elements of NHRP may be used in certain multicast scenarios for the |
| 117 |
purpose of providing short cut routing. Such an effort is discussed |
| 118 |
in [<a href="#ref-6" title=""Support for Sparse Mode PIM over ATM"">6</a>]. In this case, NHRP would avoid intermediate routers in the |
| 119 |
multicast path. The scalability of providing short-cut paths in a |
| 120 |
multicast environment is an open issue. |
| 121 |
|
| 122 |
NHRP can be used in host-host, host-router and router-host |
| 123 |
communications. When used in router-router communication, NHRP (as |
| 124 |
defined in [<a href="#ref-1" title=""NMBA Next Hop Resolution Protocol (NHRP)"">1</a>]) can produce persistent routing loops if the |
| 125 |
underlying routing protocol looses information critical to loop |
| 126 |
suppression. This may occur when there is a change in router metrics |
| 127 |
across the autonomous system boundaries. NHRP for router-router |
| 128 |
communication that avoids persistent forwarding loops will be |
| 129 |
addressed in a separate document. |
| 130 |
|
| 131 |
A special case of router-router communication where loops will not |
| 132 |
occur is when the destination host is directly adjacent to the non- |
| 133 |
NBMA interface of the egress router. If it is believed that the |
| 134 |
adjacency of the destination station to the egress router is a stable |
| 135 |
topological configuration, then NHRP can safely be used in this |
| 136 |
router-router communication scenario. If the NHRP Request has the Q |
| 137 |
bit set, indicating that the requesting party is a router, and if the |
| 138 |
destination station is directly adjacent to the egress router as a |
| 139 |
stable topological configuration, then the egress router can issue a |
| 140 |
corresponding NHRP reply. If the destination is not adjacent to the |
| 141 |
egress router, and if Q bit is set in the Request, then a safe mode |
| 142 |
of operation for the egress router would be to issue a negative NHRP |
| 143 |
Reply (NAK) for this particular request, thereby enforce data packets |
| 144 |
to follow the routed path. |
| 145 |
|
| 146 |
As a result of having inter-LIS address resolution capability, NHRP |
| 147 |
allows the communicating parties to exchange packets by fully |
| 148 |
utilizing the particular features of the NBMA network. One such |
| 149 |
example is the use of QoS guarantees when the NMBA network is ATM. |
| 150 |
|
| 151 |
Here, due to short-cut routing, ATM provided QoS guarantees can be |
| 152 |
implemented without having to deal with the issues of re-assembling |
| 153 |
and re-segmenting IP packets at each network layer hop. |
| 154 |
|
| 155 |
NHRP protocol can be viewed as a client-server interaction. An NHRP |
| 156 |
Client is the one who issues an NHRP Request. An NHRP Server is the |
| 157 |
one who issues a reply to an NHRP request, or the one who forwards a |
| 158 |
received NHRP request to another Server. Of course, an NHRP entity |
| 159 |
may act both as a Client and a Server. |
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
<span class="grey">Cansever Standards Track [Page 3]</span></pre> |
| 165 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 166 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 167 |
|
| 168 |
|
| 169 |
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Use of NHRP</span> |
| 170 |
|
| 171 |
In general, issuing an NHRP request is an application dependent |
| 172 |
action [<a href="#ref-7" title=""Local/Remote"">7</a>]. For applications that do not have particular QoS |
| 173 |
requirements, and that are executed within a short period of time, an |
| 174 |
NBMA short-cut may not be a necessity. In situations where there is a |
| 175 |
"cost" associated with NBMA short-cuts, such applications may be |
| 176 |
better served by network layer hop-by-hop routing. Here, "cost" may |
| 177 |
be understood in a monetary context, or as additional strain on the |
| 178 |
equipment that implements short-cuts. Therefore, there is a trade-off |
| 179 |
between the "cost" of a short-cut path and its utility to the user. |
| 180 |
Reference [<a href="#ref-7" title=""Local/Remote"">7</a>] proposes that this trade-off should be addressed at the |
| 181 |
application level. In an environment consisting of LANs and routers |
| 182 |
that are interconnected via dedicated links, the basic routing |
| 183 |
decision is whether to forward a packet to a router, or to broadcast |
| 184 |
it locally. Such a decision on local vs. remote is based on the |
| 185 |
destination address. When routing IP packets over an NBMA network, |
| 186 |
where there is potentially a direct Source to Destination |
| 187 |
connectivity with QoS options, the decision on local vs. remote is no |
| 188 |
longer as fundamentally important as in the case where packets have |
| 189 |
to traverse routers that are interconnected via dedicated links. |
| 190 |
Thus, in an NBMA network with QoS options, the basic decision becomes |
| 191 |
the one of short-cut vs. hop-by-hop network layer routing. In this |
| 192 |
case, the relevant criterion becomes applications' QoS requirements |
| 193 |
[<a href="#ref-7" title=""Local/Remote"">7</a>]. NHRP is particularly applicable for environments where the |
| 194 |
decision on local vs. remote is superseded by the decision on short- |
| 195 |
cut vs. hop-by-hop network layer routing. |
| 196 |
|
| 197 |
Let us assume that the trade-off is in favor of a short-cut NBMA |
| 198 |
route. Generally, an NHRP request can be issued by a variety of NHRP |
| 199 |
aware entities, including hosts and routers with NBMA interfaces. If |
| 200 |
an IP packet traverses multiple hops before a short-cut path has been |
| 201 |
established, then there is a chance that multiple short-cut paths |
| 202 |
could be formed. In order to avoid such an undesirable situation, a |
| 203 |
useful operation rule is to authorize only the following entities to |
| 204 |
issue an NHRP request and to perform short-cut routing. |
| 205 |
|
| 206 |
i) The host that originates the IP packet, if the host has an NBMA |
| 207 |
interface. |
| 208 |
ii) The first router along the routing path of the IP packet such |
| 209 |
that the next hop is reachable through the NBMA interface of |
| 210 |
that particular router. |
| 211 |
iii) A policy router within an NBMA network through which the IP |
| 212 |
packet has to traverse. |
| 213 |
|
| 214 |
|
| 215 |
|
| 216 |
|
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
<span class="grey">Cansever Standards Track [Page 4]</span></pre> |
| 221 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 222 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 223 |
|
| 224 |
|
| 225 |
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Protocol Scalability</span> |
| 226 |
|
| 227 |
As previously indicated, NHRP is defined for the delivery of IP |
| 228 |
packets with a single destination. Thus, this discussion is confined |
| 229 |
to a unicast setting. The scalability of NHRP can be analyzed at |
| 230 |
three distinct levels: |
| 231 |
|
| 232 |
o Client level |
| 233 |
o LIS level |
| 234 |
o Domain level |
| 235 |
|
| 236 |
At the the Client level, the scalability of NHRP is affected by the |
| 237 |
processing and memory limitations of the NIC that provides interface |
| 238 |
to the NBMA network. When the NBMA network is connection oriented, |
| 239 |
such as ATM, NIC limitations may bound the scalability of NHRP in |
| 240 |
certain applications. For example, a server that handles hundreds of |
| 241 |
requests per second using an ATM interface may be bounded by the |
| 242 |
performance characteristics of the corresponding NIC. Similarly, |
| 243 |
when the NHRP Client resides at an NBMA interface of a router, memory |
| 244 |
and processing limitations of router's NIC may bound the scalability |
| 245 |
of NHRP. This is because routers generally deal with an aggregation |
| 246 |
of traffic from multiple sources, which in turn creates a potentially |
| 247 |
large number of SVCCs out of the router's NBMA interface. |
| 248 |
|
| 249 |
At the LIS level, the main issue is to maintain and deliver a sizable |
| 250 |
number of NBMA to Network layer address mappings within large LISs. |
| 251 |
To this goal, NHRP implementations can use the services of the Server |
| 252 |
Cache Synchronization Protocol (SCSP) [<a href="#ref-8" title=""Server Cache Synchronization Protocol (SCSP) - NBMA"">8</a>] that allows multiple |
| 253 |
synchronized NHSs within an LIS, and hence resolve the associated |
| 254 |
scalability issue. |
| 255 |
|
| 256 |
At the NHRP Domain level, network layer routing is used in resolving |
| 257 |
the NBMA address of a destination outside the LIS. As such, the |
| 258 |
scalability of NHRP is closely tied to the scalability of the network |
| 259 |
layer routing protocol used by NHRP. Dynamic network layer routing |
| 260 |
protocols are proven to scale well. Thus, when used in conjunction |
| 261 |
with dynamic routing algorithms, at the NHRP domain level, NHRP |
| 262 |
should scale in the same order as the routing algorithm, subject to |
| 263 |
the assumption that all the routers along the path are NHRP aware. |
| 264 |
If an NHRP Request is processed by a router that does not implement |
| 265 |
NHRP, it will be silently discarded. Then, short-cuts cannot be |
| 266 |
implemented and connectivity will be provided on a hop-by-hop basis. |
| 267 |
|
| 268 |
Thus, when NHRP is implemented in conjunction with dynamic network |
| 269 |
layer routing, a scaling requirement for NHRP is that virtually all |
| 270 |
the routers within a logical NBMA network should be NHRP aware. |
| 271 |
|
| 272 |
|
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
<span class="grey">Cansever Standards Track [Page 5]</span></pre> |
| 277 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 278 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 279 |
|
| 280 |
|
| 281 |
One can also use static routing in conjunction with NHRP. Then, not |
| 282 |
all the routers in the NBMA network need to be NHRP aware. That is, |
| 283 |
since the routers that need to process NHRP control messages are |
| 284 |
specified by static routing, routers that are not included in the |
| 285 |
manually defined static paths do not have to be NHRP aware. Of |
| 286 |
course, static routing does not scale, and if the destination is off |
| 287 |
the NBMA network, then the use of static routing could result in |
| 288 |
persistently suboptimal routes. Use of static routing also has |
| 289 |
fairly negative failure modes. |
| 290 |
|
| 291 |
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Discussion</span> |
| 292 |
|
| 293 |
NHRP does not replace existing routing protocols. In general, routing |
| 294 |
protocols are used to determine the proper path from a source host or |
| 295 |
router, or intermediate router, to a particular destination. If the |
| 296 |
routing protocol indicates that the proper path is via an interface |
| 297 |
to an NBMA network, then NHRP may be used at the NBMA interface to |
| 298 |
resolve the destination IP address into the corresponding NBMA |
| 299 |
address. Of course, the use of NHRP is subject to considerations |
| 300 |
discussed in <a href="#section-4">Section 4</a>. |
| 301 |
|
| 302 |
Assuming that NHRP is applicable and the destination address has been |
| 303 |
resolved, packets are forwarded using the particular data forwarding |
| 304 |
and path determination mechanisms of the underlying NBMA network. |
| 305 |
Here, the sequence of events are such that route determination is |
| 306 |
performed by IP routing, independent of NHRP. Then, NHRP is used to |
| 307 |
create a short-cut track upon the path determined by the IP routing |
| 308 |
protocol. Therefore, NHRP "shortens" the routed path. NHRP (as |
| 309 |
defined in [<a href="#ref-1" title=""NMBA Next Hop Resolution Protocol (NHRP)"">1</a>]) is not sufficient to suppress persistent forwarding |
| 310 |
loops when used for router-router communication if the underlying |
| 311 |
routing protocol looses information critical to loop suppression [<a href="#ref-9" title=""IP over ATM: A Framework Document"">9</a>]. |
| 312 |
Work is in progress [<a href="#ref-10" title=""NHRP for Destinations off the NBMA Subnetwork"">10</a>] to augment NHRP to enable its use for the |
| 313 |
router-router communication without persistent forwarding loops. |
| 314 |
|
| 315 |
When the routed path keeps changing on some relatively short time |
| 316 |
scale, such as seconds, this situation will have an effect on the |
| 317 |
operation of NHRP. In certain router-router operations, changes in |
| 318 |
the routed path could create persistent routing loops. In host- |
| 319 |
router, or router-host communications, frequent changes in routed |
| 320 |
paths could result in inefficiencies such as frequent creation of |
| 321 |
short-cut paths which are short lived. |
| 322 |
|
| 323 |
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Security Considerations</span> |
| 324 |
|
| 325 |
NHRP is an address resolution protocol, and SCSP is a database |
| 326 |
synchronization protocol. As such, they are possibly subject to |
| 327 |
server (for NHRP) or peer (for SCSP) spoofing and denial of service |
| 328 |
attacks. They both provide authentication mechanisms to allow their |
| 329 |
|
| 330 |
|
| 331 |
|
| 332 |
<span class="grey">Cansever Standards Track [Page 6]</span></pre> |
| 333 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 334 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 335 |
|
| 336 |
|
| 337 |
use in environments in which spoofing is a concern. Details can be |
| 338 |
found in sections <a href="#section-5.3.4">5.3.4</a> in [<a href="#ref-1" title=""NMBA Next Hop Resolution Protocol (NHRP)"">1</a>] and B.3.1 in [<a href="#ref-8" title=""Server Cache Synchronization Protocol (SCSP) - NBMA"">8</a>]. There are no |
| 339 |
additional security constraints or concerns raised in this document |
| 340 |
that are not already discussed in the referenced sections. |
| 341 |
|
| 342 |
References |
| 343 |
|
| 344 |
[<a id="ref-1">1</a>] Luciani, J., Katz, D., Piscitello, D., Cole, B., and |
| 345 |
N. Doraswamy, "NMBA Next Hop Resolution Protocol (NHRP)", <a href="./rfc2332">RFC</a> |
| 346 |
<a href="./rfc2332">2332</a>, April 1998. |
| 347 |
|
| 348 |
[<a id="ref-2">2</a>] Greene, M., and J. Luciani, <a style="text-decoration: none" href='https://www.google.com/search?sitesearch=datatracker.ietf.org%2Fdoc%2Fhtml%2F&q=inurl:draft-+%22NHRP+Management+Information+Base%22'>"NHRP Management Information Base"</a>, |
| 349 |
Work in Progress. |
| 350 |
|
| 351 |
|
| 352 |
[<a id="ref-3">3</a>] Laubach, M., and J. Halpern, "Classical IP and ARP over ATM", <a href="./rfc2225">RFC</a> |
| 353 |
<a href="./rfc2225">2225</a>, April 1998. |
| 354 |
|
| 355 |
[<a id="ref-4">4</a>] Lawrance, J., and D. Piscitello, "The Transmission of IP |
| 356 |
datagrams over the SMDS service", <a href="./rfc1209">RFC 1209</a>, March 1991. |
| 357 |
|
| 358 |
[<a id="ref-5">5</a>] Multiprotocol Over ATM Version 1.0, ATM Forum Document |
| 359 |
af-mpoa-0087.000 |
| 360 |
|
| 361 |
[<a id="ref-6">6</a>] Rekhter, Y., and D. Farinacci, "Support for Sparse Mode PIM over |
| 362 |
ATM", Work in Progress. |
| 363 |
|
| 364 |
[<a id="ref-7">7</a>] Rekhter, Y., and D. Kandlur, "Local/Remote" Forwarding Decision |
| 365 |
in Switched Data Link Subnetworks", <a href="./rfc1937">RFC 1937</a>, May 1996. |
| 366 |
|
| 367 |
[<a id="ref-8">8</a>] Luciani, J., Armitage, G., Halpern, J., and N. Doraswamy, "Server |
| 368 |
Cache Synchronization Protocol (SCSP) - NBMA", <a href="./rfc2334">RFC 2334</a>, April |
| 369 |
1998. |
| 370 |
|
| 371 |
[<a id="ref-9">9</a>] Cole, R., Shur, D., and C. Villamizar, "IP over ATM: A Framework |
| 372 |
Document", <a href="./rfc1932">RFC 1932</a>, April 1996. |
| 373 |
|
| 374 |
[<a id="ref-10">10</a>] Rekhter, Y., <a style="text-decoration: none" href='https://www.google.com/search?sitesearch=datatracker.ietf.org%2Fdoc%2Fhtml%2F&q=inurl:draft-+%22NHRP+for+Destinations+off+the+NBMA+Subnetwork%22'>"NHRP for Destinations off the NBMA Subnetwork"</a>, |
| 375 |
Work in Progress. |
| 376 |
|
| 377 |
Acknowledgements |
| 378 |
|
| 379 |
The author acknowledges valuable contributions and comments from many |
| 380 |
participants of the ION Working Group, in particular from Joel |
| 381 |
Halpern of Newbridge Networks, David Horton of Centre for Information |
| 382 |
Technology Research, Andy Malis of Nexion, Yakov Rekhter and George |
| 383 |
Swallow of Cisco Systems and Curtis Villamizar of ANS. |
| 384 |
|
| 385 |
|
| 386 |
|
| 387 |
|
| 388 |
<span class="grey">Cansever Standards Track [Page 7]</span></pre> |
| 389 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 390 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 391 |
|
| 392 |
|
| 393 |
Author's Address |
| 394 |
|
| 395 |
Derya H. Cansever |
| 396 |
GTE Laboratories Inc. |
| 397 |
40 Sylvan Rd. MS 51 |
| 398 |
Waltham MA 02254 |
| 399 |
|
| 400 |
Phone: +1 617 466 4086 |
| 401 |
EMail: [email protected] |
| 402 |
|
| 403 |
|
| 404 |
|
| 405 |
|
| 406 |
|
| 407 |
|
| 408 |
|
| 409 |
|
| 410 |
|
| 411 |
|
| 412 |
|
| 413 |
|
| 414 |
|
| 415 |
|
| 416 |
|
| 417 |
|
| 418 |
|
| 419 |
|
| 420 |
|
| 421 |
|
| 422 |
|
| 423 |
|
| 424 |
|
| 425 |
|
| 426 |
|
| 427 |
|
| 428 |
|
| 429 |
|
| 430 |
|
| 431 |
|
| 432 |
|
| 433 |
|
| 434 |
|
| 435 |
|
| 436 |
|
| 437 |
|
| 438 |
|
| 439 |
|
| 440 |
|
| 441 |
|
| 442 |
|
| 443 |
|
| 444 |
<span class="grey">Cansever Standards Track [Page 8]</span></pre> |
| 445 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 446 |
<span class="grey"><a href="./rfc2333">RFC 2333</a> NHRP Protocol Applicability April 1998</span> |
| 447 |
|
| 448 |
|
| 449 |
Full Copyright Statement |
| 450 |
|
| 451 |
Copyright (C) The Internet Society (1998). All Rights Reserved. |
| 452 |
|
| 453 |
This document and translations of it may be copied and furnished to |
| 454 |
others, and derivative works that comment on or otherwise explain it |
| 455 |
or assist in its implementation may be prepared, copied, published |
| 456 |
and distributed, in whole or in part, without restriction of any |
| 457 |
kind, provided that the above copyright notice and this paragraph are |
| 458 |
included on all such copies and derivative works. However, this |
| 459 |
document itself may not be modified in any way, such as by removing |
| 460 |
the copyright notice or references to the Internet Society or other |
| 461 |
Internet organizations, except as needed for the purpose of |
| 462 |
developing Internet standards in which case the procedures for |
| 463 |
copyrights defined in the Internet Standards process must be |
| 464 |
followed, or as required to translate it into languages other than |
| 465 |
English. |
| 466 |
|
| 467 |
The limited permissions granted above are perpetual and will not be |
| 468 |
revoked by the Internet Society or its successors or assigns. |
| 469 |
|
| 470 |
This document and the information contained herein is provided on an |
| 471 |
"AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING |
| 472 |
TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING |
| 473 |
BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION |
| 474 |
HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF |
| 475 |
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. |
| 476 |
|
| 477 |
|
| 478 |
|
| 479 |
|
| 480 |
|
| 481 |
|
| 482 |
|
| 483 |
|
| 484 |
|
| 485 |
|
| 486 |
|
| 487 |
|
| 488 |
|
| 489 |
|
| 490 |
|
| 491 |
|
| 492 |
|
| 493 |
|
| 494 |
|
| 495 |
|
| 496 |
|
| 497 |
|
| 498 |
|
| 499 |
|
| 500 |
Cansever Standards Track [Page 9] |
| 501 |
</pre> |