<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.floyd-tsvwg-besteffort" target="https://datatracker.ietf.org/doc/html/draft-floyd-tsvwg-besteffort-04">
   <front>
      <title>Comments on the Usefulness of Simple Best-Effort Traffic</title>
      <author initials="S." surname="Floyd" fullname="Sally Floyd">
         <organization>ICSI</organization>
      </author>
      <author initials="M." surname="Allman" fullname="Mark Allman">
         <organization>ICSI</organization>
      </author>
      <date month="May" day="19" year="2008" />
      <abstract>
	 <t>This document presents some observations on &quot;simple best-effort traffic&quot;, defined loosely for the purposes of this document as Internet traffic that is not covered by Quality of Service (QOS) mechanisms, congestion-based pricing, cost-based fairness, admissions control, or the like.  One observation is that simple best-effort traffic serves a useful role in the Internet, and is worth keeping.  While differential treatment of traffic can clearly be useful, we believe such mechanisms are useful as *adjuncts* to simple best- effort traffic, not as *replacements* of simple best-effort traffic.  A second observation is that for simple best-effort traffic, some form of rough flow-rate fairness is a useful goal for resource allocation, where &quot;flow-rate fairness&quot; is defined by the goal of equal flow rates for different flows over the same path.  This memo provides information for the Internet community.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-floyd-tsvwg-besteffort-04" />
   
</reference>
