Transport-Independent Path Layer State Management
draft-trammell-plus-statefulness-04
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2018-05-17 (latest revision 2017-11-13) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-trammell-plus-statefulness-04.txt
Abstract
This document describes a simple state machine for stateful network devices on a path between two endpoints to associate state with traffic traversing them on a per-flow basis, as well as abstract signaling mechanisms for driving the state machine. This state machine is intended to replace the de-facto use of the TCP state machine or incomplete forms thereof by stateful network devices in a transport-independent way, while still allowing for fast state timeout of non-established or undesirable flows.
Authors
Mirja Kühlewind
(mirja.kuehlewind@tik.ee.ethz.ch)
Brian Trammell
(ietf@trammell.ch)
Joe Hildebrand
(hildjj@cursive.net)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)