[tcpm] Fwd: New Version Notification for draft-zimmermann-tcpm-reordering-detection-00.txt

["Zimmermann, Alexander" <[e-mail]>]

Anfang der weitergeleiteten Nachricht:

> Von: <[e-mail]>
> Betreff: New Version Notification for draft-zimmermann-tcpm-reordering-detection-00.txt
> Datum: 18. November 2013 12:27:09 MEZ
> An: Lennart Schulte <[e-mail]>, Alexander Zimmermann <[e-mail]>, Arnd Hannemann <[e-mail]>, Carsten Wolff <[e-mail]>
> 
> 
> A new version of I-D, draft-zimmermann-tcpm-reordering-detection-00.txt
> has been successfully submitted by Alexander Zimmermann and posted to the
> IETF repository.
> 
> Filename:	 draft-zimmermann-tcpm-reordering-detection
> Revision:	 00
> Title:		 Detection and Quantification of Packet Reordering with TCP
> Creation date:	 2013-11-18
> Group:		 Individual Submission
> Number of pages: 22
> URL:             http://www.ietf.org/internet-drafts/draft-zimmermann-tcpm-reordering-detection-00.txt
> Status:          http://datatracker.ietf.org/doc/draft-zimmermann-tcpm-reordering-detection
> Htmlized:        http://tools.ietf.org/html/draft-zimmermann-tcpm-reordering-detection-00
> 
> 
> Abstract:
>   This document specifies an algorithm for the detection and
>   quantification of packet reordering for TCP.  In the absence of
>   explicit congestion notification from the network, TCP uses only
>   packet loss as an indication of congestion.  One of the signals TCP
>   uses to determine loss is the arrival of three duplicate
>   acknowledgments.  However, this heuristic is not always correct,
>   notably in the case when paths reorder packets.  This results in
>   degraded performance.
> 
>   The algorithm for the detection and quantification of reordering in
>   this document uses information gathered from the TCP Timestamps
>   Option, the TCP SACK Option and its DSACK extension.  When a
>   reordering event is detected, the algorithm calculates a reordering
>   extent by determining the number of segments the reordered segment
>   was late with respect to its position in the sequence number space.
>   Additionally, the algorithm computes a second reordering extent that
>   is relative to the amount of outstanding data and thus provides a
>   better estimation of the reordering delay when other sender state
>   changes.
> 
> 
> 
> 
> Please note that it may take a couple of minutes from the time of submission
> until the htmlized version and diff are available at tools.ietf.org.
> 
> The IETF Secretariat
>