A probabilistic scheme for fast Router Advertisement responses in IPv6
draft-daley-dna-prob-fastra-00
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Author | Greg Daley | ||
| Last updated | 2005-02-11 | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| 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 can be found at:
https://www.ietf.org/archive/id/draft-daley-dna-prob-fastra-00.txt
https://www.ietf.org/archive/id/draft-daley-dna-prob-fastra-00.txt
Abstract
The IPv6 Neighbour Discovery RFC provides for random delays of between 0 to 500 milliseconds, in order to spread responses to solicitations when multiple routers exist on a link. This document describes an alternative scheme for responding to Router Solicitations which estimates the number of routers on the link, and aims to reduce the delay spread for responding Router Advertisements.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)