Application Enabled Open Networking: Problem Statement and Requirements
draft-eckel-aeon-problem-statement-00
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Charles Eckel , Tirumaleswar Reddy.K | ||
Last updated | 2014-05-27 (Latest revision 2014-02-14) | ||
Replaced by | draft-conet-aeon-problem-statement | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Replaced by draft-conet-aeon-problem-statement | |
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
Identification and treatment of application flows are critical for the successful deployment and operation of applications. Historically, this functionality has been accomplished to the extent possible using heuristics, which inspect and infer flow characteristics. Heuristics may be based on port ranges, network separation, or deep packet inspection (DPI). But many application flows in current usages are dynamic, time-bound (short lived for some of them), possibly encrypted (TLS for signaling), peer-to-peer, possibly asymmetric, and used on non-dedicated devices, any combination of which renders such techniques less effective or results in compromises to application security or user privacy.
Authors
Charles Eckel
Tirumaleswar Reddy.K
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)