[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [RRG] Idea for shooting down



On 21 nov 2007, at 0:33, Fleischman, Eric wrote:

results that resembled link state (Dykstra) computations for local links (e.g., whatever grouping is decided to be "local"; whether regional, country, continent, or some other definition of proximity) and Bellman-Ford-like results for remote (i.e., non-"local") links.

Note that Dijkstra and Bellman-Ford are two algorithms that provide the exact same solution to the exact same problem (finding the shortest path between network nodes), they only differ in their implementation constraints: Dijkstra pretty much needs to have all information for the entire network available in one place before the algorithm can be run, Bellman-Ford is able to reach the same result by distributing the work over multiple network nodes, the tradeoff being that you need iterate the computation and distribution of results as many times as there are nodes in the worst case.

--
to unsubscribe send a message to rrg-request@psg.com with the
word 'unsubscribe' in a single line as the message text body.
archive: <http://psg.com/lists/rrg/> & ftp://psg.com/pub/lists/rrg