<?xml version="1.0"?><!-- generator="bbPress" -->

<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
>

<channel>
<title>Weblogtoolscollection News Topic: Fabric Shortest Path First</title>
<link>http://weblogtoolscollection.com/news/</link>
<description>Weblogtoolscollection News Topic: Fabric Shortest Path First</description>
<language>en</language>
<pubDate>Sun, 19 May 2013 00:37:25 +0000</pubDate>

<item>
<title>Suvham on "Fabric Shortest Path First"</title>
<link>http://weblogtoolscollection.com/news/topic/fabric-shortest-path-first#post-10111</link>
<pubDate>Tue, 07 Feb 2012 07:21:20 +0000</pubDate>
<dc:creator>Suvham</dc:creator>
<guid isPermaLink="false">10111@http://weblogtoolscollection.com/news/</guid>
<description>&#60;p&#62;FSPF (Fabric Shortest Path First) is a Link State path selection protocol, similar to OSPF, which is an Interior Gateway Protocol (IGP) widely used in IP networks.This protocol keeps track of the state of the links on all switches in the Fabric. It also associates a cost with eachlink. The protocol computes paths from a switch to all the other switches in the fabric, by adding the cost of allthe links traversed by the path, and choosing the path that minimizes the cost. In order for the protocol to work,the cost must be a positive integer number. The collection of link states (including cost) of all the switches in a fabric constitutes the topology database.
&#60;/p&#62;</description>
</item>

</channel>
</rss>