<?xml version="1.0"?>
<!DOCTYPE rss PUBLIC "-//Netscape Communications//DTD RSS 0.91//EN" "http://my.netscape.com/publish/formats/rss-0.91.dtd">
<rss version="0.91">
   <channel>
<title>CS6282</title>
     <link>http://www.comp.nus.edu.sg/~cs6282</link>
     <description>Very Large Scale Distributed Systems</description>
     <language>en-us</language>
<item>
    <title>Homework 01: Extending NICE</title>
    <link>http://www.comp.nus.edu.sg/~cs6282/homework.html#01</link>
    <description>
Due on 29 August 2005.  The NICE protocol described in Banerjee's SIGCOMM 2002 paper did not consider the issue of cheating and heterogeneity. In this homework, you are asked to write a 2-page short essay about your thoughts on these two issues. As a guideline, you solution can include, for each of the issue, (i)
why is the issue important, and how would NICE be negatively affected if the issue is not considered, (ii) whether the issue is considered in any follow-up papers to NICE, and (iii) how you would modify NICE to take the issue into consideration.
    </description>
    <pubDate>
Mon Aug 15 20:18:03 GMT-8 2005
    </pubDate>
</item>
<item>
    <title>New Page: Scribe Notes</title>
    <link>http://www.comp.nus.edu.sg/~cs6282/scribe.html</link>
    <description>
Information for note scribers.
    </description>
    <pubDate>
Mon Aug 15 20:18:03 GMT-8 2005
    </pubDate>
</item>
<item>
    <title>Lecture 02: Hierarchy</title>
    <link>http://www.comp.nus.edu.sg/~cs6282/schedule.html#02</link>
    <description>
<![CDATA[
<a href="slides/02-nice.ppt">Slides</a> for NICE from CS5248.
]]>
    </description>
    <pubDate>
Mon Aug 15 20:17:14 GMT-8 2005
    </pubDate>
</item>

<item>
    <title>Lecture 01: Introduction</title>
    <link>http://www.comp.nus.edu.sg/~cs6282/schedule.html#01</link>
    <description>
<![CDATA[
<a href="slides/01-intro.ppt">Slides</a> and
<a href="scribes/01-intro.pdf">Scribe Notes</a> posted.
]]>
    </description>
    <pubDate>
Mon Aug 11 19:26:00 GMT-8 2005
    </pubDate>
</item>

</channel>
</rss>

