BFD Encapsulated in Large Packets
draft-haas-bfd-large-packets-01

Document Type Replaced Internet-Draft (bfd WG)
Last updated 2018-11-17 (latest revision 2018-10-16)
Replaced by draft-ietf-bfd-large-packets
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state Adopted by a WG
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-bfd-large-packets
Consensus Boilerplate Unknown
Telechat date
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-haas-bfd-large-packets-01.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.)