Packet Reordering: The Minimal Longest Ascending Subsequence Metric
draft-critchley-mlas-reordering-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Sam J. Critchley | ||
| Last updated | 2002-02-22 | ||
| 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
This draft describes a metric, based on the minimal longest ascending subsequence (MLAS), which can be used to measure the level of reorderedness of a given single sequence of packets transmitted by one host and received by a second. This metric enables reordering between similar packet flows to be compared across differing network topologies. The draft goes on to provide a set of recommended parameters which can be used when attempting to consistently compare reordering, and highlights potential issues which should be taken into account during measurement.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)