<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: In Search of Five 9s &#8211; Calculating Availability of Complex Systems</title>
	<atom:link href="http://www.edgeblog.net/2007/in-search-of-five-9s/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.edgeblog.net/2007/in-search-of-five-9s/</link>
	<description>Notes from the edge</description>
	<lastBuildDate>Tue, 09 Mar 2010 19:19:17 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=abc</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Bill Highleyman</title>
		<link>http://www.edgeblog.net/2007/in-search-of-five-9s/comment-page-1/#comment-93410</link>
		<dc:creator>Bill Highleyman</dc:creator>
		<pubDate>Tue, 24 Feb 2009 00:12:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.edgeblog.net/2007/in-search-of-five-9s/#comment-93410</guid>
		<description>Hisham -

I&#039;m sorry that I am more than a half-year late in responding to your question. I wasn&#039;t aware of this great blog until my researcher found it.

Your confusion is in the definition of spares. if we have n nodes and s spares, it takes the failure of (s+1) spares to take the system down. The Equation in question is the number of ways that you can select (s+1) systems out of n systems. If s = n, selecting (s+1) = (n+1) systems is meaningless, so the equation does not apply. In all cases, s &lt; n or else the system will fail if all spares fail, which is not the definition of spares.

If you want to continue this discussion, please feel free to contact me at editor@availabilitydigest.com. Thanks for your interest in the Digest. And thank you, Bill, for the plug.

Bill Highleyman
Managing Editor
Availability Digest</description>
		<content:encoded><![CDATA[<p>Hisham -</p>
<p>I&#8217;m sorry that I am more than a half-year late in responding to your question. I wasn&#8217;t aware of this great blog until my researcher found it.</p>
<p>Your confusion is in the definition of spares. if we have n nodes and s spares, it takes the failure of (s+1) spares to take the system down. The Equation in question is the number of ways that you can select (s+1) systems out of n systems. If s = n, selecting (s+1) = (n+1) systems is meaningless, so the equation does not apply. In all cases, s &lt; n or else the system will fail if all spares fail, which is not the definition of spares.</p>
<p>If you want to continue this discussion, please feel free to contact me at <a href="mailto:editor@availabilitydigest.com">editor@availabilitydigest.com</a>. Thanks for your interest in the Digest. And thank you, Bill, for the plug.</p>
<p>Bill Highleyman<br />
Managing Editor<br />
Availability Digest</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Hisham Ghanem</title>
		<link>http://www.edgeblog.net/2007/in-search-of-five-9s/comment-page-1/#comment-67268</link>
		<dc:creator>Hisham Ghanem</dc:creator>
		<pubDate>Sun, 15 Jun 2008 14:13:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.edgeblog.net/2007/in-search-of-five-9s/#comment-67268</guid>
		<description>Hi,
Great article and formulas posed through the site:
http://www.availabilitydigest.com./public_articles/
article &quot;Calculating Availability - Redundant Systems&quot;.
I notived though that the &quot;Multiple Nodes, Multiple Spares&quot; formula has an issue with the (-1)!, when #of nodes = # of spares.

Did I miss a point when reading the article?

Thanks.</description>
		<content:encoded><![CDATA[<p>Hi,<br />
Great article and formulas posed through the site:<br />
<a href="http://www.availabilitydigest.com./public_articles/" rel="nofollow">http://www.availabilitydigest.com./public_articles/</a><br />
article &#8220;Calculating Availability &#8211; Redundant Systems&#8221;.<br />
I notived though that the &#8220;Multiple Nodes, Multiple Spares&#8221; formula has an issue with the (-1)!, when #of nodes = # of spares.</p>
<p>Did I miss a point when reading the article?</p>
<p>Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris Loosley</title>
		<link>http://www.edgeblog.net/2007/in-search-of-five-9s/comment-page-1/#comment-27583</link>
		<dc:creator>Chris Loosley</dc:creator>
		<pubDate>Thu, 01 Nov 2007 00:42:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.edgeblog.net/2007/in-search-of-five-9s/#comment-27583</guid>
		<description>&lt;p&gt;Bill,&lt;br /&gt;
Nice analysis! &lt;/p&gt;
&lt;p&gt;I responded to your comment on my blog http://www.webperformancematters.com/performance-forum/post/296647 listing some of my own posts on this topic. My analysis was at a much higher level than yours, more like an introduction to the concepts you are working with in your formulas.&lt;/p&gt;
&lt;p&gt;--Chris&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Bill,<br />
Nice analysis! </p>
<p>I responded to your comment on my blog <a href="http://www.webperformancematters.com/performance-forum/post/296647" rel="nofollow">http://www.webperformancematters.com/performance-forum/post/296647</a> listing some of my own posts on this topic. My analysis was at a much higher level than yours, more like an introduction to the concepts you are working with in your formulas.</p>
<p>&#8211;Chris</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: bill</title>
		<link>http://www.edgeblog.net/2007/in-search-of-five-9s/comment-page-1/#comment-27568</link>
		<dc:creator>bill</dc:creator>
		<pubDate>Wed, 31 Oct 2007 22:33:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.edgeblog.net/2007/in-search-of-five-9s/#comment-27568</guid>
		<description>Mr. Highleyman,

Great tip! For anyone who liked my article, but wants to see the math expressed more eloquently, go immediately to this site and read: http://www.availabilitydigest.com./public_articles/0101/calculating_availability.pdf

The basic calculations are the same, but his equations are much better than mine.

-Bill</description>
		<content:encoded><![CDATA[<p>Mr. Highleyman,</p>
<p>Great tip! For anyone who liked my article, but wants to see the math expressed more eloquently, go immediately to this site and read: <a href="http://www.availabilitydigest.com./public_articles/0101/calculating_availability.pdf" rel="nofollow">http://www.availabilitydigest.com./public_articles/0101/calculating_availability.pdf</a></p>
<p>The basic calculations are the same, but his equations are much better than mine.</p>
<p>-Bill</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bill Highleyman</title>
		<link>http://www.edgeblog.net/2007/in-search-of-five-9s/comment-page-1/#comment-27553</link>
		<dc:creator>Bill Highleyman</dc:creator>
		<pubDate>Wed, 31 Oct 2007 20:24:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.edgeblog.net/2007/in-search-of-five-9s/#comment-27553</guid>
		<description>I really enjoyed your article on five 9s. High availability is a field that I specialize in. You might want to check out the Availability Digest, a free monthly digest of high availability issues, at www.availabilitydigest.com. Go to the Article Archives and look under The Geek Corner. There you will find a series of papers on calculating availabity using effectively the same equations you use, though in a different form.

- Bill Highleyman</description>
		<content:encoded><![CDATA[<p>I really enjoyed your article on five 9s. High availability is a field that I specialize in. You might want to check out the Availability Digest, a free monthly digest of high availability issues, at <a href="http://www.availabilitydigest.com" rel="nofollow">http://www.availabilitydigest.com</a>. Go to the Article Archives and look under The Geek Corner. There you will find a series of papers on calculating availabity using effectively the same equations you use, though in a different form.</p>
<p>- Bill Highleyman</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.605 seconds -->
