Network Working Group C. Huitema Internet-Draft Private Octopus Inc. Intended status: Experimental S. Nandakumar Expires: 30 August 2026 C. Jennings Cisco 26 February 2026 Specification of Christian's Congestion Control Code (C4) draft-huitema-ccwg-c4-spec-02 Abstract Christian's Congestion Control Code is a new congestion control algorithm designed to support Real-Time applications such as Media over QUIC. It is designed to drive towards low delays, with good support for the "application limited" behavior frequently found when using variable rate encoding, and with fast reaction to congestion to avoid the "priority inversion" happening when congestion control overestimates the available capacity. The design emphasizes simplicity and avoids making too many assumptions about the "model" of the network. Status of This Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at https://datatracker.ietf.org/drafts/current/. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." This Internet-Draft will expire on 30 August 2026. Copyright Notice Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/ license-info) in effect on the date of publication of this document. Huitema, et al. Expires 30 August 2026 [Page 1] Internet-Draft C4 Specification February 2026 Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License. Table of Contents 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3 2. Key Words . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3. C4 variables . . . . . . . . . . . . . . . . . . . . . . . . 3 3.1. Nominal rate . . . . . . . . . . . . . . . . . . . . . . 4 3.2. Nominal max RTT . . . . . . . . . . . . . . . . . . . . . 4 3.3. Global variables . . . . . . . . . . . . . . . . . . . . 5 3.4. Per era variables . . . . . . . . . . . . . . . . . . . . 6 4. States and Transition . . . . . . . . . . . . . . . . . . . . 6 4.1. Setting pacing rate, congestion window and quantum . . . 7 4.2. Initial state . . . . . . . . . . . . . . . . . . . . . . 9 4.2.1. Reentering the initial state . . . . . . . . . . . . 9 4.3. Recovery state . . . . . . . . . . . . . . . . . . . . . 10 4.3.1. Restarting Initial if High Jitter . . . . . . . . . . 11 4.4. Cruising state {#c4-cruising } . . . . . . . . . . . . . 11 4.5. Pushing state . . . . . . . . . . . . . . . . . . . . . . 11 5. Handling of congestion signals . . . . . . . . . . . . . . . 12 5.1. Variable Sensitivity . . . . . . . . . . . . . . . . . . 12 5.2. Detecting Excessive Delays . . . . . . . . . . . . . . . 13 5.3. Detecting Excessive Losses . . . . . . . . . . . . . . . 13 5.3.1. Do not react to Probe Time Out . . . . . . . . . . . 13 5.4. Detecting Excessive CE Marks . . . . . . . . . . . . . . 14 5.5. Applying congestion signals . . . . . . . . . . . . . . . 14 5.5.1. Rate Reduction on Congestion . . . . . . . . . . . . 14 6. Implementation considerations . . . . . . . . . . . . . . . . 15 6.1. Rate measurement should be conservative . . . . . . . . . 15 6.2. Pacing and CPU load . . . . . . . . . . . . . . . . . . . 16 6.3. Nominal max RTT on low latency links . . . . . . . . . . 16 7. Security Considerations . . . . . . . . . . . . . . . . . . . 16 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 16 9. References . . . . . . . . . . . . . . . . . . . . . . . . . 16 9.1. Normative References . . . . . . . . . . . . . . . . . . 17 9.2. Informative References . . . . . . . . . . . . . . . . . 17 Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . 17 Changes since previous versions . . . . . . . . . . . . . . . . . 17 Changes since draft-huitema-ccwg-c4-spec-00 . . . . . . . . . . 17 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 18 Huitema, et al. Expires 30 August 2026 [Page 2] Internet-Draft C4 Specification February 2026 1. Introduction Christian's Congestion Control Code (C4) is a congestion control algorithm designed to support Real-Time multimedia applications, specifically multimedia applications using QUIC [RFC9000] and the Media over QUIC transport [I-D.ietf-moq-transport]. The two main variables describing the state of a flow are the "nominal rate" (see Section 3.1) and the "nominal max RTT" (see Section 3.2). C4 organizes the management of the flow through a series of states: Initial, during which the first assessment of nominal-rate and nominal max RTT are obtained, Recovery in which a flow is stabilized after the Initial or Pushing phase, Cruising during which a flow uses the nominal rate, and Pushing during which the flow tries to discover if more resource is available -- see Section 4. C4 divides the duration of the connection in a set of "eras", each corresponding to a packet round trip. Transitions between protocol states typically happen at the end of an era, except if the transition is forced by a congestion event. C4 assumes that the transport stack is capable of signaling events such as acknowledgements, RTT measurements, ECN signals or the detection of packet losses. It also assumes that the congestion algorithm controls the transport stack by setting the congestion window (CWND) and the pacing rate (see Section 5). C4 introduces the concept of "sensitivity" (see Section 5.1) to ensure that flows using a large amount of bandwidth are more "sensitive" to congestion signals than flows using fewer bandwidth, and thus that multiple flows sharing a common bottleneck are driven to share the resource evenly. 2. Key Words The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here. 3. C4 variables In addition to the nomnal rate and the nominal max RTT, C4 maintains a set a variables per flow (see Section 3.3) and per era (see Section 3.4). Huitema, et al. Expires 30 August 2026 [Page 3] Internet-Draft C4 Specification February 2026 3.1. Nominal rate The nominal rate is an estimate of the bandwidth available to the flow. On initialization, the nominal rate is set to zero, and default values are used when setting the pacing rate and CWND for the flow. C4 evaluates the nominal rate after acknowledgements are received using the number of bytes acknowledged since the packet was sent (bytes_acknowledged) and the time delay it took to process these packets. That delay is normally set to the difference between the time at which the acknowledged packet was sent (time_sent), and the current time (current_time). However, that difference may sometimes be severely underestimated because of delay jitter and ACK compression. We also compute a "send delay" as the difference between the send time of the acknowledged packet and the send time of the oldest "delivered" packet. delay_estimate = max (current_time - time_sent, send_delay) rate_estimate = bytes_acknowledged /delay_estimate If we are not in a congestion situation, we update the nominal rate: if not congested and nominal_rate > rate_estimate: nominal_rate = rate_estimate The data rate measurements can only cause increases in the nominal rate. The nominal rate is reduced following congestion events, as specified in Section 5. The "congested" condition is defined as being in the recovery state and having either entered that state due to a congestion event, or having received a congestion event after entering recovery. Updating the nominal rate in these conditions would cause a congestion bounce: the nominal rate is reduced because of a congestion event, C4 enters recovery, but then packets sent at the previous rate are received during recovery, generating a new estimate and resetting the nominal rate to a value close to the one that caused congestion. 3.2. Nominal max RTT The nominal max RTT is an estimate of the maximum RTT that can occur on the path in the absence of queues. The RTT samples observed for the flow are the sum of four components: Huitema, et al. Expires 30 August 2026 [Page 4] Internet-Draft C4 Specification February 2026 * the latency of the path * the jitter introduced by processes like link layer contention or link layer retransmission * queuing delays caused by competing applications * queuing delays introduced by C4 itself. C4's goal is to obtain a estimate of the combination of path latency and maximum jitter. This is done by only taking measurements when C4 is sending data at a rate not higher than the nominal transmission rate, as happens for example in the recovery and cruising states. These measurements will happen during the following era. C4 captures them by recording the max RTT for packets sent in that era. C4 will also progressively reduce the value of the nominal max RTT over time, to account for changes in network conditions. # on end of era if alpha_previous <= 1.0: if era_min_rtt < running_min_rtt: running_min_rtt = era_min_rtt else: running_min_rtt = (7*running_min_rtt + era_min_rtt)/8 if era_max_rtt > running_min_rtt + MAX_JITTER: # cap RTT increases to MAX_JITTER, i.e., 250ms era_max_rtt = running_min_rtt + MAX_JITTER if era_max_rtt > nominal_max_rtt: nominal_max_rtt = era_max_rtt else: nominal_max_rtt = (7*nominal_max_rtt + era_max_rtt)/8 The decrease over time is tuned so that jitter events will be remembered for several of the cruising-pushing-recovery cycles, which is enough time for the next jitter event to happen, at least on Wi-Fi networks. 3.3. Global variables In addition to the nominal rate and nominal MAX RTT, C4 maintains a set of variables tracking the evolution of the flow: * running min RTT, an approximation of the min RTT for the flow, Huitema, et al. Expires 30 August 2026 [Page 5] Internet-Draft C4 Specification February 2026 * number of eras without increase (see Section 4.2), * current state of the algorithm, which can be Initial, Recovery, Cruising or Pushing. * probe level. The probe level determines how aggressive the pushing phase is, and also how long to wait between recovery and pushing. 3.4. Per era variables C4 keeps variables per era: era_sequence; /* sequence number of first packet sent in this era */ alpha_current; /* coefficient alpha used in the current state */ alpha_previous; /* coefficient alpha used in the previous era */ era_max_rtt; /* max RTT observed during this era */ era_min_rtt; /* min RTT observed during this era */ These variables are initialized at the beginning of the era. 4. States and Transition The state machine for C4 has the following states: * "Initial": the initial state, during which the CWND is set to twice the "nominal_CWND". The connection exits startup if the "nominal_cwnd" does not increase for 3 consecutive round trips. When the connection exits startup, it enters "recovery". * "Recovery": the connection enters that state after "Initial", "pushing", or a congestion detection in a "cruising" state. It remains in that state for at least one roundtrip, until the first packet sent in "recovery" is acknowledged. Once that happens, the connection goes back to "startup" if the last 3 pushing attemps have resulted in increases of "nominal rate", or if it detects high jitter and the previous initial was not run in these conditions (see ). It enters "cruising" otherwise. * "Cruising": the connection is sending using the "nominal_rate" and "nominal_max_rtt" value. If congestion is detected, the connection exits cruising and enters "recovery" after lowering the value of "nominal_cwnd". Otherwise, the connection will remain in "cruising" state until at least 4 RTT and the connection is not "app limited". At that point, it enters "pushing". Huitema, et al. Expires 30 August 2026 [Page 6] Internet-Draft C4 Specification February 2026 * "Pushing": the connection is using a rate and CWND 25% larger than "nominal_rate" and "nominal_CWND". It remains in that state for one round trip, i.e., until the first packet send while "pushing" is acknowledged. At that point, it enters the "recovery" state. These transitions are summarized in the following state diagram. Start | v +<-----------------------+ | | v | +----------+ | | Initial | | +----|-----+ | | | v | +------------+ | +--+---------->| Recovery | | ^ ^ +----|---|---+ | | | | | First High Jitter | | | | | or Rapid Increase | | | | +------------------->+ | | | | | v | | +----------+ | | | Cruising | | | +-|--|-----+ | | Congestion | | | +-------------+ | | | | v | +----------+ | | Pushing | | +----|-----+ | | +<------------------+ 4.1. Setting pacing rate, congestion window and quantum If the nominal rate or the nominal max RTT are not yet assessed, C4 sets pacing rate, congestion window and pacing quantum to initial values: * pacing rate: set to the data rate of the outgoing interface, * congestion window: set to the equivalent of 10 packets, Huitema, et al. Expires 30 August 2026 [Page 7] Internet-Draft C4 Specification February 2026 * congestion quantum: set to zero. If the nominal rate or the nominal max RTT are both assessed, C4 sets pacing rate, and congestion window to values that depends on these variables and on a coefficient alpha_current: if (c4_state == initial): margin = 0 else: margin = min(nominal_max_rtt/4, 15_milliseconds) pacing_rate = alpha_current * nominal_rate cwnd = max ((pacing_rate+margin) * nominal_max_rtt, 2*MTU) The "margin" coefficient accounts for errors on the estimate of the nominal max rtt, which could cause C4 to be stuck operating at a too low data rate. It is only applied outside of the initial phase. The coefficient alpha for the different states is: +==========+==============+===========================+ | state | alpha | comments | +==========+==============+===========================+ | Initial | 2 | | +----------+--------------+---------------------------+ | Recovery | 15/16 | | +----------+--------------+---------------------------+ | Cruising | 1 | | +----------+--------------+---------------------------+ | Pushing | 5/4 or 17/16 | see Section 4.5 for rules | | | | on choosing 5/4 or 17/16 | +----------+--------------+---------------------------+ Table 1 Setting the pacing quantum is a tradeoff between two requirements. Using a large quantum enables applications to send large batches of packets in a single transaction, which improves performance. But sending large batches of packets creates "instant queues" and causes some Active Queue Management mechanisms to mark packets as ECN/CE, or drop them. As a compromise, we set the quantum to 4 milliseconds worth of transmission, while capping it to 64KB. quantum = max ( min (pacing_rate*4_milliseconds, 64KB), 2*MTU) Huitema, et al. Expires 30 August 2026 [Page 8] Internet-Draft C4 Specification February 2026 4.2. Initial state When the flow is first initialized, it enters the Initial state, during which it does a first assessment of the "nominal rate" and "nominal max RTT". The coefficient alpha_current is set to 2. The "nominal rate" and "nominal max RTT" are initialized to zero, which will cause pacing rate to be set to a default initial value. The nominal max RTT will be set to the first assessed RTT value, but is not otherwise changed before the end of the initial phase. The CWND will be set to the default initial value, corresponding to 10 packets. During the initial state, the nominal rate is updated after receiving acknowledgements, see Section 3.1. The value of CWND is increased after each acknowledgement by the number of bytes newly acknowledged by this acknowledgement. C4 will exit the Initial state and enter Recovery if the nominal rate does not increase for 3 consecutive eras, omitting the eras for which the transmission was "application limited". C4 exit the Initial when receiving a congestion signal if the following conditions are true: 1- If the signal is due to "delay" or "ECN", C4 will only exit the initial state if the nominal_rate did not increase in the last 2 eras. 2- If the signal is due to "loss", C4 will only exit the initial state if more than 20 packets have been received. The restriction on delay signals and ECN is meant to prevent spurious exit due to delay jitter or competing connections. The restriction on loss signals is meant to ensure that enough packets have been received to properly assess the loss rate. On exiting the Initial state, C4 computes an estimate of the nominal max RTT as the quotient of the half the last CWND divided by the last nominal rate, and updates the "nominal max RTT" accordingly. The probe level is set to 1. 4.2.1. Reentering the initial state When reentering the initial state, C4 already has an estimate of the current nominal rate and nominal max RTT. CWND is set to the product of nominal rate and nominal max RTT. The initial state then operates as specified in Section 4.2. Huitema, et al. Expires 30 August 2026 [Page 9] Internet-Draft C4 Specification February 2026 4.3. Recovery state The recovery state is entered from the Initial or Pushing state, or from the Cruising state in case of congestion. The coefficient alpha_current is set to 15/16. Because the multiplier is lower than 1, the new value of CWND may well be lower than the current number of bytes in transit. C4 will wait until acknowledgements are received and the number of bytes in transit is lower than CWND to send new packets. The Recovery ends when the first packet sent during that state is acknowledged. That means that acknowledgement and congestion signals received during recovery are the consequence of packets sent before. C4 assumes that whatever corrective action is required by these events will be taken prior to entering recovery, and that events arriving during recovery are duplicate of the prior events and can be ignored. Rate increases are detected when acknowledgements received during recovery reflect a successful "push" during the Pushing phase. The prior "Pushing" is considered successful if it did not trigger any congestion event, and if the data rate increases sufficiently between the end of previous Recovery and the end of this one, with sufficiently being defined as: * Any increase if the prior pushing rate (alpha_prior) was 17/16 or less, * An increase of at least 1/4th of the expected increase otherwise, for example an increase of 1/16th if alpha_previous was 5/4. The probe level is updated as follow: * If the prior pushing was successful, and did not trigger an excessive rate of ECN/CE marks, the probe level is increased by 1. * If the prior pushing was successful but did trigger an excessive rate of ECN/CE marks, the probe level remains unchanged. * If the prior pushing was not successful but did not trigger an excessive rate of ECN/CE marks, the probe level left unchanged if it was 0, set to 1 otherwise. * If the prior pushing was not successful and did trigger an excessive rate of ECN/CE marks, the probe level is set to 0. Huitema, et al. Expires 30 August 2026 [Page 10] Internet-Draft C4 Specification February 2026 C4 re-enters "Initial" at the end of the recovery period if the probe level as reached a value 4 or larger, or if high jitter requires restarting the Initial phase (see Section 4.3.1. Otherwise, C4 enters cruising. Reception of a congestion signal during the Initial phase does not cause a change in the nominal_rate or nominal_max_RTT. 4.3.1. Restarting Initial if High Jitter The "nominal max RTT" is not updated during the Initial phase, because doing so would prevent exiting Initial on high delay detection. This can lead to underestimation of the "nominal rate" if the flow is operating on a path with high jitter. C4 will reenter the "initial" phase on the first time high jitter is detected for the flow. The high jitter is detected after updating the "nominal max RTT" at the end of the recovery era, if: running_min_rtt < nominal_max_rtt*2/5 This will be done at most once per flow. 4.4. Cruising state {#c4-cruising } The Cruising state is entered from the Recovery state. The coefficient alpha_current is set to 1. C4 will transition from Cruising state to Pushing state after a number of eras that depend on the probe level: * 1 era if the probe level is 0, * 4 eras if the probe level is 1, * 1 era if the probe level is 2 or 3. C4 will transition to Recovery before that if a congestion signal is received before transition to Pushing. 4.5. Pushing state The Pushing state is entered from the Cruising state. The coefficient alpha_current depend on the probe level: * If the probe level is 0, alpha_current is set to 33/32. Huitema, et al. Expires 30 August 2026 [Page 11] Internet-Draft C4 Specification February 2026 * If the probe level is 1, alpha_current is set to 17/16. * If the probe level is 2 or higher, alpha_current is set to 5/4. C4 exits the pushing state after one era, or if a congestion signal is received before that. In an exception to standard congestion processing, the reduction in nominal_rate and nominal_max_RTT are not applied if the congestion signal is tied to a packet sent during the Pushing state. 5. Handling of congestion signals C4 responds to congestion events by reducing the nominal rate, and in some condition also reducing the nominal max RTT. C4 monitors 3 types of congestion events: 1. Excessive increase of measured RTT, 2. Excessive rate of packet losses (but not mere Probe Time Out, see Section 5.3.1), 3. Excessive rate of ECN/CE marks C4 monitors successive RTT measurements and compare them to a reference value, defined as the sum of the "nominal max rtt" and a "delay threshold". C4 monitors the arrival of packet losses computes a "smoothed error rate", and compares it to a "loss threshold". When the path supports ECN, C4 monitors the arrival of ECN marks and computes a "smoothed CE rate", and compares it to a "CE threshold". These coefficients depend on the sensitivity coefficient defined in Section 5.1. 5.1. Variable Sensitivity The three congestion detection thresholds are function of the "sensitivity" coefficient, which increases with the nominal rate of the flow. Flows operating at a low data rate have a low sensitivity coefficient and reacts slower to congestion signals than flows operating at a higher rate. If multiple flows share the same bottleneck, the flows with higher data rate will detect congestion signals and back off faster than flow operating at lower rate. This will drive these flows towards sharing the available resource evenly. The sensitivity coefficient varies from 0 to 1, according to a simple curve: * set sensitivity to 0 if data rate is lower than 50000 B/s Huitema, et al. Expires 30 August 2026 [Page 12] Internet-Draft C4 Specification February 2026 * linear interpolation between 0 and 0.92 for values between 50,000 and 1,000,000 B/s. * linear interpolation between 0.92 and 1 for values between 1,000,000 and 10,000,000 B/s. * set sensitivity to 1 if data rate is higher than 10,000,000 B/s The sensitivity index is then used to set the value of delay and loss and CE thresholds. 5.2. Detecting Excessive Delays The delay threshold is function of the nominal max RTT and the sensitivity coefficient: delay_fraction = 1/16 + (1 - sensitivity)*3/16 delay_threshold = min(25ms, delay_fraction*nominal_max_rtt) A delay congestion signal is detected if: rtt_sample > nominal_max_rtt + delay_threshold 5.3. Detecting Excessive Losses C4 maintains an average loss rate, updated for every packet as: if packet_is_lost: loss = 1 else: loss = 0 smoothed_loss_rate = (loss + 15*smoothed_loss_rate)/16 The loss threshold is computed as: loss_threshold = 0.02 + 0.50 * (1-sensitivity); A loss is detected if the smoothed loss rate is larger than the threshold. In that case, the coefficient beta is set to 1/4. 5.3.1. Do not react to Probe Time Out QUIC normally detect losses by observing gaps in the sequences of acknowledged packet. That's a robust signal. QUIC will also inject "Probe time out" packets if the PTO timeout elapses before the last sent packet has not been acknowledged. This is not a robust congestion signal, because delay jitter may also cause PTO timeouts. When testing in "high jitter" conditions, we realized that we should Huitema, et al. Expires 30 August 2026 [Page 13] Internet-Draft C4 Specification February 2026 not change the state of C4 for losses detected solely based on timer, and only react to those losses that are detected by gaps in acknowledgements. 5.4. Detecting Excessive CE Marks The way we handle ECN signals is designed to be compatible with L4S [RFC9331]. When the path supports ECN marking, C4 monitors the arrival of ECN/CE and ECN/ECT(1) marks by computing the ratio ecn_alpha. Congestion is detected when that ratio exceeds ecn_threshold, which varies depending on the sensitivity coefficient: ecn_threshold = (2-sensitivity)*3/32 The ratio ecn_alpha is updated each time an acknowledgement is received, as follow: delta_ce = increase in the reported CE marks delta_ect1 = increase in the reported ECT(1) marks frac = delta_ce / (delta_ce + delta_ect1) if frac >= 0.5: ecn_alpha = frac else: ecn_alpha += (frac - ecn_alpha)/16 if ecn_alpha > ecn_threshold: report congestion Congestion detection causes C4 to enter recovery. The ration ecn_alpha is set to zero on exit of recovery. 5.5. Applying congestion signals On congestion signal, if C4 was not in recovery state, it will enter recovery. As stated in Section 4.2 and Section 4.5, detecting a congestion in the Initial or Pushing state does not cause a change in the nominal_rate or nominal_max_RTT, because the pacing rate in these states is larger than the nominal_rate. Rate reduction only happens if recovery was entered from the Cruising state. 5.5.1. Rate Reduction on Congestion On entering recovery from the cruising state, C4 reduces the nominal_rate by the factor "beta" corresponding to the congestion signal: Huitema, et al. Expires 30 August 2026 [Page 14] Internet-Draft C4 Specification February 2026 nominal_rate = (1-beta)*nominal_rate The coefficient beta differs depending on the nature of the congestion signal. For packet losses, it is set to 1/4, similar to the value used in Cubic. For delay based losses, it is proportional to the difference between the measured RTT and the target RTT divided by the acceptable margin, capped to 1/4: beta = min(1/4, (rtt_sample - (nominal_max_rtt + delay_threshold)/ delay_threshold)) If the signal is an ECN/CE rate, the coefficient is proportional to the difference between ecn_alpha and ecn_threshold, capped to 1/4: beta = min(1/4, (ecn_alpha - ecn_threshold)/ ecn_threshold) 6. Implementation considerations Implementing C4 ought to be straightforward, but developers need to pay attention to measurement of data rates and to pacing issues when the CPU load is high. 6.1. Rate measurement should be conservative The standard algorithm for rate measurement is to consider the amount of data acknowledged in an interval of time, and divide that amount by the duration of the interval. This algorithm can result in over- estimates of the rate in presence of data jitter. These excessive estimates could cause C4 to set a nominal rate higher than the network path bandwidth, resulting in queue build-up and excessive delays. There are two known ways to reduce the effect of jitter: filter out measurements in which the data rate measured through acknowledgements is larger than the send rate; and, make sure that the measurement interval are long enough so jitter only has a small influence. Cautious implementations should use both strategies. Huitema, et al. Expires 30 August 2026 [Page 15] Internet-Draft C4 Specification February 2026 6.2. Pacing and CPU load C4 relies on pacing during to avoid sending data too fast during the recovery, cruising and pushing states. Pacing is often implemented using a "leaky bucket" algorithm, which refills the bucket at the pacing rate, allows transmission as long as there are enough tokens in the bucket, and forces transmission to wait when all tokens are consumed. The wait time is computed based on the pacing rate and the number of desired tokens, and is implemented using operating system commands such as select(), poll(), epoll() or sleep(). In high CPU load conditions, we observe that these commands often return after more than the specified wait time, resulting in a lower sending rate than the desired pacing rate. This phenomenom is particularly visible in low-latency paths. The generic solution would probably be to estimate how much slower the actual pacing is compared to the desired rate, and increase the programmed pacing rate by a value proportional to these measurements. This generic solution is not yet specified. In between, implementations had success with a simple fix: increase the pacing rate 3/64th in "cruising" state when the RTT is less than 1ms. This definitely improved performance in low-latency environment, in particular loopback interfaces. 6.3. Nominal max RTT on low latency links When doing tests on low latency links, we observed on some systems a lot of measurement jitter. The measured RTT is the sum of the actual RTT and some system wakeup delay, which can vary between a few microseconds and maybe 1 millisecond. The default algorithm will adapt the nominal RTT after each roundtrip, which can lead to excessively low values, causing a slowdown of the transmission. A solution is to set a "floor" value to the nominal max RTT, updating it to the maximum of the measured value and the floor. Setting the floor value to 1ms did improve performance. 7. Security Considerations We do not believe that C4 introduce new security issues. Or maybe there are, such as what happen if applications can be fooled in going to fast and overwhelming the network, or going too slow and underwhelming the application. Discuss! 8. IANA Considerations This document has no IANA actions. 9. References Huitema, et al. Expires 30 August 2026 [Page 16] Internet-Draft C4 Specification February 2026 9.1. Normative References [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, March 1997, . [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, May 2017, . 9.2. Informative References [RFC9000] Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based Multiplexed and Secure Transport", RFC 9000, DOI 10.17487/RFC9000, May 2021, . [I-D.ietf-moq-transport] Nandakumar, S., Vasiliev, V., Swett, I., and A. Frindell, "Media over QUIC Transport", Work in Progress, Internet- Draft, draft-ietf-moq-transport-16, 13 January 2026, . [RFC9331] De Schepper, K. and B. Briscoe, Ed., "The Explicit Congestion Notification (ECN) Protocol for Low Latency, Low Loss, and Scalable Throughput (L4S)", RFC 9331, DOI 10.17487/RFC9331, January 2023, . Acknowledgments TODO acknowledge. Changes since previous versions This section should be deleted before publication as an RFC Changes since draft-huitema-ccwg-c4-spec-00 Rewrote the description of the Initial state in Section 4.2 to remove dependency on nominal max RTT. Added the specification of reaction to ECN in Section 5.4 and in Section 5.5.1. Update section Section 4.5 to modulate pushing rate based on observed rate of ECN/CE marks. Huitema, et al. Expires 30 August 2026 [Page 17] Internet-Draft C4 Specification February 2026 Added the RTT margin consideration in Section 4.1, and changed the computation of the "quantum" from: quantum = max ( min (cwnd / 4, 64KB), 2*MTU) to: quantum = max ( min (pacing_rate*4_milliseconds, 64KB), 2*MTU) The old formula caused long bursts of packets that would trigger packet drops or ECN/CE marking by active queue management algorithms. Authors' Addresses Christian Huitema Private Octopus Inc. Email: huitema@huitema.net Suhas Nandakumar Cisco Email: snandaku@cisco.com Cullen Jennings Cisco Email: fluffy@iii.ca Huitema, et al. Expires 30 August 2026 [Page 18]