<?xml version="1.0" encoding="US-ASCII"?>
	<!-- 
	     draft-rfcxml-general-template-annotated-00
	  
	     This template includes examples of most of the features of RFCXML with comments explaining 
	     how to customise them, and examples of how to achieve specific formatting.
	     
	     Documentation is at https://authors.ietf.org/en/templates-and-schemas
	-->
	<?xml-model href="rfc7991bis.rnc"?>  <!-- Required for schema validation and schema-aware editing -->
	<!-- <?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?> --> 
	<!-- This third-party XSLT can be enabled for direct transformations in XML processors, including most browsers -->
	
	<!DOCTYPE rfc [
	  <!ENTITY nbsp    "&#160;">
	  <!ENTITY zwsp   "&#8203;">
	  <!ENTITY nbhy   "&#8209;">
	  <!ENTITY wj     "&#8288;">
					]>
	
	<!-- Extra statement used by XSLT processors to control the output style. -->
	<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>
	<!-- Processing Instructions- PIs (for a complete list and description,
	     see file http://xml.resource.org/authoring/README.html.
	     You may find that some sphisticated editors are not able to edit PIs when palced here.
	     An alternative position is just inside the rfc elelment as noted below. -->
	<!-- Some of the more generally applicable PIs that most I-Ds might want to use -->
	<!-- Try to enforce the ID-nits conventions and DTD validity -->
	<?rfc strict="yes" ?>
	<!-- Items used when reviewing the document -->
	<!-- Controls display of <cref> elements -->
	<?rfc comments="yes" ?>
	<!-- When no, put comments at end in comments section,
	     otherwise, put inline -->
	<?rfc inline="yes" ?>
	<!-- When yes, insert editing marks: editing marks consist of a 
	     string such as <29> printed in the blank line at the 
	     beginning of each paragraph of text. -->
	<?rfc editing="no" ?>
	<!-- Create Table of Contents (ToC) and set some options for it.  
	     Note the ToC may be omitted for very short documents,but idnits insists on a ToC 
	     if the document has more than 15 pages. -->
	<?rfc toc="yes"?>
	<?rfc tocompact="yes"?>
	<!-- If "yes" eliminates blank lines before main section entries. -->
	<?rfc tocdepth="3"?>
	<!-- Sets the number of levels of sections/subsections... in ToC.
	   Can be overridden by 'toc="include"/"exclude"' on the section
	   element-->
	<!-- Choose the options for the references. 
	     Some like symbolic tags in the references (and citations) and others prefer 
	     numbers. The RFC Editor always uses symbolic tags.
	     The tags used are the anchor attributes of the references. -->
	<?rfc symrefs="yes"?>
	<?rfc sortrefs="yes" ?>
	<!-- If "yes", causes the references to be sorted in order of tags.
				 This doesn't have any effect unless symrefs is "yes"
	          also. --> 
	<!-- These two save paper: Just setting compact to "yes" makes savings by not starting each 
	     main section on a new page but does not omit the blank lines between list items. 
	     If subcompact is also "yes" the blank lines between list items are also omitted. -->
	<?rfc compact="yes" ?>
	<?rfc subcompact="no" ?>
	<!-- end of list of popular I-D processing instructions -->
	
	<!-- Information about the document.
	     category values: std, bcp, info, exp, and historic
	     For Internet-Drafts, specify attribute "ipr".
	         original ipr values are: full3978, noModification3978, noDerivatives3978), 
	         2008 IETF Trust versions: trust200811, noModificationTrust200811, noDerivativeTrust200811
	         2009/Current: trust200902, noModificationTrust200902, noDerivativesTrust200902, pre5378Trust200902
	     Also for Internet-Drafts, you must specify a value for attributes "docName" which is 
	        typically the file name under which it is filed but need not be.
	     If relevant, "iprExtract" may be specified to denote the anchor attribute value of a
	        section that can be extracted for separate publication, it is only useful when the value
	        of "ipr" does not give the Trust full rights.
	     "updates" and "obsoletes" attributes can also be specified here, their arguments are
	        comma-separated lists of RFC numbers (just the numbers) -->
	<rfc
	  xmlns:xi="http://www.w3.org/2001/XInclude"
	  category="info"
	  docName="draft-livingood-low-latency-deployment-14"
	  ipr="trust200902"
	  obsoletes=""
	  updates=""
	  submissionType="independent"
	  xml:lang="en"
	  version="3">
	
	
	  <!-- ***** FRONT MATTER ***** -->
	
	  <front>
	
	    <title abbrev="ISP Dual Queue Observations">ISP Dual Queue Networking Deployment Observations</title>
	    <seriesInfo name="Internet-Draft" value="draft-livingood-low-latency-deployment-14"/>
	
	    <!-- add 'role="editor"' below for the editors if appropriate -->
	    <author fullname="Jason Livingood" initials="J" surname="Livingood">
		   <organization>
	           Comcast
	       </organization>
	      <address>
	        <postal>
	          <city>Philadelphia</city> <region>PA</region>
	          <country>USA</country>
	        </postal>
	        <email>jason_livingood@comcast.com</email>
	      </address>
	    </author>
	
	    <date month="March" day="1" year="2026"/>
	
	    <!-- Meta-data Declarations -->
	    <!-- WG name at the upper left corner of the doc,
	         IETF fine for individual submissions.  You can also
	         omit this element in which case it defaults to "Network Working Group" -
	         a hangover from the ancient history of the IETF! -->

	    <workgroup>Independent Stream</workgroup>
	
		<!-- You can add <keyword/> elements here.  They will be incorporated into HTML output
	         files in a meta tag but they have no effect on text or nroff output. -->
		<!-- <keyword>Text</keyword> (as many of those elements as needed -->
	

	    <abstract>
	      <t>The IETF's Transport and Services Working Group (TSVWG) has finalized experimental RFCs for Low Latency, 
	      Low Loss, Scalable Throughput (L4S) and new Non-Queue-Building (NQB) per hop behavior. 
	      These documents describe a new architecture and protocol for deploying low latency networking. 
          Since deployment decisions are left to implementers, this document explores some of the 
	      implications of those decisions and makes suggestions that can help drive adoption and acceptance of 
		  L4S and NQB based on observations from the world's first large scale deployment.</t>
	    </abstract>
	
		
	  </front>
	
	  <middle>
        <!--  <t>The key words "must", "must NOT", "REQUIRED", "SHALL", "SHALL NOT",
	      "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
	      document are to be interpreted as described in
		  <xref target="RFC2119">RFC 2119</xref>.</t> -->

	    <section title="Introduction">
			    
		<t>The IETF's Transport and Services Working Group (TSVWG) has finalized RFCs for Low Latency, 
		Low Loss, Scalable Throughput (L4S) and Non-Queue-Building (NQB) per hop behavior <xref target="RFC9330"/> 
		<xref target="RFC9331"/> <xref target="RFC9332"/> <xref target="RFC9435"/>
		<xref target="I-D.ietf-tsvwg-l4sops"/> <xref target="I-D.ietf-tsvwg-nqb"/>. These documents do a good 
		job of describing a new architecture and protocol for deploying low latency networking. 
		But as is normal for many such standards, especially new or experimental ones, certain deployment decisions 
		are ultimately left to implementers.</t>
		
		<t>This document explores some of the key deployment decisions and makes suggestions that may help drive adoption 
		by network operators and application developers. These decisions are not inherent to L4S and NQB per se, 
		but are decisions that can change depending upon differing technical, regulatory, business or other 
		requirements. This document suggests that certain specific deployment decisions - based on observations from the world's first large scale deployment - that can help
		maximize the value of low latency networking to end users, network operators, and application developers.</t> 
		
		<t>For additional background on latency and why latency matters to the Internet, please 
        read <xref target="BITAG"/>.</t>
	
	    
	    <section title="A Different Understanding of Application Needs">
		    <t>In the course of working to improve the responsiveness of network protocols, the IETF 
			    concluded with their L4S and NQB work that there were two main types of traffic 
			    and that these two traffic types could benefit from having separate network processing queues 
			    in order to improve the way the performance of delay-sensitive and/or interactive applications. 
				Introducing a new queue enables incremental development of a new standard 
				rather than changing existing congestion control algorithms for existing traffic on all networks, hosts, and clients - which would be complex.</t>
			    
			    <t>One of the two major traffic types is mostly file download or upload, such as downloading an operating 
				system update or uploading files to a cloud backup. This type of traffic is not delay-sensitive, at least on a millisecond level 
				basis. The other type of traffic is real-time, 
				interactive traffic that is latency-sensitive, such as video conferencing, gaming, and artificial intelligence (AI) interactions.</t>
			    
				<t>The value of dual queue networking (simply "low latency networking" hereafter) 
				seems potentially good, and at least one major ISP has deployed it <xref target="Comcast"/>. 
				It seems possible that 
					this new capability might enable entirely new classes of applications to become possible, 
					driving a wave of new Internet innovation, while also improving the latency-sensitive 
					applications that people use today.</t>

	<table anchor="app_classification_table" align="center">
  <name>Latency Sensitivity of Example Applications</name>
  <thead>
    <tr>
      <th align="left">Primary Goal</th>
      <th align="left">Examples</th>
	  <th align="left">Flow Properties</th>
      <th align="left">IETF Classification</th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td align="left">Low Latency</td>
      <td align="left">VoIP, DNS, game sync packets, some machine-to-machine and IoT communications</td>
	  <td align="left">Low data rate, application-limited flows</td>
      <td align="left">Non-Queue-Building (NQB)</td>
    </tr>
	<tr>
      <td align="left">Low Latency with High Throughput</td>
      <td align="left">Cloud gaming, video conferencing, adaptive video streaming, instant messaging, web browsing, VoIP, cloud-based interactive video, cloud-based virtual and augmented reality</td>
	  <td align="left">Low data rate, application-limited flows and high data rate, throughput-limited flows</td>
      <td align="left">Low Latency, Low Loss, Scalable Throughput (L4S)</td>
    </tr>
    <tr>
      <td align="left">High Throughput without Respect to Latency</td>
	  <td align="left">Bursty traffic flows and high data rate traffic flows</td>
      <td align="left">Software Updates, Cloud Backups, P2P File Sharing</td>
      <td align="left">Queue-Building (QB)</td>
    </tr>

  </tbody>
</table>

		</section>
		
		<section title="New Thinking on Low Latency Packet Processing" anchor="NewThinking">			
			<t>L4S does *not* provide low latency in the same way as previous technologies like DiffServ Quality 
			of Service (QoS). That prior 
			QoS approach used packet prioritization, where it was possible to assign a higher 
			relative priority to certain application traffic, such as Voice over IP (VoIP) telephony. This approach 
			could provide consistent and relatively low latency by assigning high priority to a partition 
			of the capacity of a link and then policing the rate of packets using that partition. This 
			traditional approach to QoS is hierarchical in nature.</t>
			
			<t>That QoS approach is to some extent predicated on the idea that network capacity is 
			very limited and that links are often highly utilized. But on today's Internet, many users have 
			experienced poor application performance, such as video conferencing, despite having sufficient bandwidth. 
			In many of these scenarios, prioritization will not improve a flow. But finding a way to reduce latency 
			has proven beneficial. This new low latency networking approach is not based on hierarchical 
			QoS prioritization. Rather, it is built upon conditional priority scheduling between two queues 
			that operate at best effort QoS priority.</t>
			
		</section>

	<section title="Application Performance Benefits" anchor="Benefits">			
			<t>The benefits of low latency networking to end user applications, especially interactive ones, is significant. In the Comcast network in 
			the United States, this technology is deployed to over ten million homes as of January 2026. That encompasses over 300 million end user devices, 
			based on the typical number of devices on a user Local Area Network (LAN). Comcast has shared in many IETF meeting presentations the data 
			showing latency and jitter reductions (such as in <xref target="IETF-122-Slides"/>). At a high level, 99th percentile loaded 
			latency for downstream traffic declined from ~65 ms to ~33 ms from implementation of downstream Active Queue Management (AQM) on the Cable Modem Termination System (CMTS). 
			The new low latency queue (for L4S and NQB) further lowered downstream loaded latency to ~18 ms and upstream loaded latency to ~20 ms. The DOCSIS link layer itself in the 
			Comcast is responsible for a baseline idle latency of 13-17 ms, which means that loaded latencies for L4S and NQB traffic are very close to idle latencies. Jitter is also 
			significantly lower and more consistent.</t>

			<t>This means that video conferencing applications such as Apple FaceTime and cloud gaming such as NVIDIA GeForce NOW and Valve's Steam platform will perform much 
			better on a network that supports low latency networking. It benefits any marked application that is interactive in nature, where a user is interacting with a screen or other device, 
			via mouse, keyboard, voice command, gesture, or other interactivity mechanism, and the interaction involves remote entities. 
            Apple recently shared statistics <xref target="IETF-123-Slides"/> that they collected that confirm 
			this performance, using Responsiveness Under Working Conditions tests <xref target="I-D.ietf-ippm-responsiveness"/>.</t>
			
		</section>


        </section>

        <!--  END MAJOR SECTION --> 
        <!--  START NEW MAJOR SECTION --> 
	    
	    <section title="Key Low Latency Networking Concepts">

        <t>In the past, many thought that the only way to improve application quality was via more bandwidth or 
		by using QoS priority. The advent of low latency networking enables a re-examination of those approaches. It was also thought that networks and applications had to choose 
		between either high throughput or low delay - but dual queue low latency demonstrates that both can be achieved simultaneously.</t>
	    
			<section title="Throughput is Bounded by Congestion Control Algorithms">
		    	<t>The Mathis Equation <xref target="Mathis"/> explains how throughput is bounded in the Reno congestion control algorithm that was in use at that time. Reflections on 
                this approach were published later and hint at the potential for new approaches like those explored in this document <xref target="Mathis-Reflections"/>.</t>

                <t>This equation shows that throughput scales at 1/sqrt(p), where p is the packet loss probability.  The square root is a problem, because achieving a
                ten-fold increase in throughput requires a one-hundred-fold reduction in packet loss probability, and thus a ten-fold reduction in packet loss rate on a per-second basis.  
                This becomes unscalable as path capacities increase, as the required time between congestion signals becomes longer than the typical duration of a connection.</t>


				<t>This nonlinear relationship described in the equation means that, to take a link from 1 Gbps to 10 Gbps for example, packet loss would need to be reduced 
				one-hundred-fold. This makes it increasingly hard to hit ever-higher data rates in real world environments, especially with WiFi and 5G links, where those levels of loss are 
				unachievable at the current time.</t> 


                <t>While the dominant congestion control algorithm today (Cubic) improves upon this, it still requires long intervals between congestion signals as rates 
                increase <xref target="RFC9438"/>. Alternative congestion controllers like BBR <xref target="BBR-Paper"/> aim to infer the link rate without relying on packet loss as a signal but do so with very 
                limited information from the path, and can lead to fairness issues, oscillations in throughput, starvation and other unwanted effects <xref target="Starvation"/> <xref target="BBR-Analysis"/>.</t>

                <t>L4S replaces packet loss with an explicit signal (CE mark) and it takes advantage of the fact that, in contrast to packet loss, the explicit congestion signal is not a 
                degradation of communication and thus can be provided liberally by the network.</t>

                <t>L4S also requires that the congestion control algorithm scales its throughput proportional to 1/p, where p here is the congestion marking probability. What this means 
                in practice is that if you increase throughput by 10x, you only need to reduce the congestion signal probability by 10x rather than 100x, and the rate of congestion signals 
                on per-second basis remains constant.  As a result, applications get very frequent and fine-grained feedback that they use to make adjustments to their sending rate, and 
                congestion control is fully scalable, with no loss in the frequency of signals as the path capacity increases.</t>

				<t>This table illustrates the implications of this for an example of a TCP connection with 50 ms RTT (example idle and working latencies can be seen in <xref target="FCC-MBA-2023"/>).</t>
			<table anchor="congestion_signal_comparison" align="center">
  <name>Comparison of Congestion Signal Frequency at 50ms RTT</name>
  <thead>
    <tr>
      <th align="left">Data Rate</th>
      <th align="left">Reno: Interval Between Congestion Signals</th>
      <th align="left">Cubic: Interval Between Congestion Signals</th>
      <th align="left">L4S: Interval Between Congestion Signals</th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td align="left">1 Mbps</td>
      <td align="left">285 ms</td>
      <td align="left">160 ms</td>
      <td align="left">12.5 ms</td>
    </tr>
    <tr>
      <td align="left">10 Mbps</td>
      <td align="left">2.85 sec</td>
      <td align="left">350 ms</td>
      <td align="left">12.5 ms</td>
    </tr>
    <tr>
      <td align="left">100 Mbps</td>
      <td align="left">28.5 sec</td>
      <td align="left">740 ms</td>
      <td align="left">12.5 ms</td>
    </tr>
    <tr>
      <td align="left">1 Gbps</td>
      <td align="left">4.75 min</td>
      <td align="left">1.6 sec</td>
      <td align="left">12.5 ms</td>
    </tr>
    <tr>
      <td align="left">10 Gbps</td>
      <td align="left">47.5 min</td>
      <td align="left">3.5 sec</td>
      <td align="left">12.5 ms</td>
    </tr>
    <tr>
      <td align="left">100 Gbps</td>
      <td align="left">7.9 hrs</td>
      <td align="left">7.5 sec</td>
      <td align="left">12.5 ms</td>
    </tr>
  </tbody>
</table>


	    	</section>	

			<section title="Best Effort Priority">
		    	<t>Low latency traffic is not prioritized over other 
				(best effort priority) "classic" Internet traffic. This best effort approach stands 
				in contrast to prior differential quality of service (QoS) approaches or to what has been discussed 
				for 5G network slicing <xref target="CDT-NN"/> <xref target="van-Schewick-1A"/> 
				<xref target="van-Schewick-1B"/> <xref target="van-Schewick-2"/> <xref target="van-Schewick-3"/>.</t>

				<t>Those approaches are grounded in an assumption that there is scarce bandwidth and so the network must grant higher priority to some flows, 
				creating bandwidth winners and losers. That has raised the ire of network neutrality proponents, who have focused on negative effects this can 
				have on flows that are not prioritized and the terms under which certain applications or destinations may be granted priority.</t>

				<t>Another contrast with 5G network slicing is that IETF standards such as L4S do not require network operator-specific APIs, direct coordination, or the 
				granting of permission by technical or legal means. Rather, marking packets with ECT(1) or CE as part of L4S will work on any network that has implemented 
				L4S, with no need to coordinate with each network or seek permission. This exemplifies the loose coupling across layer (network and application) and 
				permissionless innovation (at the edge by application developers) that are core tenets of the Internet's architecture.</t>

				<t>The only exception for priority is within a user's in-home Wi-Fi network (in the case of a fixed network)
				due to the particulars of how the IEEE 802.11 wireless protocol <xref target="IEEE"/> functions 
				at the current time - see <xref target="RFC8325"/>. Some user access points 
				may prioritize certain traffic (such as gaming) and some traffic such as NQB may use the 
				AC_VI Wi-Fi link layer queue <xref target="I-D.ietf-tsvwg-nqb"/>.</t>
	    	</section>
	    
			<section title="Shared Capacity">
		    	<t>Low latency networking flows do not get access to greater capacity than "classic" flows. 
				Thus, a user's total provisioned or permitted capacity on an ISP access network link is 
				shared between both classic and low latency queues. This removes an incentive to game the system through low latency 
                packet marking.</t>
				
				<t>Another way to think of L4S is that it is not really an instruction to a dual queue network link to ask for low latency treatment per se. Rather, applications marking for 
				L4S are essentially making a promise to the network that the application will rapidly reduce throughput if needed (when detecting CE marks); it promises to help keep latency low by being a 
				good network citizen.</t>
	    	</section>

	    	
	    	<section title="Access-Agnostic">
		    	<t>Low latency networking can be implemented in a 
					variety of network technologies. For example in access network technologies this could be 
					implemented in DOCSIS <xref target="LLD"/>, 5G <xref target="Ericsson"/>, 
					PON <xref target="CTI"/>, WiFi, Low Earth Orbit (LEO) satellite and many other types of networks.</t>
	    	</section>

		<section title="End-to-End Diagram"> 
		<t>This diagram shows an example of the end-to-end path for two different user devices; one phone connected to the home WiFi network and one PC 
		connected via Ethernet to the home LAN. Along this full path, L4S or NQB marks must be able to pass between an application on a client device and 
		an application server. While in theory dual queue low latency networking can be implemented on any of the routers on this path or the access point, 
		the most common bottlenecks are in the home network (WiFi), the CPE router, and the aggregation router. This alone will provide a tremendous benefit to 
		interactive end user applications and dual queue need not in that case be deployed at any of the other hops.</t>

<figure>
  <name>Network Architecture Diagram</name>
  <artwork type="svg">
  <svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="165px" width="730px" viewBox="0 0 730 165" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
      <path d="M 8 3 L 8 35" fill="none" stroke="black"/>
      <path d="M 8 115 L 8 163" fill="none" stroke="black"/>
      <path d="M 72 3 L 72 35" fill="none" stroke="black"/>
      <path d="M 72 115 L 72 163" fill="none" stroke="black"/>
      <path d="M 232 3 L 232 35" fill="none" stroke="black"/>
      <path d="M 232 115 L 232 163" fill="none" stroke="black"/>
      <path d="M 264 43 L 264 107" fill="none" stroke="black"/>
      <path d="M 312 3 L 312 35" fill="none" stroke="black"/>
      <path d="M 312 115 L 312 163" fill="none" stroke="black"/>
      <path d="M 368 115 L 368 163" fill="none" stroke="black"/>
      <path d="M 440 115 L 440 163" fill="none" stroke="black"/>
      <path d="M 359.812 1.697 L 359.812 49.697" fill="none" stroke="black"/>
      <path d="M 455.812 1.697 L 455.812 49.697" fill="none" stroke="black"/>
      <path d="M 511.812 1.697 L 511.812 49.697" fill="none" stroke="black"/>
      <path d="M 599.812 1.697 L 599.812 49.697" fill="none" stroke="black"/>
      <path d="M 655.812 1.697 L 655.812 49.697" fill="none" stroke="black"/>
      <path d="M 727.812 1.697 L 727.812 49.697" fill="none" stroke="black"/>
      <path d="M 8 3 L 72 3" fill="none" stroke="black"/>
      <path d="M 232 3 L 312 3" fill="none" stroke="black"/>
      <path d="M 84.325 19 L 104 19" fill="none" stroke="black"/>
      <path d="M 200 19 L 218.965 19" fill="none" stroke="black"/>
      <path d="M 8 35 L 72 35" fill="none" stroke="black"/>
      <path d="M 232 35 L 312 35" fill="none" stroke="black"/>
      <path d="M 8 115 L 72 115" fill="none" stroke="black"/>
      <path d="M 232 115 L 312 115" fill="none" stroke="black"/>
      <path d="M 368 115 L 440 115" fill="none" stroke="black"/>
      <path d="M 359.812 1.697 L 455.812 1.697" fill="none" stroke="black"/>
      <path d="M 511.812 1.697 L 599.812 1.697" fill="none" stroke="black"/>
      <path d="M 655.812 1.697 L 727.812 1.697" fill="none" stroke="black"/>
      <path d="M 84.607 131 L 112 131" fill="none" stroke="black"/>
      <path d="M 184 131 L 216.816 131" fill="none" stroke="black"/>
      <path d="M 322.632 131 L 352 131" fill="none" stroke="black"/>
      <path d="M 470.401 24.697 L 498.359 24.697" fill="none" stroke="black"/>
      <path d="M 613.473 24.759 L 642.141 24.759" fill="none" stroke="black"/>
      <path d="M 8 163 L 72 163" fill="none" stroke="black"/>
      <path d="M 232 163 L 312 163" fill="none" stroke="black"/>
      <path d="M 368 163 L 440 163" fill="none" stroke="black"/>
      <path d="M 359.812 49.697 L 455.812 49.697" fill="none" stroke="black"/>
      <path d="M 511.812 49.697 L 599.812 49.697" fill="none" stroke="black"/>
      <path d="M 655.812 49.697 L 727.812 49.697" fill="none" stroke="black"/>
      <polygon points="653.812 24.697 641.812 19.097 641.812 30.297" fill="black"/>
      <polygon points="613.812 24.697 601.812 19.097 601.812 30.297" fill="black" transform="matrix(-1, 0, 0, -1, 1215.624, 49.394)"/>
      <polygon points="509.812 24.697 497.812 19.097 497.812 30.297" fill="black"/>
      <polygon points="469.812 24.697 457.812 19.097 457.812 30.297" fill="black" transform="matrix(-1, 0, 0, -1, 927.624, 49.394)"/>
      <polygon points="365 131 353 125.4 353 136.6" fill="black"/>
      <polygon points="325 131 313 125.4 313 136.6" fill="black" transform="matrix(-1, 0, 0, -1, 638, 262)"/>
      <polygon points="270 109 258 103.4 258 114.6" fill="black" transform="matrix(0, 1, -1, 0, 373, -155)"/>
      <polygon points="270 41 258 35.4 258 46.6" fill="black" transform="matrix(0, -1, 1, 0, 223, 305)"/>
      <polygon points="230 19 218 13.4 218 24.6" fill="black"/>
      <polygon points="229 131 217 125.4 217 136.6" fill="black"/>
      <polygon points="86 131 74 125.4 74 136.6" fill="black" transform="matrix(-1, 0, 0, -1, 160, 262)"/>
      <polygon points="86 19 74 13.4 74 24.6" fill="black" transform="matrix(-1, 0, 0, -1, 160, 38)"/>
      <text x="40" y="23">Phone</text>
      <text x="152" y="23">802.11 WiFi</text>
      <text x="272" y="23">WiFi AP</text>
      <text x="308" y="87">Ethernet</text>
      <text x="36" y="135">PC</text>
      <text x="148" y="135">Ethernet</text>
      <text x="272" y="135">CPE</text>
      <text x="392" y="135">Agg</text>
      <g transform="matrix(1, 0, 0, 1, -133.902237, -142.60675)">
        <text x="544" y="164">Core/Edge</text>
        <text x="692" y="164">App Edge</text>
        <text x="816" y="164">App</text>
        <text x="532" y="180">Router</text>
        <text x="684" y="180">Router</text>
        <text x="828" y="180">Server</text>
      </g>
      <text x="268" y="151">Router</text>
      <text x="404" y="151">Router</text>
      <polygon points="412.489 108.197 400.489 102.597 400.489 113.797" fill="black" transform="matrix(0, 1, -1, 0, 514.686, -297.692)"/>
      <polygon points="412.118 55.588 400.118 49.988 400.118 61.188" fill="black" transform="matrix(0, -1, 1, 0, 350.53, 457.706)"/>
	  <path d="M 405.905 61.708 L 406.365 102.827" fill="none" stroke="black"/>
    </svg>
  </artwork>
</figure>

</section>


	    </section>
	    
        <!--  END MAJOR SECTION --> 
        <!--  START NEW MAJOR SECTION --> 

        <section title="Application Developer Implementation Suggestions">
        <t>Application developers need to add L4S or NQB packet marking to their application, which will often depend 
        upon the capabilities of a device's operation system (OS) or a software development kit (SDK) 
        <xref target="Apple"/> that the OS developer makes available. The application will 
        also need to support the appropriate marking and, when L4S is used, to implement a responsive congestion 
        controller.</t>

        <section title="Delivery Infrastructure for L4S">
        <t>Since L4S uses the Explicit Congestion Notification (ECN) field of the packet header, to ensure 
        ECN works end-to-end, application developers need to be certain that their servers, datacenter routers, 
        and any transit, cloud provider, or content delivery network (CDN) server involved in their application 
        is not altering or bleaching (removing) the value set in the ECN field. For an application to use the L4S queue, they must mark 
        their packets with the ECT(1) code point to signal L4S-capability or with the Congestion Experienced (CE) 
        code point when appropriate. Coupled with client marking, if an application client or server detects CE marks, 
        it should respond accordingly (e.g., by reducing the send rate), which typically means that the server 
        must be running a "responsive" congestion controller (i.e., is able to adjust rate based the presence or 
        absence of CE marks for L4S traffic - such as DCTCP, TCP Prague, SCReAM, and BBRv2). See Section 4.3 
        of <xref target="RFC9330"/> and Section 4.3 of <xref target="RFC9331"/> for more information about this.</t>
        </section>

        <section title="Delivery Infrastructure for NQB">
        <t>NQB uses the DSCP-45 code point in the DiffServ part of the packet header to ensure 
        NQB works end-to-end. To achieve end-to-end marking, application developers need to be certain that their servers, datacenter routers, 
        and any transit, cloud provider, or content delivery network (CDN) server involved in their application 
        is not altering or bleaching (removing) a DSCP-45 mark. The server does not need to run 
        a special responsive congestion controller. Since it is 
        common for networks to bleach DSCP marks on ingress today, so networks will need to change that 
        policy for NQB to work end-to-end (in contrast, ECN is rarely bleached).</t>
        </section>

        <section title="Only Mark Delay-Sensitive Traffic for L4S or NQB">
        <t>It may seem tempting to mark all traffic for L4S or NQB handling, but it may not help in all cases. 
		For example, a video gaming service may benefit from using L4S or 
        NQB for real-time controller inputs and gameplay.</t>    
        </section>

        <section title="Consider Application Needs in Choosing L4S vs. NQB"> 

        <t>Determine whether your application needs "sparse" flows or "congestion-controlled" (higher capacity) 
        flows. Sparse flows that are latency sensitive should be marked as NQB (thus DSCP-45). This may be things 
        like DNS queries or VoIP media flows, where maximizing the bandwidth of the flow is not necessary.</t>
        
        <t>Latency-sensitive flows that need more bandwidth are congestion controlled and identified via ECN marking. 
        These types of applications are less limited by the application protocol itself (i.e., a small DNS query), 
        which means the application quality can improve as more bandwidth is available - such as shifting a 
        video stream or a video conference session from Standard Definition (SD) to 4K quality.</t>
        </section>

		<section title="Example: iOS Application for L4S"> 

        <t>Implementations will vary depending upon variables such as server operating system, transport and application protocols, and client software and operating system. To use the example of an 
		Apple device such as an iPhone, running iOS, L4S support is built into iOS by default <xref target="L4S-Testing"/>. If the developer uses the QUIC protocol, they can use "URLSession" <xref target="URLSession"/> 
		which enables L4S.</t>
        </section>
    
        </section>

        <!--  END MAJOR SECTION --> 
        <!--  START NEW MAJOR SECTION --> 

	    <section title="ISP Implementation Suggestions">
		    
		    <t>Like any network or system, good deployment design decisions matter. In the context of deploying 
			low latency networking in an ISP network, 
		    these suggestions should help ensure that a deployment is resilient, well-accepted, and creates 
			the environment for generating strong network effects.</t>

			<t>These suggestions focus on not bleaching (removing) ECN or DSCP-45 marks for L4S and NQB, respectively. That is because 
			low latency networking will not work on any connected downstream network if these marks cannot travel end-to-end (e.g., a 
			customer of the network, including fixed and mobile end users, enterprises, and other users). There are also applications 
			that will work on a peer-to-peer, intra-domain basis in a network, and those also would not be able to take advantage of 
			L4S and NQB.</t>

			<t>ECN generally works across all domain boundaries, so unless a network has gone out of their way to bleach the ECN header, 
			this is unlikely to be a major concern.</t>

			<t>The key issue for modification or bleaching (removal of marks) is really DSCP. NQB depends upon DSCP-45 passing across domain boundaries. Historically, 
			there is little alignment between networks over common DSCP marking since historically DSCP marks have not been used across 
			domain boundaries, and each network has implemented unique approaches to how DSCP is used. In practice this means most network have a 
			router policy that will replace most or all DSCP values on ingress and mark DSCP-0 or 8 or whatever code point the receiving network uses 
			for best effort or default traffic. That means a router policy change will be needed here. Any concern over this can be mitigated by 
			ensuring that DSCP-45 traffic is treated as best effort priority like regular internet traffic.</t>
        
        
        <section title="Allow ECN Across Network Boundaries">
        <t>Traffic sent to a peer network marked with ECT(1) or CE in the ECN header must pass to that peer 
        without altering or removing the ECT(1) or CE marking (see exception below). Traffic FROM peers marked 
        with ECT(1) or CE in the ECN header must be allowed to enter the network without altering or removing 
        the ECT(1) or CE marking (see exception below). The only exception would be when a network element is 
        L4S-aware and able to add a CE mark to signal that it is experiencing congestion at that hop. The end-to-end 
		integrity of ECN marks is explored in Appendix C.1 of <xref target="RFC9331"/>.</t>
        
        <t>This part - allowing unmodified ECN across the network - is likely to be easier than DSCP-45 for 
		NQB (see next section), since it 
        appears rare that networks modify the ECN header of packet flows.</t>
        </section>
        

        <section title="Allow DSCP-45 Across Network Boundaries">
        <t>Traffic sent to a peer network marked with DSCP value 45 must pass to that peer without 
		altering or removing the DSCP 45 marking (see exception below). Traffic FROM peers marked with 
		DSCP value 45 must be allowed to enter the network without altering or removing the DSCP 45 
		marking (see exception below). The end-to-end integrity of the DSCP-45 mark is explored in Section 6.4 of <xref target="I-D.ietf-tsvwg-nqb"/>.</t>

		<t>Some networks may use DSCP 45 for internal purposes other than NQB within 
		their network. In these cases, the peer using DSCP 45 for other purposes is responsible for 
		remarking as appropriate. If possible, for operational simplicity, a network should 
		try to maintain the use of DSCP 45 on an end-to-end basis without remarking in their interior network hops.</t>
		
        </section>

		<section title="Last Mile Network (Access Network)">
        
        <t>There are two hops of interest in the last mile access network. One will be a point of user aggregation, such as a Cable 
        Modem Termination System (CMTS) or Optical Line Terminal (OLT). The second is at the user location, such as a Cable Modem (CM) 
        or Optical Network Unit (ONU), both of which are example of CPE.</t>
        
       <t>In these two queues, ISPs should consider using the optional Queue Protection function 
	   <xref target="I-D.ietf-tsvwg-nqb"/> <xref target="I-D.briscoe-docsis-q-protection"/>. This can 
	   potentially detect mismarking and take corrective action as needed.</t>

        </section>
        
        <section title="Customer Premise Equipment (Customer Edge)">

        <t>In most residential Internet services, there are typically two equipment modes. One is a very simple CPE that hands off from 
        the ISP's access network (i.e., DSL, 5G, DOCSIS, PON) and provides the customer with an Ethernet interface and IP address(es). 
        The customer then connects their own router and wireless access point (often integrated into the router, typically referred 
        to as a "wireless gateway" or "wireless router"). The other model is more typical, which is that the CPE integrates a link 
        layer termination function (i.e., Cable Modem, 5G radio, or Optical Network Unit) as well as a wireless gateway.</t>

        <t>Not all ISP networks support both of these models; sometimes only a wireless gateway is available. Even in this case, some 
        users "double NAT" and install their own router and wireless access point(s) to get whatever functionality and control over their 
        home network that they desire. The cases explored below are commonplace but may not apply to all networks.</t>
           
		<t>In some cases, dual queue networking and associated packet marking is supported up to the ISP's demarcation point - 
                such as in a cable modem. Packet markings should pass from such a demarcation point to 
                any attached customer-administered CPE, such as a router or wireless access point. That enables a 
				customer-administered router to implement dual queue networking, rather that it only being possible with 
				ISP-administered CPE.</t>

        </section>
        
        <section title="Inside the Home - Customer Local Area Network (LAN)">

        <t>As noted above with the mention of an integrated wireless gateway, the CPE and router/wireless network 
        gear is integrated into a single CPE device. Even though these are functionally in one piece of hardware, we can 
        think of the wide area network interface and local area network as functionally separate for purposes of this analysis.</t>

        <section title="802.11 WiFi Queuing">
				<t>As noted above with respect to prioritization of packets in the ISP network, all packets should be 
				handled with the same best effort priority in the ISP access network and on the internet. In a user's home 
				Wi-Fi (wireless) local area network (WLAN) this is more complicated, 
                because there is not a precise mapping between IETF packet marking and IEEE 802.11 marking,
				 explored in 
				<xref target="RFC8325"/>. In short, today's 802.11 specifications enable a Wi-Fi network to have multiple queues, 
				using different "User Priority" and "Access 
				Category" values. At the current time, these queues are AC_BK (Background), AC_BE (Best Effort), 
				AC_VI (Video), and AC_VO (Voice).</t>

				<t>As explored in Section 7.3 of <xref target="I-D.ietf-tsvwg-nqb"/>, packets in the low latency queue 
				may be expected to be marked for the best effort (AC_BE) or video (AC_VI) wireless queue. In some situations, such as a 
				user-owned wireless access point or CPE, it may not be possible for the user to select which wireless 
				queue is used. In cases where the CPE is ISP-administered, selecting a specific wireless queue may be 
				possible - though it is not yet clear what the best practice may be for this selection until ISPs and 
				application developers have more experience with low latency networking. As of the writing of this document, 
                it appears that the AC_VI queue may be used for the low latency queue in some networks - and that many 
                latency-sensitive applications are already marking their upstream wireless traffic for AC_VI and AC_VO.</t>
			</section>	

			</section>

		<section title="Packet Loss Effects">
		<t>As networks implement low latency networking, including L4S, NQB, and new forms of AQM, they may notice 
		somewhat less packet loss. This is because applications now have new signals, such as a CE mark, to signal congestion. This signal 
		is faster than the typical TCP packet loss mechanism.</t>
		
		<t>Thus, this is expected, as noted in Section 5.1 of <xref target="RFC9330" section="5.1" relative="section-5.1"/>:</t>

		<blockquote cite="RFC9330">
  			<t>Latency is not the only concern of L4S. The 'Low Loss' part of the name denotes that L4S generally achieves zero congestion loss due 
			to its use of ECN. Otherwise, loss would itself cause delay, particularly for short flows, due to retransmission delay <xref target="RFC2884"/>.</t>
		</blockquote>

		<t>In addition see Section 3 of <xref target="RFC2884" section="3" relative="section-3"/>:</t>

		<blockquote cite="RFC2884">
		<t>Since ECN marks packets before congestion actually occurs, this is useful for protocols like TCP that are sensitive to even a single 
		packet loss. Upon receipt of a congestion marked packet, the TCP receiver informs the sender (in the subsequent ACK) about incipient congestion 
		which will in turn trigger the congestion avoidance algorithm at the sender.</t>
		</blockquote>

		</section>


        <section title="Avoid Middleboxes">
        <t>As noted in <xref target="Tussle"/> there has always been a tension in the end-to-end model between how 
        much intelligence and processing takes place along the end-to-end path inside of a network and how much 
        takes place at the end of the network in servers and/or end user client devices and software. In this new 
        approach to low latency networking, entry into a low latency queue depends upon marks in the packet header 
        of a particular application flow. In practice, this marking is best left to the application edge of the network, 
        rather than it being a function of a middlebox in the ISP network. In this case, these are network elements that 
		have not been configured by an end user application but rather inserted in the path by a network operator as an 
		element where active network management policies could be applied. An application-configured element, in contrast, 
		could be something like an Oblivious HTTP Relay Resource (server) <xref target="RFC9458"/>.</t> 
		
		<t>As explored below, avoiding a middlebox and leaving marking to application clients is 
		the most efficient, least prone to misclassification, and is most acceptable from the standpoint of 
		network neutrality. So, while a middlebox may exist on an end-to-end path, it is best not to have a middlebox actively classify traffic 
		for a low latency queue; let applications make that decision to limit the potential for problems that middleboxes can cause.</t>
		    
		    <t>The best approach is for applications to mark traffic to indicate their preference for the low latency queue, 
			not the network making such a decision on its own. This is for several reasons:</t>
		    <ul>
		    <li>According to the end-to-end principle, this function is best delegated to the edge of 
		    the network as an architectural best practice (the edge being the application in this case).</li>
		    <li>Application marking maintains the loose coupling between the application and network layers, 
		    eliminating the need for close coordination between networks and application developers.</li>
		    <li>Application developers know best whether their application is compatible with low 
			    latency networking and which aspects of their traffic flows will or will not benefit.</li>
			<li>Only the application (not the network) knows whether a scalable congestion control algorithm congestion control is being 
			used on the application server. Thus, only the developer and server administrator know if they are correctly responding to 
			Congestion Experienced (CE) markings for L4S (see Section 4.1 of <xref target="RFC9331"/>). </li>
		    <li>Application traffic is almost entirely encrypted, which makes it very difficult for networks 
		    to accurately determine application protocols and to further infer which flows will benefit from low latency 
		    and which flows may be harmed because they need to build a queue. It is likely that false positives <xref target="Lotus"/> and false negatives 
			will occur if network-based 
			inference is used; all of which can be avoided simply by relying solely on application marking.</li>
		    <li>The pace of innovation and iteration is necessarily faster-moving in the application edge at layer 7, 
		    rather than in the network at layer 3 (and below) - where there is greater standards stability and a lower rate of 
		    major changes. As a result, the application layer is best suited to rapid experimentation and iteration. Network 
		    operators and equipment vendors trying to infer application needs will in comparison always be in a reactive 
		    mode, one step behind changes made in applications.</li>
			<li>This avoids issues arising from mis-classification of application flows <xref target="Lotus"/>.</li>
			<li>Any application provider should be able to mark their traffic for the low latency queue, 
			with no restrictions other than standards compliance or other reasonable and openly documented technical 
			guidelines. This maintains the loose cross-layer coupling that is a key tenet of the Internet's 
			architecture by eliminating the need for application providers and networks to coordinate and creates 
			an environment of so-called "permissionless innovation".</li>
		    </ul>
		
            </section>


        </section>

        <!--  END MAJOR SECTION --> 
        <!--  START NEW MAJOR SECTION --> 

	    <section title="IANA Considerations">
		  <t>RFC Editor: Please remove this section before
			 publication.</t>
	      <t>This memo includes no requests to or actions for IANA.</t>
	    </section>

			<section title="Security Considerations">
		  <t>The key security consideration relates to access to capacity by flows using a low latency queue when those flows 
		  do not follow the guidelines or L4S or NQB behavior. If flows mark for low latency queue treatment but are not correctly 
		  rate-responsive or low bitrate, then there is a potential risk that they may disrupt the low latency goal of the 
          low latency queue. <xref target="RFC9331"/> introduces a Queue Protection function to mitigate this risk. More can be learned 
          about this in Section 5.2 of <xref target="I-D.ietf-tsvwg-nqb" section="5.2" relative="section-5.2"/>.</t>

		  <t>The necessity of Queue Protection (also referred to as Traffic Protection) remains in debate, with some firmly 
          believing it is necessary but others 
		  believing that it is not needed. The latter 
		  view is that application developers have a natural incentive to correctly mark their traffic, because to 
		  do otherwise would worsen the Quality of Experience (QoE) for their users. In that line of thinking, if a 
		  developer mismarks, they and/or their users will notice, and they will fix that error. It is 
		  also conceivable that malicious software could be operating on a user's device or home network and that 
		  malicious software could try to send so much traffic to the low latency queue that the queue or both 
		  queues become unusable. This is quite similar to other "traditional" denial of service (DoS) attacks, so it 
		  does not necessarily seem unique to low latency networking. But due to the possibility of this occurring, and 
		  low latency networking being such a new approach, it seems prudent to implement Queue Protection.</t>
	    </section>

	    <section title="Acknowledgements">
			<t>Thanks to Bob Briscoe, Stuart Cheshire, Gorry Fairhust, Mat Ford, Vidhi Goel, Mirja Kuhlewind, Eliot Lear, 
			Matt Mathis, Sebastian Moeller, Sebnem Ozer, Jim Rampley, Dan Rice, Jason Schnitzer, Greg Skinner, Joe Touch, 
            Greg White, and Yiannis Yiakoumis for their review and feedback on this document and related presentations.</t>
		</section>
	    
	    <section title="Revision History">
		  <t>RFC Editor: Please remove this section before
			 publication.</t>
	      <t>v00: First draft</t>
	      <t>v01: Incorporate comments from 1st version after IETF-115</t>
		  <t>v02: Incorporate feedback from the TSVWG mailing list</t>
		  <t>v03: Final feedback from TSVWG and prep for sending to ISE</t>
		  <t>v04: Refresh expiration before major revision</t>
          <t>v05: Changes from Greg Skinner and Eliot Lear</t>
          <t>v06: More changes from Eliot Lear</t>
          <t>v07: More changes from Eliot Lear</t>
          <t>v08: Misc updates from IETF review</t>
          <t>v09: Additional updates during review</t>
		  <t>v10: Final changes from review</t>
          <t>v11: Suggestions and nits from Greg White, other nits</t>
          <t>v12: Sec 2.1 suggestions from Greg White, other nits</t>
          <t>v13: Nits from Jason Schnitzer, suggestions from Matt Mathis</t>
		  <t>v14: Changes from Eliot Lear</t>

	    </section>
	    
	    <section title="Open Issues">
		  <t>RFC Editor: Please remove this section before
			 publication.</t>
	    </section>
	    
	    
	  </middle>
	
	  <!--  *****BACK MATTER ***** -->
	
	  <back>
	    <!-- References split to informative and normative -->
	
	   <references title="Informative References">
	   		<xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.2884.xml"/>
			<xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.8325.xml"/>
			<xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9330.xml"/>
			<xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9331.xml"/>
			<xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9332.xml"/>
			<xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9435.xml"/>
            <xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9438.xml"/>
			<xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9458.xml"/>
		   <xi:include href="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-tsvwg-l4sops.xml"/>
		   <xi:include href="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-tsvwg-nqb.xml"/>
		   <xi:include href="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.briscoe-docsis-q-protection.xml"/>
		   <xi:include href="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-ippm-responsiveness.xml"/>
		   
		   <reference anchor="BITAG" target="https://papers.ssrn.com/sol3/papers.cfm?abstract_id=5677705">
			   <front>
	            <title>Latency Explained</title>
	            <author>
	              <organization>Broadband Internet Technical Advisory Group</organization>
	            </author>
	            <date year="2022" month="January" day="10"/>
			   </front>
		   </reference>
		   
		   <reference anchor="Lotus" target="https://www.eff.org/wp/packet-forgery-isps-report-comcast-affair">
			   <front>
	            <title>Packet Forgery By ISPs: A Report on the Comcast Affair</title>
	            <author fullname="Peter Eckersley" initials="P" surname="Eckerseley">
	              <organization>Electronic Frontier Foundation</organization>
	            </author>
                <author fullname="Fred von Lohmann" initials="F" surname="von Lohmann">
	              <organization>Electronic Frontier Foundation</organization>
	            </author>
                <author fullname="Seth Schoen" initials="S" surname="Schoen">
	              <organization>Electronic Frontier Foundation</organization>
	            </author>
	            <date year="2007" month="November" day="28"/>
			   </front>
		   </reference>

		   <reference anchor="Mathis" target="https://dl.acm.org/doi/10.1145/263932.264023">
			   <front>
	            <title>The macroscopic behavior of the TCP congestion avoidance algorithm</title>
	            <author fullname="Matthew Mathis" initials="M" surname="Mathis">
	              <organization>Pittsburgh Supercomputing Center</organization>
	            </author>
                <author fullname="Jeffrey Semke" initials="J" surname="Semke">
	              <organization>Pittsburgh Supercomputing Center</organization>
	            </author>
                <author fullname="Jamshid Mahdavi" initials="J" surname="Mahdavi">
	              <organization>Pittsburgh Supercomputing Center</organization>
	            </author>
				<author fullname="Teunis Ott" initials="T" surname="Ott">
	              <organization>Bellcore</organization>
	            </author>
	            <date year="1997" month="July" day="1"/>
			   </front>
			   <seriesInfo name="DOI" value="10.1145/263932.264023"/>
			           <seriesInfo name="Association for Computing Machinery" value="Sigcomm Computer Communications Review" />
				</reference>

            <reference anchor="Mathis-Reflections" target="https://doi.org/10.1145/1496091.1496099">
  <front>
    <title>Reflections on the TCP Macroscopic Model</title>
    <author initials="M." surname="Mathis" fullname="Matthew Mathis">
      <organization>Google</organization>
    </author>
    <date month="January" year="2009"/>
  </front>
  <seriesInfo name="ACM SIGCOMM Computer Communication Review" value="vol. 39, no. 1, pp. 47-49"/>
  <seriesInfo name="DOI" value="10.1145/1496091.1496099"/>
</reference>
		   
			<reference anchor="LLD" target="https://cablela.bs/low-latency-docsis-technology-overview-february-2019">
				<front>
					<title>Low Latency DOCSIS: Technology Overview</title>
					<author fullname="Greg White" initials="G" surname="White">
						<organization>CableLabs</organization>
						</author>
					<author fullname="Karthik Sundaresan" initials="K" surname="Sundaresan">
						<organization>CableLabs</organization>
						</author>
							<author fullname="Bob Briscoe" initials="B" surname="Briscoe">
					</author>
					<date year="2019" month="February"/>
				</front>
				
				</reference>

				<reference anchor="Ericsson" target="https://www.ericsson.com/49bc82/assets/local/reports-papers/white-papers/26052021-enabling-time-critical-applications-over-5g-with-rate-adaptation-whitepaper.pdf">
							<front>
							<title>Enabling time-critical applications over 5G with rate adaptation</title>
					<author fullname="Per Willars" initials="P" surname="Willars"><organization>Ericsson</organization></author>
					<author fullname="Emma Wittenmark" initials="E" surname="Wittenmark"><organization>Ericsson</organization></author>
					<author fullname="Henrik Ronkainen" initials="H" surname="Ronkainen"><organization>Business Area Networks</organization></author>
					<author fullname="Ingemar Johansson" initials="I" surname="Johansson"><organization>Ericsson</organization></author>
					<author fullname="Johan Strand" initials="J" surname="Strand"><organization>Business Area Networks</organization></author>
					<author fullname="Petr Ledl" initials="D" surname="Ledl"><organization>Deutsche Telekom</organization></author>
					<author fullname="Dominik Schnieders" initials="D" surname="Schnieders"><organization>Deutsche Telekom</organization></author>
	
	
							<date year="2021" month="May"/>
						</front>
							
						</reference>

			<reference anchor="CTI" target="https://www.itu.int/rec/T-REC-G.Sup71-202104-I">
							<front>
							<title>Optical line termination capabilities for supporting cooperative dynamic bandwidth assignment</title>
							<author><organization>International Telecommunications Union - Telecommunication Standardization Sector (ITU-T)</organization></author>
			
			        <date year="2021" month="April"/>
		           </front>
			           <seriesInfo name="Series G: Transmission Systems and Media, Digital Systems and Networks" value="Supplement 71" />
						</reference>

			<reference anchor="IEEE" target="https://ieeexplore.ieee.org/document/9363693">
							<front>
							<title>Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications</title>
							<author><organization>IEEE Computer Society (IEEE)</organization></author>
			        <date year="2021" month="February" day="26"/>
		           </front>
				   		<seriesInfo name="DOI" value="10.1109/IEEESTD.2021.9363693"/>
			           <seriesInfo name="IEEE Standard for Information Technology--Telecommunications and Information Exchange between Systems - Local and Metropolitan Area Networks--Specific Requirements" value="802.11-2020" />
						</reference>

			<reference anchor="Comcast" target="https://corporate.comcast.com/press/releases/comcast-introduces-nations-first-ultra-low-lag-xfinity-internet-experience-with-meta-nvidia-and-valve">
			   <front>
	            <title>Comcast Introduces Nation's 
				First Ultra-Low Lag Xfinity Internet Experience with Meta, NVIDIA, 
				and Valve</title>
	            <author>
	              <organization>Comcast</organization>
	            </author>
	            <date year="2025" month="January" day="29"/>
			   </front>
			</reference>

			<reference anchor="CDT-NN" target="https://arxiv.org/pdf/2308.05829">
			   <front>
	            <title>Slicing the Network: Maintaining Neutrality, Protecting Privacy, and Promoting Competition. 
				A technical and policy overview with recommendations for operators and regulators.</title>
				  <author fullname="Nick Doty" initials="N" surname="Doty"><organization>Center for Democracy and Technology</organization>
				  </author>
				   <author fullname="Mallory Knodel" initials="M" surname="Knodel"><organization>Center for Democracy and Technology</organization>
				  </author>
	            <date year="2023" month="April"/>
			   </front>
			</reference>

			<reference anchor="van-Schewick-1A" target="https://www.fcc.gov/ecfs/document/103120890811342/1">
			   <front>
	            <title>FCC Ex Parte In the matter of Safeguarding and Securing the Open Internet, 
				WC Docket No. 23-320</title>
				  <author fullname="Barbara van Schewick" initials="B" surname="van Schewick">
				  <organization>Center for Internet and Society, Stanford Law School</organization>
				  </author>
				  <author fullname="Scott Jordan" initials="S" surname="Jordan">
				  <organization>University of California at Irvine</organization>
				  </author>
				  <author>
				  <organization>Open Technology Institute at New America</organization>
				  </author>
				  <author>
				  <organization>Public Knowledge</organization>
				  </author>
	            <date year="2024" month="March" day="20"/>
			   </front>
			</reference>
			
			<reference anchor="van-Schewick-1B" target="https://www.fcc.gov/ecfs/document/10323701322790/2">
			   <front>
	            <title>Net Neutrality &amp; Non-BIAS Data Services</title>
				  <author fullname="Barbara van Schewick" initials="B" surname="van Schewick">
				  <organization>Center for Internet and Society, Stanford Law School</organization>
				  </author>
				  <author fullname="Scott Jordan" initials="S" surname="Jordan">
				  <organization>University of California at Irvine</organization>
				  </author>
				  <author>
				  <organization>Open Technology Institute at New America</organization>
				  </author>
				  <author>
				  <organization>Public Knowledge</organization>
				  </author>
	            <date year="2024" month="March" day="20"/>
			   </front>
			</reference>


			<reference anchor="van-Schewick-2" target="https://law.stanford.edu/wp-content/uploads/2024/08/van-Schewick-2024-5G-Network-Slicing-and-Net-Neutrality-Shetler-Steffen1.pdf">
			   <front>
	            <title>Net Neutrality &amp; 5G Network Slicing</title>
				  <author fullname="Barbara van Schewick" initials="B" surname="van Schewick">
				  <organization>Center for Internet and Society, Stanford Law School</organization>
				  </author>
	            <date year="2024" month="April" day="3"/>
			   </front>
			</reference>
			
			<reference anchor="van-Schewick-3" target="https://law.stanford.edu/wp-content/uploads/2024/08/van-Schewick-2024-5G-Network-Slicing-and-No-Throttling-Rule-20240418.pdf">
			   <front>
	            <title>Network Slicing and Net Neutrality: No Throttling Rule</title>
				  <author fullname="Barbara van Schewick" initials="B" surname="van Schewick">
				  <organization>Center for Internet and Society, Stanford Law School</organization>
				  </author>
	            <date year="2024" month="April" day="18"/>
			   </front>
			</reference>

            <reference anchor="Apple" target="https://developer.apple.com/documentation/network/testing-and-debugging-l4s-in-your-app">
			   <front>
	            <title>Testing and Debugging L4S in Your App</title>
				  <author>
				  <organization>Apple</organization>
				  </author>
			   </front>
			</reference>

			<reference anchor="IETF-122-Slides" target="https://datatracker.ietf.org/meeting/122/materials/slides-122-tsvwg-41-jason-livingood-update-on-deployment-00">
			   <front>
	            <title>Dual Queue Low Latency Networking Update</title>
				  <author fullname="Jason Livingood" initials="J" surname="Livingood">
				  <organization>Comcast</organization>
				  </author>
	            <date year="2025" month="March" day="17"/>
			   </front>
			</reference>

			<reference anchor="IETF-123-Slides" target="https://datatracker.ietf.org/meeting/123/materials/slides-123-tsvwg-l4s-with-apple-devices-00">
			   <front>
	            <title>L4S with Apple Devices</title>
				  <author fullname="Stuart Cheshire" initials="S" surname="Cheshire">
				  <organization>Apple</organization>
				  </author>
	            <date year="2025" month="July" day="23"/>
			   </front>
			</reference>

			
			<reference anchor="Tussle" target="https://dl.acm.org/doi/10.1145/633025.633059">
			   <front>
	            <title>Tussle in Cyberspace: Defining Tomorrow's Internets</title>
				  <author fullname="David D. Clark" initials="D" surname="Clark">
				  <organization>MIT Lab for Computer Science</organization>
				  </author>
				  <author fullname="John Wroclawski" initials="J" surname="Wroclawski">
				  <organization>MIT Lab for Computer Science</organization>
				  </author>
                  <author fullname="Karen R. Sollins" initials="K" surname="Sollins">
				  <organization>MIT Lab for Computer Science</organization>
				  </author>
                  <author fullname="Robert Braden" initials="R" surname="Braden">
				  <organization>USC Information Sciences Institute</organization>
				  </author>
	            <date year="2002" month="August" day="19"/>
			   </front>
			</reference>

			<reference anchor="FCC-MBA-2023" target="https://www.fcc.gov/reports-research/reports/measuring-broadband-america">
  			<front>
    		<title>Twelfth Measuring Broadband America Fixed Broadband Report</title>
    		<author>
      		<organization>Federal Communications Commission</organization>
    		</author>
    		<date year="2023" month="January"/>
  			</front>
			</reference>


			<reference anchor="URLSession" target="https://developer.apple.com/documentation/foundation/urlsession">
  			<front>
    		<title>Apple Developer Documentation, URLSession</title>
    		<author>
      		<organization>Apple</organization>
    		</author>
  			</front>
			</reference>

			<reference anchor="L4S-Testing" target="https://developer.apple.com/documentation/network/testing-and-debugging-l4s-in-your-app">
  			<front>
    		<title>Apple Developer Documentation, Testing and Debugging L4S in Your App</title>
    		<author>
      		<organization>Apple</organization>
    		</author>
  			</front>
			</reference>

            <reference anchor="BBR-Paper" target="https://dl.acm.org/doi/10.1145/3022184.3012426">
    <front>
      <title>BBR: Congestion-Based Congestion Control</title>
      <author initials="N." surname="Cardwell" fullname="Neal Cardwell"/>
      <author initials="Y." surname="Cheng" fullname="Yuchung Cheng"/>
      <author initials="C. S." surname="Gunn" fullname="C. Stephen Gunn"/>
      <author initials="S. H." surname="Yeganeh" fullname="Soheil Hassas Yeganeh"/>
      <author initials="V." surname="Jacobson" fullname="Van Jacobson"/>
      <date year="2016" month="September"/>
    </front>
    <refcontent>ACM Queue, Vol. 14, Issue 5</refcontent>
  </reference>

  <reference anchor="Starvation" target="https://doi.org/10.1145/3544216.3544223">
    <front>
      <title>Starvation in End-to-End Congestion Control</title>
      <author initials="V." surname="Arun" fullname="Venkat Arun"/>
      <author initials="M." surname="Alizadeh" fullname="Mohammad Alizadeh"/>
      <author initials="H." surname="Balakrishnan" fullname="Hari Balakrishnan"/>
      <date year="2022" month="August"/>
    </front>
    <refcontent>Proceedings of the ACM SIGCOMM 2022 Conference</refcontent>
  </reference>

  <reference anchor="BBR-Analysis" target="https://doi.org/10.23919/IFIPNetworking.2018.8696830">
    <front>
      <title>Towards a Deeper Understanding of TCP BBR Congestion Control</title>
      <author initials="D." surname="Scholz" fullname="Dominik Scholz"/>
      <author initials="B." surname="Jaeger" fullname="Benedikt Jaeger"/>
      <author initials="L." surname="Schwaighofer" fullname="Lukas Schwaighofer"/>
      <author initials="D." surname="Raumer" fullname="Daniel Raumer"/>
      <author initials="F." surname="Geyer" fullname="Fabian Geyer"/>
      <author initials="G." surname="Carle" fullname="Georg Carle"/>
      <date year="2018" month="May"/>
    </front>
    <refcontent>2018 IFIP Networking Conference</refcontent>
  </reference>
			
		   
	   </references>
	
	  </back>
	</rfc>
