<?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>Advanced Topics in Networking</title>
	<atom:link href="http://stanfordcs244.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://stanfordcs244.wordpress.com</link>
	<description></description>
	<lastBuildDate>Mon, 20 Dec 2010 06:28:10 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='stanfordcs244.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Advanced Topics in Networking</title>
		<link>http://stanfordcs244.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://stanfordcs244.wordpress.com/osd.xml" title="Advanced Topics in Networking" />
	<atom:link rel='hub' href='http://stanfordcs244.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Storage (Lecture 17)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/17/storage-lecture-17-7/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/17/storage-lecture-17-7/#comments</comments>
		<pubDate>Wed, 17 Mar 2010 23:33:34 +0000</pubDate>
		<dc:creator>gchanan</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1117</guid>
		<description><![CDATA[Scribed by Gregory Chanan Joy Jiang and Claudio DeSanti, The role of FCoE in I/O consolidation, Proceedings of the 2008 International Conference on Advanced Infocomm Technology Summary: This paper describes the trend towards data center I/O consolidation. Conventionally, there are different networks running in parallel, optimized for different uses: Ethernet for LAN, Fibre Channel for [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1117&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p>Scribed by Gregory Chanan</p>
<p><!-- 		@page { margin: 0.79in } 		P { margin-bottom: 0.08in } 		A:link { so-language: zxx } --><strong>Joy Jiang and Claudio DeSanti, <a href="http://www.stanford.edu/class/cs244/papers/The%20role%20of%20FCoE%20in%20IO%20consolidation.pdf">The role of FCoE in I/O consolidation</a>, Proceedings of the 2008 International Conference on Advanced Infocomm Technology</strong></p>
<p><strong>Summary:</strong></p>
<p><!-- 		@page { margin: 0.79in } 		P { margin-bottom: 0.08in } -->This paper describes the trend towards data center I/O consolidation.  Conventionally, there are different networks running in parallel, optimized for different uses:  Ethernet for LAN, Fibre Channel for SAN and Infiniband for IPC.  This setup has downsides compared to unifying the network: (1) increased number of hardware components, since a separate adapter is needed for each network, (2) increased power requirements to run the separate adapters, and (3) different and more numerous cables to support the different networks.</p>
<p>Unifying the network by running Fibre Channel over Ethernet (FCoE) solves these issues.  Using Ethernet as the underlying network makes sense because (1) many applications already assume they are running on Ethernet, (2) 10G Ethernet has enough bandwidth to carry traffic in the consolidated network, and (3) the price of 10G Ethernet has come down.</p>
<p>FCoE is superior to the existing iSCSI mainly because an  FcoE gateway is stateless, while an iSCSI gateway is stateful and thus is a single point of failure.  An FCoE gateway can be stateless because it runs over loss-less Ethernet, so FCoE frames can be encapsulated in Ethernet frames.  Loss-less Ethernet is achieved by implementing a &#8216;Pause&#8217; frame to pace incoming frames to avoid overflowing buffers.</p>
<p><strong>Discussion:</strong></p>
<p>We discussed the history and size ($2.5) of the Fibre Channel market.  Originally, writing to permanent storage in the data center was done via SCSI cables.  Eventually the demand for this sort of operation grew from one CPU to one hard disk to a many-to-many (CPU-to-disk) problem which required a networking solution.  Thus, Fibre Channel was born to make network writes look like SCSI writes.</p>
<p>Fibre Channel is a very structured protocol: each address has a domain ID, area ID, etc.  This makes forwarding decisions easy, but limits the size and topology of some data centers.  In this sense, it is similar to PortLand.</p>
<p>Fibre Channel does flow control via a packet-based buffer-to-buffer credit.  This avoids dropping of packets, so in theory Fibre Channel is a lossless network (though bit errors can occur at rates of 10^-17 in practice).</p>
<p>The advantage of Fibre Channel over other reliable networks is its simple protocol and low overhead.  This means that it can be implemented in hardware.  In theory, this simplicity should mean that it is cheaper and can be provided by multiple vendors as a commodity product.  This hasn&#8217;t been the case in practice, however.  Part of the problem is that the standards are written loosely, which makes interoperability a problem.  This has lead to a market in which EMC does all the service, and sells other&#8217;s hardware as part of a bundled solution.  Thus, the market is small and Fibre Channel has not benefited from the economies of scale that Ethernet has.</p>
<p>Why is I/O consolidation only happening now?  Part of the reason is that Ethernet continues to get faster, so there is enough bandwidth for the different networks to be run together without violating QOS.</p>
<p>We discussed why a pause signal was added to Ethernet over a buffer credit system.  The reasons given were mostly political: the IEEE will not approve a buffer-to-buffer credit system, since they already have pause proposals.</p>
<p>Tom concluded by discussing the FCoE frame format.  Several students noted that there are a large number of reserved bytes.  The reason is to know ahead of time how long the frame is, in order to support a cut-through switch that sends out the head before the tail is received.  This is not possible to support with a length field.</p>
<p><!-- 		@page { margin: 0.79in } 		P { margin-bottom: 0.08in } --></p>
<p><strong>Opinion:</strong></p>
<p><!-- 		@page { margin: 0.79in } 		P { margin-bottom: 0.08in } -->I was a bit disappointed by this paper.  While the reasons for adopting FCoE are well argued, I felt there was a lack of critical analysis.  For example, there was no discussion about whether loss-less Ethernet is a good idea in a consolidated network.  There are certainly end-to-end argument concerns with such a proposal (recall network transparency in the Active Networking paper), but these are not addressed.  Overall, this just felt more like a marketing paper than an academic analysis, which I guess is to be expected given the authors work at Finisar and Cisco.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1117/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1117/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1117/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1117/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1117/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1117/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1117/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1117/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1117/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1117/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1117/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1117/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1117/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1117/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1117&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/17/storage-lecture-17-7/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ab93bd2ac61a18434d914272cddb2c7?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">gchanan</media:title>
		</media:content>
	</item>
		<item>
		<title>Storage (Lecture 17)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/16/storage-lecture-17-6/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/16/storage-lecture-17-6/#comments</comments>
		<pubDate>Tue, 16 Mar 2010 22:30:47 +0000</pubDate>
		<dc:creator>mfichman</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1115</guid>
		<description><![CDATA[Scribed by Matt Fichman The Role of FCOE in I/O Construction Summary Recently there has been a trend in data center networks toward the consolidation of multiple traffic types over a unified data network.  Currently, several different high-speed networking technologies exist.  Ethernet is used primarily for the LAN.  Fibre Channel is used for the SAN, [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1115&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p>Scribed by Matt Fichman</p>
<h2>The Role of FCOE in I/O Construction</h2>
<h2>Summary</h2>
<p>Recently there has been a trend in data center networks toward the consolidation of multiple traffic types over a unified data network.  Currently, several different high-speed networking technologies exist.  Ethernet is used primarily for the LAN.  Fibre Channel is used for the SAN, or storage-area network.  Other technologies, like Infiniband, are used for interprocess communication for high-performance computing clusters.</p>
<p>A new technology, Fibre Channel over Ethernet (FCoE) is beginning to become a popular replacement for separate Ethernet LANs and FC SANs.  The advantages of FCoE are as follows: 1) reduced number hardware components, 2) reduced power consumption, and 3) simplified cabling.  FCoE is made possible by the recent introduction of 10 Gigabit Ethernet.  However, FC was a lossless protocol, while Ethernet is not.  Thus, Ethernet had to be enhanced to carry FC traffic by introducing “pause” messages to control congestion over Ethernet links.  In addition, the Ethernet implementation needs to support “jumbo” frames (many implementations do this already) because an FC frame is larger than a traditional Ethernet frame (1500 bytes).</p>
<p>FCoE is superior to other technologies, like iSCSI because it does not require saving state at the gateway between the SAN and the Ethernet LAN.  This means it can use cut-through routing and as a result scales much better.  In addition, FCoE takes advantage of the ubiquity of Ethernet, which will eventually mean lower cost and better interchangeability of parts as 10GE is adopted.</p>
<h2>Opinion</h2>
<p>After reading the paper, I am convinced that FCoE is the best solution (compared to Infiniband, iSCSI, etc).  I thought it was interesting that Ethernet had to be extended to provide lossless (or nearly lossless) communication, and I wonder why Ethernet did not support this from the beginning.  In any case, Ethernet is essentially lossless already.  The small amount of lossy behavior might encourage developers of disk access software for managing SANs to write more redundant code, and maybe Ethernet should not be extended as lossless after all.</p>
<h2>Discussion</h2>
<p>We discussed the topology and basic operation of the Fibre Channel network.  When nodes attach to the network, they issue an FLOGI request to login to the switch, and then a PLOGI to login to the disk array.  Also, there are 3 types of ports in a Fibre Channel network: extension (used for top-level switches), fabric (used to connect to a node), and node.  Fibre Channel uses buffer-to-buffer credits to perform flow control.  Basically, the receiver leases a certain amount of credits to the sender, who is allowed to transmit a number of packets equal to the number of credits.  We also discussed the advantages/disadvantages of Fibre Channel.  Advantages: low overhead, multi-path routing, low state requirements, fast performance.  Disadvantages: difficult setup, proprietary, weak interoperability, no layer-2 routing, and the fact that it doesn’t work over long distance.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1115/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1115/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1115/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1115/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1115/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1115/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1115/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1115/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1115/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1115/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1115/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1115/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1115/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1115/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1115&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/16/storage-lecture-17-6/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0d9a06fa821136eee3a4c097fb452c58?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">mfichman</media:title>
		</media:content>
	</item>
		<item>
		<title>Storage (Lecture 17)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/16/lecture-17-storage-2/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/16/lecture-17-storage-2/#comments</comments>
		<pubDate>Tue, 16 Mar 2010 12:09:39 +0000</pubDate>
		<dc:creator>harukioh</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1106</guid>
		<description><![CDATA[Scribed by Haruki Oh The Role of FCoE in I/O Consolidation Summary: This paper explores the possibility and benefit of Fibre Channel over Ethernet protocol to consolidate multiple traffic types in datacenters. The greatest benefit of consolidating multiple traffic type is the significant reduction in the number of wires and switches, and power consumption. Internal [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1106&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<div id="_mcePaste">
<p style="line-height:19px;font:13px Georgia;margin:0;">
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">Scribed by Haruki Oh</span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;"><strong>The Role of FCoE in I/O Consolidation</strong></span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;"><strong>Summary:</strong></span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">This paper explores the possibility and benefit of Fibre Channel over Ethernet protocol to consolidate multiple traffic types in datacenters. The greatest benefit of consolidating multiple traffic type is the significant reduction in the number of wires and switches, and power consumption.</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">Internal SCSI is a popular transport protocol but it relies on TCP to recover from lost frames and complex gateways for managing states. Lossless network will provide a significant performance increase for iSCSI.</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">In order to put fibre channel over ethernet, we need ethernet to support jumbo frames to encapsulate fibre channel frames. To implement lossless network, full duplex links are used so that a receiver can pace the reception by requesting the sender to pause.</span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;"><strong>Opinion:</strong></span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">This paper had a comprehensive description of FCoE: what it is, how it can be used, and what the current state of the technology is. This is one of the few papers we read where the topic of the paper was practical for mass implementation.</span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;"><strong>UNH_IOL Fibre Channel Tutorial</strong></span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;"><strong>Summary:</strong></span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">This tutorial gives an overview of fibre channel. Fibre channel offers advantages in price, reliability, performance, and practicality over network and channels. In particular, SCSI can use fibre channel for faster speed and scalability.</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">Fibre channel is divided into FC-0 through FC-4 layers. FC-0 being the physical implementation of the connection, FC-2 provides the transport, FC-3 gives advanced features, and FC-4 is the interface to applications, such as SCSI and IP.</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">Fibre channel has three topologies: point-to-point, arbitrated loop, and fabric, which is the most commonly used. Fabric topology is a cross-point switched configuration where multiple devices can communicate at the same time. Buffer-to buffer flow control is implemented with a credit based system, where sender can transmit the amount the credit allows. QoS is also supported.</span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;"><strong>Opinion:</strong></span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">I think this tutorial went straight into the description of lower level details without going through a detailed higher level description of what fibre channel is. It was a bit unclear how FC is better than Channel and network.</span></p>
<p style="line-height:19px;font:14px Arial;min-height:16px;margin:0;"><span style="letter-spacing:0;"> </span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;"><strong>Discussion:</strong></span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">-Storage is a multi-billion dollar industry but received little attention from academia</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">-Storage product generally consists of many physical harddrives, and virtual drives run on top of them.</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">-Lossless communication is important because disk can crash if packets were lost</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">-Lossless is really lossless: Tom shared a story of a hardware bug where the hardware drops one packet a month, and the nightmare of debugging effort.</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">-Buffer to buffer credit system can control the flow and prevent buffer overflow.</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">-GOODS: simple, low overhead, lossless, multi-pathing</span></p>
<p style="line-height:19px;font:14px Arial;margin:0;"><span style="letter-spacing:0;">-BADS: can&#8217;t go long distance, weak interoperability, complicated, not economically scale, no congestion handling, not routable (layer-2 only), and monopolized industry</span></p>
</div>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1106/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1106/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1106/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1106/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1106/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1106/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1106/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1106/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1106/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1106/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1106/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1106/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1106/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1106/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1106&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/16/lecture-17-storage-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/5526ede6f2804b40088410ad2b329221?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">harukioh</media:title>
		</media:content>
	</item>
		<item>
		<title>Storage (Lecture 17)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/15/storage-lecture-17-5/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/15/storage-lecture-17-5/#comments</comments>
		<pubDate>Mon, 15 Mar 2010 19:40:03 +0000</pubDate>
		<dc:creator>vkhodel</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1095</guid>
		<description><![CDATA[Joy Jiang and Claudio DeSanti, The role of FCoE in I/O consolidation, Proceedings of the 2008 International Conference on Advanced Infocomm Technology Summary of Paper The paper describes the rational for adopting FCoE protocol as a way to I/O consolidation at the datacenter level. Specifically, FCoE describes running Fibre Channel over 10GB Ethernet, and thus [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1095&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p><strong>Joy Jiang and Claudio DeSanti, 				<a href="http://www.stanford.edu/class/cs244/papers/The%20role%20of%20FCoE%20in%20IO%20consolidation.pdf">The  				role of FCoE in I/O consolidation</a>, Proceedings of the 2008 				International Conference on Advanced Infocomm Technology</strong></p>
<p><em>Summary of Paper</em><strong></strong></p>
<p>The paper describes the rational for adopting FCoE protocol as a way to I/O consolidation at the datacenter level. Specifically, FCoE describes running Fibre Channel over 10GB Ethernet, and thus provides seamless integration with existing Ethernet infrastructure and packet encapsulation of FC traffic that does not require maintaining stateful gateways for existing FC infrastructure. Replacing separate Ethernet, FC, and possibly Infiniband adapters in the servers by dual CNAs that can carry FCoE traffic and reducing cabling requirements provides substantial cost savings.</p>
<p><em>Summary of Class Discussion</em></p>
<ul>
<li>Storage marketplace is close to $2.5 bln</li>
<li>Hard drive performance is limited by physics, needed a way to consolidate multiple devices and have them appear as a single high-performance device</li>
<li>FC technology was developed to be a hardware engineer answer to networking: simple to implement in hardware on the lowest level, many layers higher up, some of them never implemented at all</li>
<li>FC0 uses point-to-point links and a concept of credits in lieu of TCP windows, life without dropped packets (to the point of crashing Windows since handling of dropped packets was never implemented)</li>
<li>Current error rates on fiber are 10^{-17}, but with twisted pair media they can go up to 10^{-12}</li>
<li>IBM has a hard drive with built-in CRC, so the blocks are 528 bytes and FC supports that</li>
<li>1Gb FC is actually 800Mb/sec, 1Gb Ethernet is just that</li>
<li>FC zones provide security</li>
<li>Credit = line delay / packet size</li>
<li>FC allows multipath (FC Shortest Path First)</li>
<li>FC has ambiguous standards, interoperability is a nightmare, single vendor setups are common, Cisco is an OEM</li>
<li>&#8216;Pause&#8217; frame was used to help with flow control after a standards negotiati0n</li>
<li>iSCSI is more adopted in greenfield installations</li>
<li>FCoE wins over other approaches due to having a stateless gateway</li>
<li>FCoE frame has a lot of padding so that its size does not need to be known in advance to allow on the fly switching</li>
<li>End-to-end argument still works and it does show that making network smarter does increase its performance</li>
</ul>
<p><em>Opinion/Critique</em></p>
<p>The paper is written by a team from Cisco (working on the FC hardware)  and  Finisar (working on Xgig hardware analyzer) so it mostly reads as a marketing white paper. The figures that look like they came from a marketing presentation enhance this impression. Overall paper makes a good point about investment protection and future cost savings, so if the hardware is indeed delivered the FCoE&#8217;s future does look bright.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1095/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1095/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1095/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1095/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1095/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1095/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1095/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1095/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1095/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1095/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1095/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1095/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1095/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1095/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1095&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/15/storage-lecture-17-5/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/3e09570dc544327a5362e8979ef39f0f?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">vkhodel</media:title>
		</media:content>
	</item>
		<item>
		<title>Network Security (Lecture 16)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/15/network-security-lecture-16-8/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/15/network-security-lecture-16-8/#comments</comments>
		<pubDate>Mon, 15 Mar 2010 15:48:25 +0000</pubDate>
		<dc:creator>fnothaft</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1101</guid>
		<description><![CDATA[Network Security (Lecture 16) Scribed by Frank Nothaft Abraham Yaar et al., SIFF: A Stateless Internet Flow Filter to Mitigate DDoS Flooding Attacks, IEEE Security and Privacy Symposium 2004 Summary: This paper discusses a filter that should mitigate DDoS attacks by allowing a packet flow recipient to prevent disruptive flows from impacting them. SIFF realizes [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1101&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p><strong>Network Security (Lecture 16)</strong></p>
<p><strong>Scribed by Frank Nothaft</strong></p>
<p><strong>Abraham Yaar et al., SIFF: A Stateless Internet Flow Filter to Mitigate DDoS Flooding Attacks, IEEE Security and Privacy Symposium 2004</strong></p>
<p><strong>Summary:</strong></p>
<p>This paper discusses a filter that should mitigate DDoS attacks by allowing a packet flow recipient to prevent disruptive flows from impacting them. SIFF realizes this functionality by recognizing traffic as either being privileged or unprivileged, but puts the decision as to whether or not to grant traffic privileged status to the recipient. Additionally, the implementation does not require per-flow state in the router, which was a significant improvement over previous DDoS mitigation filters.</p>
<p>SIFF allows a node that desires to initiate a privileged flow with another node to send an EXPLORER packet in order to obtain “capability”. This packet is sent with the capability field set to 0, and the capability update flag set. Routers between the source and the destination modify the capability field of the packet with their “mark,” which is a short code comprised of a cryptographic hash of routing information, such as SA/DA, previous hop router, and next hop router.</p>
<p>When the EXP packet reaches the destination, the destination decides whether it would like to acknowledge this flow, and if so, sends a capability reply back, with the capability of the EXP packet. These capabilities are used by the routers to validate the flow, as each router is able to check the mark of a packet against the hash it uses to create the mark to make sure that the traffic is not coming from a spoofed IP. Privileged traffic that passes the test is allowed to continue onwards, but privileged traffic with an incorrect capability is either dropped or relegated to unprivileged status.</p>
<p>This paper realizes that a hash is only useful if it is difficult to guess. SIFF realizes that the best way to make guessing difficult is to have strong keys and to change the keys frequently, however this is difficult with long lived flows. As a result, SIFF builds in the ability for a router to change capabilities over the course of a flow without terminating the flow.</p>
<p><strong>Discussion:</strong></p>
<p>Discussion stemmed around security as an academic discipline, and the various types of attacks that are possible to be engineered. Discussion also stemmed around the concept of capability based security, and the topics of the paper.</p>
<p>As an academic discipline, security exists both in the cryptology world and in the systems world. The cryptology is a much more formal and principled discipline, whereas the systems discipline is much more ad hoc, and has a higher degree of freedom. Papers in the systems domain (such as SIFF) are frequently published due to simply being interesting.</p>
<p>As for attacks, there exist four major categories of Denial of Service (DoS) attacks. These categories range from forced malfunction attacks such as the Winnuke (send bad OOB to port 139) and LAND (send TCP request with SA = DA, causing computer to send packets to itself ad infinetum) attacks, to protocol attacks (attacks that take advantage of legitimate protocol functionality) such as ICMP attacks on TCP, synchronized congestion attacks (which can cause 95% degradation with a small amount of traffic), and guessing TCP sequence numbers and using these to reset a connection, to attacks on rebinding, and finally resource exhaustion attacks such as uplink bandwidth exhaustion (continuously launch requests for a file from a server, works due to general asymmetry of bandwidth), SYN flooding (exhausts memory by requiring computer to store copies of many packets), and downlink flooding (attacker generates enough traffic to saturate downlink bandwidth). DoS attacks are frequently difficult to combat, as it is difficult to determine the intent of an attacker (frequent requests for information could be legitimate) and the granularity of IP makes it difficult to determine if all traffic in an attack comes from one source or multiple sources.</p>
<p>Capability based security started to rise to prominence around 2004-05, and SIFF was one of the first major papers to get published. SIFF was actually rejected from many conferences at first, and was modified to cater to review committees (long, prominent related work section and somewhat unrelated section added at behest of angel).</p>
<p>SIFF has some problems. Specifically, a fixed length field cannot be used, as path length is not a fixed quantity, and could be (in theory) infinitely long. This can be overcome by only using the first n-hops or by increasing the complexity of the hardware that handles SIFF. Additionally, there is no way for capabilities to be revoked once they have been allowed, which would require inter-ISP collaboration.</p>
<p><strong>Critique:</strong></p>
<p>I think this is an interesting approach, but I think that there are several problems inherent in the design. Similar to now, how DDoS can be conducted with a SYN flood, SIFF opens up the new avenue of EXP flooding, but this is not entirely unsurprising, as it would be very difficult to come up with a one-stop approach for preventing all DDoS.</p>
<p>I must admit though, I think that SIFF is really ingenious, as they solve the problem of DDoS mitigation without requiring per-flow state in routers, and they solve it in a manner that is not really hackable. Even if a nefarious being hopes to get privileged access to a target by snooping in on another flow and looking at their capabilities, this will only work if he sits along the same path to the destination as the source in the aforementioned flow that is being snooped on.</p>
<p>I do have some reservations about SIFF though, as I don’t think it’s really scalable. Beyond the limited amount of keys (with each key being 2-4 bits), there is logically a limit to how many hops a packet can take before it has a privilege that is too large/cumbersome to store. Additionally, it doesn’t handle rapidly changing routes well, and makes the disclaimer that routing changes rapidly under the volume of DDoS attacks, which breaks SIFF, but SIFF mitigates DDoS, therefore SIFF doesn’t break, which doesn’t seem to stand up to more thorough investigation.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1101/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1101/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1101/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1101/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1101/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1101/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1101/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1101/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1101/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1101/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1101/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1101/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1101/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1101/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1101&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/15/network-security-lecture-16-8/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/08b81399196a0ad41ca1ef4b05eef09a?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">fnothaft</media:title>
		</media:content>
	</item>
		<item>
		<title>Lecture 17:Storage</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/14/lecture-17storage/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/14/lecture-17storage/#comments</comments>
		<pubDate>Mon, 15 Mar 2010 06:25:13 +0000</pubDate>
		<dc:creator>nsinha1</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1094</guid>
		<description><![CDATA[UNH-IOL Fibre Channel Tutorial and Joy Jiang and Claudio DeSanti, The role of FCoE in I/O consolidation, Proceedings of the 2008 International Conference on Advanced Infocomm Technology Scribed by Nishchay Sinha Summary: This lecture was our introduction to fiber channel protocol used in  storage area network.The tutorial tersely discussed an idiot’s introduction to  FC which [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1094&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<div>
<p><a href="http://www.iol.unh.edu/services/testing/fc/training/tutorials/fc_tutorial.php">UNH-IOL Fibre Channel Tutorial</a> and Joy Jiang and Claudio DeSanti, <a href="http://www.stanford.edu/class/cs244/papers/The%20role%20of%20FCoE%20in%20IO%20consolidation.pdf">The role of FCoE in I/O consolidation</a>, Proceedings of the 2008 International Conference on Advanced Infocomm Technology</p>
<p><strong>Scribed by Nishchay Sinha</strong></p>
<p><strong>Summary</strong>:</p>
<p>This lecture was our introduction to fiber channel protocol used in  storage area network.The tutorial tersely discussed an idiot’s introduction to  FC which is a new technology for SAN.It outlines the standardization efforts,various classes that exist across the FC and methodology of implementation.There are four FC layers FC0-4 with FC0 being the physical layer,FC-1 the framing layer,FC-2 the signaling layer ,FC-3 the services layer and FC-4 defining various applications like scsi,ip running atop FC.The topology of FC can be point to point or a distributed one.In case of distributed topology there is an initialization phase after which every device knows its physical address .FC supports hubs and fabrics also in its topology.Flow control is guaranteed loss less by mechanisms like buffer to buffer  negotiated credits that lets transmitter only send a limited number of outstanding packets at a given time instant.Many classes of services are defined too but class 3 is only widely  used as in SAN;Class 3 only uses buffer to buffer credits. FC uses 3 bytes addresses  for  port id,fabric id information.There may be an arbitrated loop id  also.The transmission hierarchy is 8B/10B encoded characters ,four of which make a transmission word.A frame is top transmission hierarchy which can have up to  2112 bytes of payload and 36 bytes of overhead.</p>
<p><a href="http://www.stanford.edu/class/cs244/papers/The%20role%20of%20FCoE%20in%20IO%20consolidation.pdf">The role of FCoE in I/O consolidation</a> paper discusses  the consolidation of disparate  SAN networks like LAN and SAN onto a converged network of FC using convergence protocol like FCOE.This is because of low cost ,lossless and speed properties of FC that suits all the untied technologies.Convergence is important as this will  lead to less power consumption and lower cost of cabling and hardware requirements.Another competing technology iSCSI, is dependent on TCP (apart from being stateful and not scalable) and hence is unsuitable for SAN networks.</p>
<p><strong>Discussion:</strong></p>
<p>1.Storage is 2.5 billion industry.<br />
2.SCSI works for many storage drives and single server but not for many servers accessing a single storage drive<br />
3.Hard drives are 7500 rpm devices with capacity in orders of terbaytes.<br />
4.FC(Fibre channel) has lots of classes discussed but only class 3 is generally used.<br />
5.Concept of arbitrated loops to arbitrate  control  of a storage drive by many contending  drivers.<br />
6.Fibre channels assigns topological id in sets of switch id-area id-port id to drive.This makes routing easy as is location based.<br />
7.Flogins(initial setup) assigns addresses to devices and plogins let access to storage drives.<br />
8.Credits:buffer to buffer credits:This is a flow control mechanism in which two end points negotiate how many packets they are going to receive at a time from one another.By doing this they are able to prevent any loss of packets because of buffer overflow and this gives near zero loss probability to  fiber channel.<br />
9 Basic transaction in FC  is very easy with a protocol write to negotiate  buffer credits  followed by data packets writes or reads and followed by a status message.The status message could indicate disk write errors.<br />
10Framing is done at 32 bit boundary .<br />
11.1 gb of FC carries 800mb of payload  whereas 1 gb ethernet carries 1 gb data on wire.<br />
12.As different os’s use different formatting it can lead to wrongful formatting.This leads to zoning in storage drives under FC.<br />
13.Positive points about fibre channel protocol:Simple,lossless,cheaper,multipathing and load balancing,low state and fast.<br />
14.Bad  about FC:1.cant go long distances,2.interoperability issues,3.no congestion handling.4.only layer 2 protocol.5.inopportune economics due to prevalence of ethernet6.Tight control by EMC bad for free market and development.<br />
15.FC is not inherently reliable but is implementation reliable.<br />
16.I/o consolidation to FCOE so late?because of critical mass of FC devices in market that exist now.<br />
17.FCOE is stateless and one to one mapping to Ethernet frame is possible<br />
18 Differences between Ethernet and FCOE: packet sizes,duplex,frame size,loss less flow control,24/48 bit addresses..<br />
19.Pause frames in FCoE to do loss less flow control.<br />
20.No length field in FCOE packets can ease cut through router deployment.</p>
<p><strong>Critique:</strong></p>
<p>This was more of a tutorial overview of a new topic and hence a critical analysis is bit difficult.Never the less the tutorial was really terse and difficult to understand.The elucidation by Tom was really great  in getting a somewhat better understanding of this technology.</p>
</div>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1094/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1094/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1094/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1094/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1094/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1094/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1094/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1094/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1094/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1094/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1094/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1094/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1094/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1094/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1094&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/14/lecture-17storage/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/35c40b35dc76a6cc112752fcab69aad8?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">nsinha1</media:title>
		</media:content>
	</item>
		<item>
		<title>Network Security (Lecture 16)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-16-7/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-16-7/#comments</comments>
		<pubDate>Mon, 15 Mar 2010 05:28:33 +0000</pubDate>
		<dc:creator>vkhodel</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1087</guid>
		<description><![CDATA[A. Yaar, A. Perrig, D. Song, SIFF: A Stateless Internet Flow Filter to Mitigate DDoS Flooding Attacks, IEEE Security and Privacy Symposium, 2004 Summary of Paper SIFF provides network hosts with a defense against DDoS flooding attacks by providing them with a means of signaling to the upstream routers to drop a particular traffic flow. [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1087&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p><strong>A. Yaar, A. Perrig, D. Song, 				<a href="http://www.stanford.edu/class/cs244/papers/SIFF.pdf">SIFF: A  Stateless Internet Flow Filter 				to Mitigate DDoS Flooding Attacks</a>, IEEE Security and Privacy 				Symposium, 2004</strong><br />
<em>Summary of Paper</em></p>
<p>SIFF provides network hosts with a defense against DDoS flooding attacks by providing them with a means of signaling to the upstream routers to drop a particular traffic flow. It does not require such prerequisites as keeping per-flow state in the routers, inter-ISP collaboration, or a deployment of an overlay infrastructure. It does require an upgrade of all network entities to support SIFF flow tagging. The network traffic is separated in to privileged and non-privileged, and in case of an attack all non-privileged traffic and suspicious privileged traffic can be dropped by signaling to routers upstream from the attacked host.</p>
<p>Capability exchange handshake is used to established privileged channels. Capabilities are dynamic, can be verified statelessly,  and can be revoked. SIFF is transparent (but useless) to legacy clients and servers.</p>
<p><strong><br />
</strong><em>Summary of Discussion</em></p>
<ul>
<li>Security systems research is a mess: lots of vulnerabilities, lots of point solutions</li>
<li>Denial of service  comes in many flavors</li>
<li>Protocol designers should consider security angle in advance</li>
<li>It could be worthwhile doing static analysis on existing protocols</li>
<li>Kaminsky attack and Birthday Paradox</li>
<li>DDoS attacks exhaust limited resources: uplink bandwidth, memory (buffers)</li>
<li>Connections can be protected with SYN cookies (spoofing protection) or by randomly dropping packets</li>
<li>Combination of spoofing and amplification attacks can be very powerful</li>
<li>IEEE Security Conference is not great</li>
<li>Signaling in SIFF is dependent on the length of the path to the router and uplink bandwidth which may not be there in an attack</li>
<li>Capabilities may not be easy to implement in hardware due to their variable length</li>
<li>DDoS increases network instability, SIFF is expected to protect the network from DDoS, but network instabilities actually break SIFF</li>
<li>Malicious servers can wreak havoc with network routers</li>
</ul>
<p><em>Opinion/Critique</em><strong></strong></p>
<p>SIFF paper presents an attempt to mitigate the damage from DDoS attacks at the cost of updating all Internet servers, clients, and routers, which seems pretty drastic. Additionally their key switching protocol seems like a difficult thing to implement in a real network environment especially given path instability. Paper does have an awesome size introduction and related work section that is very helpful.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1087/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1087/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1087/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1087/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1087/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1087/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1087/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1087/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1087/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1087/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1087/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1087/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1087/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1087/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1087&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-16-7/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/3e09570dc544327a5362e8979ef39f0f?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">vkhodel</media:title>
		</media:content>
	</item>
		<item>
		<title>Lecture 16:Security</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/14/lecture-15security/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/14/lecture-15security/#comments</comments>
		<pubDate>Mon, 15 Mar 2010 04:20:45 +0000</pubDate>
		<dc:creator>nsinha1</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1088</guid>
		<description><![CDATA[A. Yaar, A. Perrig, D. Song, SIFF: A Stateless Internet Flow Filter to Mitigate DDoS Flooding Attacks, IEEE Security and Privacy Symposium, 2004 Scribed by:Nishchay Sinha Summary: The paper focuses on paradigms of  DDOS  attacks and one of its solutions.By allowing the server to let only those traffic reach to it,the SIFF is able to [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1088&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p>A. Yaar, A. Perrig, D. Song, <a href="http://www.stanford.edu/class/cs244/papers/SIFF.pdf">SIFF: A Stateless Internet Flow Filter to Mitigate DDoS Flooding Attacks</a>, IEEE Security and Privacy Symposium, 2004</p>
<p><strong>Scribed by:Nishchay Sinha</strong></p>
<p><strong>Summary:</strong></p>
<p>The paper focuses on paradigms of  DDOS  attacks and one of its solutions.By allowing the server to let only those traffic reach to it,the SIFF is able to mitigate DDos. The basis is to create a markup list of every router en route(mark is a hash  of sr/dst ip,incoming interface,last hop interface) so that when the server sends that markup capabilty list back to the sender,the sender has a ticket to send data packets using that capability.In case the capability is wrong the packet will be dropped and in case packet  does not have capability it will be treated as unprivileged packet.The privileged packets(ticket is valid) will not suffer because of other unauthorized packets meant for victim.This way a dos is prevented.</p>
<p><strong>Discussion:</strong></p>
<p>1Security paradigm different for crypto and systems as there are no fixed set of rules/models for systems.<br />
2.DOS:forced malfunction,rebinding attack(like arp),protocol attack(exploit),resource exhaustion.<br />
3forced malfunction:<strong>winuke</strong>(Out of band packet to port 139),<strong>land</strong>(tcp packet with src ip set to listening device),teardrop(ip reassembly bugs) .<br />
4.General solutions:Different layers/domains,languages etc.<br />
5Protocol attack: ICMP attacks on tcp(src quench by guessing right sequence in long lived flow),congestion control attack(like forcing target to enter retransmission timeouts by sending same seq packet more than twice-thrice).<br />
6syn/ack attacks:syn proxies(syn cookies),randomly dropping half opened connections with high chances of foregoing malicious connection.<br />
7. Downlink flooding:ideally Network should take care of that.<br />
8 DDOS:BOTS(80-100k) seen,smurf attack by amplification of response(like DNS query-response )<br />
9.solution:push admission control from server to network and power of revoked capability.<br />
10.flash crowds is not solved by siff.<br />
11does not defend against teardown/land attack.<br />
12.Hashing of capability includes src ip (address spoofing),destination ip(preventing capability maps use),incomingIP Interface(mobility attack by same Source by moving to a different location).<br />
13Negative points: Security (siff  capability length) is proportional to hop counts;Also Variable length of siff header sucks in real implementation.<br />
14Non causality argument madee in paper about re-enforce stable path is really a  low ebb of paper.<br />
15issue:flood the capability channel(lot of exp packets)???A real drainer.</p>
<p><strong>Critique:</strong></p>
<p>I like the paper for the idea that the admission control can be sent to inner of a network so that a malicious  traffic can be checked right at origin.Despite lot of claims which will not be solved by this paper and there are plenty of them ,I rate this paper a good one.There are some issues in the paper which can be really improved upon and is thus a harbinger for such works.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1088/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1088/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1088/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1088/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1088/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1088/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1088/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1088/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1088/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1088/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1088/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1088/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1088/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1088/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1088&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/14/lecture-15security/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/35c40b35dc76a6cc112752fcab69aad8?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">nsinha1</media:title>
		</media:content>
	</item>
		<item>
		<title>Network Security (Lecture 15)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-15-12/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-15-12/#comments</comments>
		<pubDate>Mon, 15 Mar 2010 03:55:01 +0000</pubDate>
		<dc:creator>vkhodel</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1079</guid>
		<description><![CDATA[V. Paxson, Bro: A System for Detecting Network Intruders in Real-Time, In the ACM Workshop on Hot Topics in Networks (HotNets), Dec 1999/Nov 2005 Summary of Paper A standalone system for network intrusion detection Bro is described. Bro passively monitors a network link and is characterized by high speed monitoring, real-time notification, clear separation between [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1079&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p><strong>V. Paxson, <a href="http://www.stanford.edu/class/cs244/papers/bro-CN99.ps.gz">Bro: A  System 				for Detecting Network Intruders in Real-Time</a>, In the ACM 				Workshop on Hot Topics in Networks (HotNets), Dec 1999/Nov 2005</strong></p>
<p><em>Summary of Paper</em></p>
<p>A standalone system for network intrusion detection <em>Bro</em> is described. Bro passively monitors a network link and is characterized by high speed monitoring, real-time notification, clear separation between mechanism and policy, and extensibility. Bro is divided into &#8220;event engine&#8221; converting network traffic to events, and &#8220;policy script interpreter&#8221; which runs event handlers on those events.</p>
<p>A number of attacks is discussed, as well as the use of Bro for the six common protocols: Finger, FTP, Portmapper, Ident, Telnet, and Rlogin.</p>
<p><strong>M. Handley and V. Paxson, 				<a href="http://www.stanford.edu/class/cs244/papers/NetWorkIntrusionDetection.pdf">Network  Intrusion 				Detection: Evasion, Traffic Normalization, and End-to-End 				Protocol Semantics</a>, USENIX 2001</strong><br />
<em>Summary of Paper</em><strong> </strong></p>
<p>Authors suggest introduction of a new network element they call &#8220;traffic normalizer&#8221; that would filter traffic and resolve all protocol ambiguities to improve  NDIS monitor chances of detection of an attack. End-to-end semantics are discussed in the presence of normalizer, as well as possible attacks on normalizer, and the problem of &#8220;cold start&#8221;, where the current state of the connections is not known. Full table of normalizations is supplied, and a software implementation called &#8220;norm&#8221; is mentioned as a proof-of-concept justifying the need for the hardware implementation. Stealth port scanning is described and normalizer is suggested as a possible defense.</p>
<p><em>Summary of Class Discussion</em></p>
<ul>
<li>Internet was not designed for security, rather to facilitate cooperation</li>
<li>Performance gains can be achieved by non-cooperation</li>
<li>DNS is not secure and can be attacked in various ways</li>
<li>BGP is not secure and can be attacked by guessing TCP sequence number</li>
<li>ARP is not secure but can be secured by using static tables</li>
<li>Balance between security and ease of management was shifted towards flexibility in TCP/IP networks</li>
<li>Packet filters are a standard defense mechanism, inspecting packet headers for suspicious contents</li>
<li>Stateless filters are not sufficient</li>
<li>NDISs are generally not aware of the situation at end hosts, so some attacks may still make it through (e.g. application level attacks)</li>
<li>Bro is a nicely organized study of network vulnerabilities</li>
<li>Network normalizer is a better idea than MITM-type setup due to the single point of failure and having to keep the state in the latter case.</li>
<li>&#8220;To erode but not brutally violate&#8221; end-to-end semantics is no big deal</li>
<li>Normalizer looks through all the headers and uses predefined rules (&#8220;systematic approach&#8221;) to find and fix vulnerabilities</li>
<li>Stealth port scan made it into the paper because it was cool at the time</li>
<li>Normalizers are not an encompassing solution, e.g. urgent pointer problem is not solved</li>
</ul>
<p><em>Opinion/Critique</em></p>
<p>These papers present an interesting attempt at staging a cleaning pipeline for network traffic that attempts to fix up all known traffic ambiguities first and later control resulting fully-unambiguous traffic flow with a set of rules. Along the way nice formal rule language is introduced and standard tools like libpcap and bpf are incorporated. Despite various shortcomings in the face of real-life network attacks, this system seems usable in day-to-day practice (and is indeed available for Linux as a package) and can be used as one of the elements in securing a network. Of course, continuous updates to the rules and cleanup logic would be required.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1079/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1079/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1079/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1079/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1079/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1079/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1079/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1079/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1079/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1079/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1079/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1079/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1079/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1079/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1079&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-15-12/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/3e09570dc544327a5362e8979ef39f0f?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">vkhodel</media:title>
		</media:content>
	</item>
		<item>
		<title>Network Security (Lecture 15)</title>
		<link>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-15-11/</link>
		<comments>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-15-11/#comments</comments>
		<pubDate>Mon, 15 Mar 2010 01:45:06 +0000</pubDate>
		<dc:creator>khorimoto</dc:creator>
				<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://stanfordcs244.wordpress.com/?p=1080</guid>
		<description><![CDATA[Scribed by Kyle Horimoto Handley and V. Paxson, Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics, USENIX 2001 Summary Network intrusion detection systems (NIDS) are often used to increase network security by preventing known attacks from entering the network. However, sometimes data sent sent through NIDS cannot be unambiguously deciphered as valid traffic [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1080&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
			<content:encoded><![CDATA[<p>Scribed by Kyle Horimoto</p>
<h2>Handley and V. Paxson, Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics, USENIX 2001</h2>
<p><strong>Summary</strong></p>
<p>Network intrusion detection systems (NIDS) are often used to increase network security by preventing known attacks from entering the network.  However, sometimes data sent sent through NIDS cannot be unambiguously deciphered as valid traffic or an attack because packets cannot always be inspected as part of the whole flow.  This is often due to overlapping data (i.e. TCP fragments with overlapping byte offsets containing different data for the same byte offset), bad protocol implementations, and various network topologies.  Thus, the authors introduce a technique called normalization.  A normalizer sits in front of the NIDS and makes sure that the NIDS receives unambiguous data by using several techniques such as combining fragments before forwarding the packets.</p>
<p>The authors point out several ways to reduce the ambiguities that can be exploited by attackers, going through each type of TCP or IP header field and noting errors that can occur.  They note that there is no perfect solution; instead, they make tradeoffs to maximize effectiveness of the normalizer.  They further discuss possible problems with the normalizer: it itself is vulnerable to attacks so it must not take up too much state or perform complex algorithms, and it still has several weaknesses such as long-established flows.<br />
<strong>Opinion</strong></p>
<p>The normalization technique seems to be a great tool to improve NIDS performance.  However, the authors touch too lightly on some important topics.  For example, they say that they have a systematic process for processing the packets but they don&#8217;t explain what this process is.  Also paper did not touch enough on how to combat the problems, such as very long-lived flows or CPU attacks on the normalizer, that were cited with the normalization system.</p>
<h2>Paxson, Bro: A System for Detecting Network Intruders in Real-Time, In the ACM Workshop on Hot Topics in Networks (HotNets), November 2005</h2>
<p><strong>Summary</strong></p>
<p>Bro is a NIDS designed for high-speed monitoring and removal of bad traffic without dropping any packets.  It consists of four main layers: the network (packets entering the system), libpcap (a UNIX program that analyzes TCP/IP headers), the event engine (provides callbacks to be triggered by new packets), and the policy script interpreter (processes scripts).  Bro scripts are written in a special, C-like Bro language written specifically to optimize network connections.  For example, Ipv4 addresses have their own first-class data type.</p>
<p>It is susceptible to three categories of attacks: overload, crash, and subterfuge.  Overload attacks utilize as many resources as possible, crash attacks exploit software errors, and subterfuge attacks work like the attacks on the normalizer.</p>
<p><strong>Opinion</strong></p>
<p>I think this paper gave a good perspective of the state of NIDS at the time the paper was written.  As we discussed in class, this paper didn&#8217;t really present any novel ideas; rather, it was a culmination of many of the popular ideas of the time with a solid, robust implementation.  However, I think that it would have been more worthwhile to spend more time discussing how Bro stops attackers rather than spending so many pages on the Bro scripting language.</p>
<p><strong>Discussion</strong></p>
<p><!-- 		@page { margin: 0.79in } 		P { margin-bottom: 0.08in } --></p>
<ul>
<li>Security
<ul>
<li>Internet Design 		Fundamentals
<ul>
<li>Packet-based 			(statistical multiplexing)
<ul>
<li>Difficult to put a 				bound on resource usage (no notion of flow)
<ul>
<li>How can you keep 					someone from hogging the network?</li>
</ul>
</li>
<li>Community is 				allergic to per-flow state</li>
</ul>
</li>
<li>Routing is 			hop-by-hop, destination-based
<ul>
<li>Don&#8217;t know where 				packets are coming from
<ul>
<li>Source address can 					be spoofed</li>
</ul>
</li>
<li>No notion of source</li>
</ul>
</li>
<li>Global addressing: IP 			addresses
<ul>
<li>Everyone can talk to 				everyone</li>
<li>Even people who 				don&#8217;t necessarily want to be talked to can be contacted</li>
</ul>
</li>
<li>Simple to join (as 			infrastructure)
<ul>
<li>Untrusted 				infrastructure
<ul>
<li>Easy to grow 					organically</li>
</ul>
</li>
<li>Routers have to 				trust what other routers say</li>
<li>Can violate data 				integrity and privacy</li>
</ul>
</li>
<li>Smart end hosts 			(end-to-end argument)
<ul>
<li>Assume end hosts are 				good
<ul>
<li>How can good 					behavior be guaranteed?</li>
</ul>
</li>
<li>How to protect 				complex functionality at end-points?</li>
</ul>
</li>
<li>Hierarchical naming 			service
<ul>
<li>Lots of caching 				along the way</li>
<li>Need 				protection/trust at each point or response to name request can be 				modified</li>
<li>Not robust; many 				single points of failure</li>
</ul>
</li>
</ul>
</li>
<li>Network-Level Attacks
<ul>
<li>Resource exhaustion
<ul>
<li>Bandwidth, memory, 				CPU</li>
</ul>
</li>
<li>Exploit protocol 			implementation</li>
<li>Rebinding attack
<ul>
<li>Exploit 				unauthenticated bindings
<ul>
<li>DNS, DHCP, ARP, 					Route injection</li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
<li>Filters
<ul>
<li>Make a decision to 			drop a packet based on its header
<ul>
<li>Protocol type</li>
<li>Transport ports</li>
<li>Source/destination 				IP addresses</li>
</ul>
</li>
<li>Usually done on 			router at perimeter of network</li>
<li>Stateful Packet 			Filter
<ul>
<li>Allow traffic 				initiated by trusted sender
<ul>
<li>Keep a little state 					for each flow request</li>
<li>Ensure packets 					received from Internet belong to an existing flow</li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
<li>Application Level 		Firewall/Intrusion Detection System
<ul>
<li>Looks higher in the 			protocol stack
<ul>
<li>Instead of looking 				at network- or transport-layer, look at application-layer</li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
<li>Bro
<ul>
<li>Architecture
<ul>
<li>Several stacks
<ul>
<li>Network</li>
<li>libpcap</li>
<li>Event Engine</li>
<li>Policy Script 				Interpreter</li>
</ul>
</li>
<li>Normalize network 			layer (i.e. take care of fragments)</li>
<li>Assemble stream of 			bytes</li>
<li>Need to buffer more 			or less everything because you can&#8217;t give your event handlers 			incomplete information</li>
</ul>
</li>
<li>Attacks
<ul>
<li>Overload attack
<ul>
<li>Make Bro consume too 				much memory, CPU, etc.</li>
</ul>
</li>
<li>Subterfuge attack
<ul>
<li>Subtle circumventing 				of Bro</li>
<li>Get through to end 				host without Bro knowing about it</li>
</ul>
</li>
</ul>
</li>
</ul>
</li>
<li>Subterfuge Attacks
<ul>
<li>Packets can be dropped 		between normalizer and end host</li>
<li>Also TTL can be too 		short so that it doesn&#8217;t even reach end host</li>
<li>Why not have an IDS 		within every link and have TCP flows between source and IDS AND IDS 		and destination?
<ul>
<li>Two pieces of state 			may be off</li>
<li>Also end-to-end 			violated</li>
</ul>
</li>
<li>Short flows tend to be 		interactive</li>
<li>Long flows may sit for 		days without having any interactions</li>
<li>Cold start
<ul>
<li>Problem that occurs 			when flows are already in existence before IDS is started</li>
</ul>
</li>
<li>Stealth Port Scan
<ul>
<li>Keep sending packets 			to a middleman</li>
<li>IPID should increase 			by one each time</li>
<li>If it increases by 			two, you know that the port is open because the middleman has 			contacted another host</li>
</ul>
</li>
<li>Reliable RST
<ul>
<li>No way to ACK when 			the session is ended because you have to stop talking sometime</li>
<li>IDS fixes this 			problem</li>
</ul>
</li>
</ul>
</li>
</ul>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/stanfordcs244.wordpress.com/1080/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/stanfordcs244.wordpress.com/1080/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/stanfordcs244.wordpress.com/1080/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/stanfordcs244.wordpress.com/1080/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gofacebook/stanfordcs244.wordpress.com/1080/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/facebook/stanfordcs244.wordpress.com/1080/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gotwitter/stanfordcs244.wordpress.com/1080/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/twitter/stanfordcs244.wordpress.com/1080/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/stanfordcs244.wordpress.com/1080/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/stanfordcs244.wordpress.com/1080/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/stanfordcs244.wordpress.com/1080/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/stanfordcs244.wordpress.com/1080/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/stanfordcs244.wordpress.com/1080/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/stanfordcs244.wordpress.com/1080/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=stanfordcs244.wordpress.com&amp;blog=10867423&amp;post=1080&amp;subd=stanfordcs244&amp;ref=&amp;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://stanfordcs244.wordpress.com/2010/03/14/network-security-lecture-15-11/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/e06bac47372e0ce7061417fbed607485?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif&#38;r=G" medium="image">
			<media:title type="html">khorimoto</media:title>
		</media:content>
	</item>
	</channel>
</rss>
