Flow-state Dependent Packet Selection Techniques
draft-krishnan-ipfix-flow-aware-packet-sampling-06
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Ramki Krishnan , Ning So , Salvatore D'Antonio | ||
Last updated | 2014-04-21 (Latest revision 2013-10-18) | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
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 demands on the networking infrastructure and thus the switch/router bandwidths are growing exponentially; the drivers are bandwidth hungry rich media applications, inter data center communications etc. Using sampling techniques, for a given sampling rate, the amount of samples that need to be processed is increasing exponentially especially for applications like security threat detection. This draft elaborates on flow-state dependent packet selection techniques and the relevant information models. It describes how these techniques can be effectively used to reduce the number of samples for applications like security threat detection.
Authors
Ramki Krishnan
Ning So
Salvatore D'Antonio
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)