<?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: Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks</title>
	<atom:link href="http://blogs.sanmathi.org/nalanda/2008/09/08/analysis-of-the-increase-and-decrease-algorithms-for-congestion-avoidance-in-computer-networks/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.sanmathi.org/nalanda/2008/09/08/analysis-of-the-increase-and-decrease-algorithms-for-congestion-avoidance-in-computer-networks/</link>
	<description>Just another WordPress weblog</description>
	<pubDate>Thu, 09 Feb 2012 00:52:53 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.1</generator>
		<item>
		<title>By: Nalanda &#187; Random Early Detection Gateways for Congestion Avoidance</title>
		<link>http://blogs.sanmathi.org/nalanda/2008/09/08/analysis-of-the-increase-and-decrease-algorithms-for-congestion-avoidance-in-computer-networks/#comment-12</link>
		<dc:creator>Nalanda &#187; Random Early Detection Gateways for Congestion Avoidance</dc:creator>
		<pubDate>Mon, 15 Sep 2008 16:58:56 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.sanmathi.org/nalanda/?p=36#comment-12</guid>
		<description>[...] are similar to those available in TCP (drop a packet) and explicit notification as proposed by Chiu and Jain (1989), RED detects congestion differently. Instead of reporting congestion when it occurs (i.e., queues [...]</description>
		<content:encoded><![CDATA[<p>[...] are similar to those available in TCP (drop a packet) and explicit notification as proposed by Chiu and Jain (1989), RED detects congestion differently. Instead of reporting congestion when it occurs (i.e., queues [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nalanda &#187; Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks</title>
		<link>http://blogs.sanmathi.org/nalanda/2008/09/08/analysis-of-the-increase-and-decrease-algorithms-for-congestion-avoidance-in-computer-networks/#comment-6</link>
		<dc:creator>Nalanda &#187; Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks</dc:creator>
		<pubDate>Thu, 11 Sep 2008 14:01:12 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.sanmathi.org/nalanda/?p=36#comment-6</guid>
		<description>[...] flows to make probabilistic decisions about whether or not to drop packets. This approach recalls Chiu and Jain&#8217;s paper, as it seems to be a relaxation of the distributedness criterion that they introduced, which allows [...]</description>
		<content:encoded><![CDATA[<p>[...] flows to make probabilistic decisions about whether or not to drop packets. This approach recalls Chiu and Jain&#8217;s paper, as it seems to be a relaxation of the distributedness criterion that they introduced, which allows [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nalanda &#187; Congestion Avoidance and Control</title>
		<link>http://blogs.sanmathi.org/nalanda/2008/09/08/analysis-of-the-increase-and-decrease-algorithms-for-congestion-avoidance-in-computer-networks/#comment-4</link>
		<dc:creator>Nalanda &#187; Congestion Avoidance and Control</dc:creator>
		<pubDate>Tue, 09 Sep 2008 03:42:45 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.sanmathi.org/nalanda/?p=36#comment-4</guid>
		<description>[...] reachable due to resource limits along the path. They do this by putting the algorithms from the last paper into practice, but using a signalling mechanism that derives from network behaviour under [...]</description>
		<content:encoded><![CDATA[<p>[...] reachable due to resource limits along the path. They do this by putting the algorithms from the last paper into practice, but using a signalling mechanism that derives from network behaviour under [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

