<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Random Early Detection Gateways for Congestion Avoidance</title>
	<atom:link href="http://blogs.sanmathi.org/nalanda/2008/09/15/random-early-detection-gateways-for-congestion-avoidance/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.sanmathi.org/nalanda/2008/09/15/random-early-detection-gateways-for-congestion-avoidance/</link>
	<description>Just another WordPress weblog</description>
	<pubDate>Sat, 19 May 2012 10:15:29 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.1</generator>
		<item>
		<title>By: Randy Katz</title>
		<link>http://blogs.sanmathi.org/nalanda/2008/09/15/random-early-detection-gateways-for-congestion-avoidance/#comment-13</link>
		<dc:creator>Randy Katz</dc:creator>
		<pubDate>Wed, 17 Sep 2008 03:53:26 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.sanmathi.org/nalanda/?p=68#comment-13</guid>
		<description>Given RED's desire to handle bursty traffic well, it is tricky to do that and achieve fairness at the same time. It is kind of like FQ with a long history window. Note that FQ can be chosen as the router's scheduling algorithm even if random drop is the dropping strategy, and this is how it is usually implemented.</description>
		<content:encoded><![CDATA[<p>Given RED&#8217;s desire to handle bursty traffic well, it is tricky to do that and achieve fairness at the same time. It is kind of like FQ with a long history window. Note that FQ can be chosen as the router&#8217;s scheduling algorithm even if random drop is the dropping strategy, and this is how it is usually implemented.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

