<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" media="screen" href="/App_Themes/default/rss.xslt"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:media="http://search.yahoo.com/mrss/" xmlns:evnet="http://www.mscommunities.com/rssmodule/"><channel><title>Comment Feed for Ethan Jackson - Specifying Cloud Applications (Peli on Channel 9)</title><atom:link rel="self" type="application/rss+xml" href="http://channel9.msdn.com/posts/peli/specifying-cloud-applications/rss/default.aspx" /><image><url>http://mschnlnine.vo.llnwd.net/d1/Dev/App_Themes/C9/images/feedimage.png</url><title>Comment Feed for Ethan Jackson - Specifying Cloud Applications (Peli on Channel 9)</title><link>http://channel9.msdn.com/posts/Peli/Specifying-Cloud-Applications/</link></image><description>Ethan Jackson - Specifying Cloud Applications</description><link>http://channel9.msdn.com/posts/Peli/Specifying-Cloud-Applications/</link><language>en-us</language><pubDate>Fri, 30 Jan 2009 21:24:30 GMT</pubDate><lastBuildDate>Fri, 30 Jan 2009 21:24:30 GMT</lastBuildDate><generator>EvNet (EvNet, Version=1.0.3608.3122, Culture=neutral, PublicKeyToken=null)</generator><item><title>Re: Re: Specifying Cloud Applications</title><description>Hi aL_,&lt;BR&gt;&lt;BR&gt;That's an interesting question. The idea is this: In one "logical step" of the system nodes can only interact with their neighbors. If node A wants data&amp;nbsp;to reach&amp;nbsp;node B, which is in another clique, then A interacts with one of its neighbors A' that is closer to B. In the next step, A' can interact with one of its neighbors&amp;nbsp;B', which is also a neighbor of B. In the third step, B' interacts directly with B. The only trick is to add the operations&amp;nbsp;enabling these steps. A realistic system will almost certainly have these multi-step operations. However, in our approach we want to avoid operations that identify specific nodes (e.g. A and B) since we don't know how reliable they are or how they will be connected. Instead, we partition that data across different&lt;STRONG&gt; types&lt;/STRONG&gt; of nodes (e.g. Type A nodes and Type B nodes) in the hope that we can always find a node of the proper type in the cloud.&amp;nbsp;Please let me&amp;nbsp;know if that answers your question?&lt;BR&gt;&lt;BR&gt;Thanks&amp;nbsp;</description><comments></comments><link>http://channel9.msdn.com/posts/Peli/Specifying-Cloud-Applications/?CommentID=455696</link><pubDate>Fri, 30 Jan 2009 21:24:30 GMT</pubDate><guid isPermaLink="false">http://channel9.msdn.com/posts/Peli/Specifying-Cloud-Applications/?CommentID=455696</guid><evnet:views>0</evnet:views><evnet:viewtrackingurl>http://channel9.msdn.com/455696/WebViewBug.aspx?EVT=0</evnet:viewtrackingurl><evnet:previewtext>Hi aL_,That's an interesting question. The idea is this: In one "logical step" of the system nodes can only interact with their neighbors. If node A wants data&amp;nbsp;to reach&amp;nbsp;node B, which is in another clique, then A interacts with one of its neighbors A' that is closer to B. In the next step,&amp;#8230;</evnet:previewtext><dc:creator>Ethan Jackson</dc:creator><slash:comments>0</slash:comments><wfw:commentRss></wfw:commentRss><trackback:ping>http://channel9.msdn.com/455696/Trackback.aspx</trackback:ping></item><item><title>Re: Specifying Cloud Applications</title><description>cool stuff :) but i dont quite get how it works when data in one clique is is needed by a client in another clique? &lt;BR&gt;or if some state is updated in clique A and a client that happens to be in clique B lisents to that state?</description><comments></comments><link>http://channel9.msdn.com/posts/Peli/Specifying-Cloud-Applications/?CommentID=454469</link><pubDate>Thu, 22 Jan 2009 15:18:10 GMT</pubDate><guid isPermaLink="false">http://channel9.msdn.com/posts/Peli/Specifying-Cloud-Applications/?CommentID=454469</guid><evnet:views>0</evnet:views><evnet:viewtrackingurl>http://channel9.msdn.com/454469/WebViewBug.aspx?EVT=0</evnet:viewtrackingurl><evnet:previewtext>cool stuff :) but i dont quite get how it works when data in one clique is is needed by a client in another clique? or if some state is updated in clique A and a client that happens to be in clique B lisents to that state?</evnet:previewtext><dc:creator>Allan Lindqvist</dc:creator><slash:comments>0</slash:comments><wfw:commentRss></wfw:commentRss><trackback:ping>http://channel9.msdn.com/454469/Trackback.aspx</trackback:ping></item></channel></rss>