<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>beth</title>
	<atom:link href="http://berthalemu.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://berthalemu.wordpress.com</link>
	<description>what i like about networks</description>
	<lastBuildDate>Tue, 07 Oct 2008 05:40:06 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='berthalemu.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>beth</title>
		<link>http://berthalemu.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://berthalemu.wordpress.com/osd.xml" title="beth" />
	<atom:link rel='hub' href='http://berthalemu.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Performance Comparison of Multi-hop Wireless Ad-hoc Network Routing Protocols</title>
		<link>http://berthalemu.wordpress.com/2008/10/06/performance-comparison-of-multi-hop-wireless-ad-hoc-network-routing-protocols/</link>
		<comments>http://berthalemu.wordpress.com/2008/10/06/performance-comparison-of-multi-hop-wireless-ad-hoc-network-routing-protocols/#comments</comments>
		<pubDate>Tue, 07 Oct 2008 05:40:06 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[wireless]]></category>
		<category><![CDATA[ad hoc]]></category>
		<category><![CDATA[aodv]]></category>
		<category><![CDATA[dsdv]]></category>
		<category><![CDATA[dsr]]></category>
		<category><![CDATA[performance]]></category>
		<category><![CDATA[tora]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=76</guid>
		<description><![CDATA[Wireless mobile users can communicate by forming an ad-hoc network where each mobile node is both a host and a router, forwarding packets to other nodes that may not be within range for direct wireless transmission. This type of network requires the nodes involved to dynamically establish routing amongst themselves.  There have been protocols proposed [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=76&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/10/06/performance-comparison-of-multi-hop-wireless-ad-hoc-network-routing-protocols/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>A High-Throughput Path Metric for Multi-Hop Wireless Routing</title>
		<link>http://berthalemu.wordpress.com/2008/10/06/a-high-throughput-path-metric-for-multi-hop-wireless-routing/</link>
		<comments>http://berthalemu.wordpress.com/2008/10/06/a-high-throughput-path-metric-for-multi-hop-wireless-routing/#comments</comments>
		<pubDate>Mon, 06 Oct 2008 17:23:59 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[wireless]]></category>
		<category><![CDATA[dsdv]]></category>
		<category><![CDATA[etx]]></category>
		<category><![CDATA[roofnet]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=73</guid>
		<description><![CDATA[For routing in multi-hop wireless routing, the minimum hop-count metric chooses amongst paths of the same minimum length, which ignores potential differences in throughput amongst those paths. Minimum hop-count assumes a link either works well or doesn&#8217;t work at all: totally not true in the wireless world. The authors instead use the expected transmission count [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=73&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/10/06/a-high-throughput-path-metric-for-multi-hop-wireless-routing/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>Architecture and Evaluation of an Unplanned 802.11b Mesh Network</title>
		<link>http://berthalemu.wordpress.com/2008/10/02/architecture-and-evaluation-of-an-unplanned-80211b-mesh-network/</link>
		<comments>http://berthalemu.wordpress.com/2008/10/02/architecture-and-evaluation-of-an-unplanned-80211b-mesh-network/#comments</comments>
		<pubDate>Thu, 02 Oct 2008 07:42:26 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[wireless]]></category>
		<category><![CDATA[mesh]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=71</guid>
		<description><![CDATA[This paper describes an unplanned deployment of a wireless mesh network, Roofnet: unplanned placement of thirty-seven nodes, omni-directional antennae, multi-hop routing, and optimization for throughput over route repair. With this setup, the authors look at the effect of node density on connectivity and throughput, link characteristics chosen by the protocol, etc. This method is in [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=71&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/10/02/architecture-and-evaluation-of-an-unplanned-80211b-mesh-network/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>Modeling Wireless Links for Transport Protocols</title>
		<link>http://berthalemu.wordpress.com/2008/10/01/modeling-wireless-links-for-transport-protocols/</link>
		<comments>http://berthalemu.wordpress.com/2008/10/01/modeling-wireless-links-for-transport-protocols/#comments</comments>
		<pubDate>Thu, 02 Oct 2008 03:56:26 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[wireless]]></category>
		<category><![CDATA[modeling]]></category>
		<category><![CDATA[tcp]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=69</guid>
		<description><![CDATA[This paper describes how to appropriately design wireless link simulations in order to evaluate the performance of transport protocols and the interplay between wireless links and the transport layer. The authors look at unicast transport with models of the three classes of wireless links: wireless LANs, wide-area cellular links, and satellite links. Like last time&#8217;s [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=69&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/10/01/modeling-wireless-links-for-transport-protocols/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>A Comparison of Mechanisms for Improving TCP Performance Over Wireless Links</title>
		<link>http://berthalemu.wordpress.com/2008/09/30/a-comparison-of-mechanisms-for-improving-tcp-performance-over-wireless-links/</link>
		<comments>http://berthalemu.wordpress.com/2008/09/30/a-comparison-of-mechanisms-for-improving-tcp-performance-over-wireless-links/#comments</comments>
		<pubDate>Tue, 30 Sep 2008 15:28:56 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[wireless]]></category>
		<category><![CDATA[congestion]]></category>
		<category><![CDATA[end-to-end]]></category>
		<category><![CDATA[link-layer]]></category>
		<category><![CDATA[split-connection]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=66</guid>
		<description><![CDATA[This paper compares three schemes for improving performance of TCP in wireless and other lossy networks: end-to-end protocols, link-layer protocols, and split-connection protocols. Reliable transport protocols assume that packet loss and delay are caused by congestion, which is not necessarily true in this space. Still, when assuming congestion, congestion control techniques kick in that result [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=66&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/09/30/a-comparison-of-mechanisms-for-improving-tcp-performance-over-wireless-links/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>MACAW: A Media Access Protocol for Wireless LANs</title>
		<link>http://berthalemu.wordpress.com/2008/09/30/macaw-a-media-access-protocol-for-wireless-lans/</link>
		<comments>http://berthalemu.wordpress.com/2008/09/30/macaw-a-media-access-protocol-for-wireless-lans/#comments</comments>
		<pubDate>Tue, 30 Sep 2008 08:22:40 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[wireless]]></category>
		<category><![CDATA[fairness]]></category>
		<category><![CDATA[MACA]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=63</guid>
		<description><![CDATA[Due to the growth in mobile computing devices utilizing the network, need new network technologies to provide connectivity. Since wireless LANs are most heavily utilized for these devices, also need to think about how to control access to this shared media. The authors aim to develop a media access protocol for this space and explore [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=63&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/09/30/macaw-a-media-access-protocol-for-wireless-lans/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>A Fast Switched Backplane for a Gigabit Switched Router</title>
		<link>http://berthalemu.wordpress.com/2008/09/22/a-fast-switched-backplane-for-a-gigabit-switched-router/</link>
		<comments>http://berthalemu.wordpress.com/2008/09/22/a-fast-switched-backplane-for-a-gigabit-switched-router/#comments</comments>
		<pubDate>Mon, 22 Sep 2008 19:39:29 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[resource management]]></category>
		<category><![CDATA[backplane]]></category>
		<category><![CDATA[routers]]></category>
		<category><![CDATA[switches]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=58</guid>
		<description><![CDATA[This paper describes the motivation for replacing congested, shared backplanes with switched backplanes. There are two general types of router functions: datapath functions operate on every packet passing through the router, while control functions operate more infrequently. To focus on per-packet router performance, attention should be paid to the datapath functions. These include forwarding decisions, [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=58&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/09/22/a-fast-switched-backplane-for-a-gigabit-switched-router/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>Scaling Internet Routers Using Optics</title>
		<link>http://berthalemu.wordpress.com/2008/09/22/scaling-internet-routers-using-optics/</link>
		<comments>http://berthalemu.wordpress.com/2008/09/22/scaling-internet-routers-using-optics/#comments</comments>
		<pubDate>Mon, 22 Sep 2008 19:19:35 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[resource management]]></category>
		<category><![CDATA[optics]]></category>
		<category><![CDATA[routers]]></category>
		<category><![CDATA[switches]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=55</guid>
		<description><![CDATA[The authors describe their motivation as wanting to see how Internet router capacity can scale to keep up with Internet traffic growth, and how optical technology inside routers can help that scaling. Most high capacity routers these days are multi-rack in order to reduce the power density incurred when using a single rack. Multi-rack systems, [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=55&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/09/22/scaling-internet-routers-using-optics/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>Random Early Detection Gateways for Congestion Avoidance</title>
		<link>http://berthalemu.wordpress.com/2008/09/16/random-early-detection-gateways-for-congestion-avoidance/</link>
		<comments>http://berthalemu.wordpress.com/2008/09/16/random-early-detection-gateways-for-congestion-avoidance/#comments</comments>
		<pubDate>Tue, 16 Sep 2008 08:57:30 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[resource management]]></category>
		<category><![CDATA[congestion]]></category>
		<category><![CDATA[gateway]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=51</guid>
		<description><![CDATA[TCP only detects congestion when packet dropped, but it would also be desirable to not have full queues all the time; this would increase average delay throughout the network. Want to keep throughput high while keeping average queue size low. Without gateway knowledge, TCP has difficulty in distinguishing propagation delay from persistent queuing delay. In Random [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=51&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/09/16/random-early-detection-gateways-for-congestion-avoidance/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
		<item>
		<title>Congestion Control for High-Bandwidth-Delay Product Networks</title>
		<link>http://berthalemu.wordpress.com/2008/09/16/congestion-control-for-high-bandwidth-delay-product-networks/</link>
		<comments>http://berthalemu.wordpress.com/2008/09/16/congestion-control-for-high-bandwidth-delay-product-networks/#comments</comments>
		<pubDate>Tue, 16 Sep 2008 08:12:24 +0000</pubDate>
		<dc:creator>Beth</dc:creator>
				<category><![CDATA[resource management]]></category>
		<category><![CDATA[bandwidth-delay]]></category>
		<category><![CDATA[congestion]]></category>
		<category><![CDATA[gateways]]></category>

		<guid isPermaLink="false">http://berthalemu.wordpress.com/?p=46</guid>
		<description><![CDATA[TCP becomes oscillatory and prone to instability as product of bandwidth and latency increases. The paper describes protocol (XCP) that is fair and efficient as link bandwidth or Round Trip Time increases. TCP may waste a lot of RTTs getting back up to full utilization after congestion; this is especially unfortunate for short TCP flows that can&#8217;t [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=berthalemu.wordpress.com&amp;blog=4682964&amp;post=46&amp;subd=berthalemu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://berthalemu.wordpress.com/2008/09/16/congestion-control-for-high-bandwidth-delay-product-networks/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">berthalemu</media:title>
		</media:content>
	</item>
	</channel>
</rss>
