BFD Encapsulated in Large Packets
draft-ietf-bfd-large-packets-02
| Document | Type | Expired Internet-Draft (bfd WG) | |
|---|---|---|---|
| Last updated | 2020-05-04 (latest revision 2019-11-01) | ||
| Replaces | draft-haas-bfd-large-packets | ||
| Stream | IETF | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | WG state | In WG Last Call | |
| Document shepherd | No shepherd assigned | ||
| IESG | IESG state | Expired | |
| Consensus Boilerplate | Unknown | ||
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-ietf-bfd-large-packets-02.txt
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
Jeffrey Haas
(jhaas@juniper.net)
Albert Fu
(afu14@bloomberg.net)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)