Detecting Network Attachment in IPv6 Networks (DNAv6)
draft-pentland-dna-protocol-01
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Author | Sathya Narayanan | ||
Last updated | 2005-07-19 | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
Efficient detection of network attachment in IPv6 needs the following two components: a method for the host to query routers on the link to identify the link (Link Identification) and a method for the routers on the link to consistently respond to such a query with minimal delay (Fast RA). Solving the link identification based strictly on RFC 2461 is difficult because of the flexibilities offered to routers in terms of prefixes advertised in a router advertisement (RA) message. Similarly, the random delay in responding to router solicitation messages imposed by RFC 2461 makes to it difficult to achieve fast RA. A known set of solutions to these two problems was identified and catalogued by the DNA design team. In this memo, an integrated solution is presented, based on a sub-set of the catalogued solutions. This integrated solution consolidates most of the advantages of all known solutions while addressing most of the disadvantages.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)