Delivery Rate Estimation
draft-cheng-iccrg-delivery-rate-estimation-00
Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
---|---|---|---|
Authors | Yuchung Cheng , Neal Cardwell , Soheil Hassas Yeganeh , Van Jacobson | ||
Last updated | 2018-01-04 (Latest revision 2017-07-03) | ||
RFC stream | (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 document describes a generic algorithm for a transport protocol sender to estimate the current delivery rate of its data. At a high level, the algorithm estimates the rate at which the network delivered the most recent flight of outbound data packets for a single flow. In addition, it tracks whether the rate sample was application-limited, meaning the transmission rate was limited by the application rather than the congestion control algorithm. This algorithm can be implemented in any transport protocol that supports packet-delivery acknowledgment (thus far, open source implementations are available for TCP [RFC793] and QUIC [draft-ietf-quic-transport-00]).
Authors
Yuchung Cheng
Neal Cardwell
Soheil Hassas Yeganeh
Van Jacobson
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)