DTN IP Neighbor Discovery (IPND)
draft-johnson-dtn-ipnd-00
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Daniel Ellard , Richard Altmann , Alex Gladd , Daniel Brown , Ronald in 't Velt , Scott M. Johnson | ||
Last updated | 2024-04-11 (Latest revision 2023-10-09) | ||
Replaces | draft-johnson-dtnwg-ipnd | ||
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
Delay and Disruption Tolerant Networking (DTN) IP Neighbor Discovery (IPND), is a method for otherwise oblivious nodes to learn of the existence, availability, and addresses of other DTN participants. IPND both sends and listens for small IP UDP announcement “beacons.” Beacon messages are addressed to an IP unicast, multicast, or broadcast destination to discover specified or unspecified remote neighbors, or unspecified local neighbors in the topology, e.g. within wireless range. IPND beacons advertise neighbor availability by including the DTN node’s canonical endpoint identifier. IPND beacons optionally include service availability and parameters. In this way, neighbor discovery and service discovery may be coupled or decoupled as required. Once discovered, new neighbor pairs use advertised availabilities to connect, exchange routing information, etc. This document describes DTN IPND.
Authors
Daniel Ellard
Richard Altmann
Alex Gladd
Daniel Brown
Ronald in 't Velt
Scott M. Johnson
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)