BFD Encapsulated in Large Packets
draft-ietf-bfd-large-packets-02
| Document | Type |
Expired Internet-Draft
(bfd WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Jeffrey Haas , Albert Fu | ||
| Last updated | 2020-05-04 (Latest revision 2019-11-01) | ||
| Replaces | draft-haas-bfd-large-packets | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | In WG Last Call | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| 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
The Bidirectional Forwarding Detection (BFD) protocol is commonly used to verify connectivity between two systems. BFD packets are typically very small. It is desirable in some circumstances to know that not only is the path between two systems reachable, but also that it is capable of carrying a payload of a particular size. This document discusses thoughts on how to implement such a mechanism using BFD in Asynchronous mode.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)