Pacing in Transport Protocols
draft-welzl-iccrg-pacing-03
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Michael Welzl , Wesley Eddy , Vidhi Goel , Michael Tüxen | ||
| Last updated | 2026-01-08 (Latest revision 2025-07-07) | ||
| 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
Applications or congestion control mechanisms can produce bursty traffic which can cause unnecessary queuing and packet loss. To reduce the burstiness of traffic, the concept of evenly spacing out the traffic from a data sender over a round-trip time known as "pacing" has been used in many transport protocol implementations. This document gives an overview of pacing and how some known pacing implementations work.
Authors
Michael Welzl
Wesley Eddy
Vidhi Goel
Michael Tüxen
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)