At 01:29 AM 10/13/00, Paul Werner wrote:
>Here is
>what Dr. J.J. Garcia-Luna-Aceves had to say on, "Loop-Free
>Routing Using Diffusing Computations.":
>
>"A family of distributed algorithms for the dynamic computation
>of the shortest paths in a computer network or internet is
>presented, validated, and analyzed. According to these
>algorithms, each node maintains a vector with its distance to
>every other node. Update messages from a node are sent only to
>its neighbors; each such message contains a distance vector of
>one or more entries, and each entry specifies the length of the
>selected path to a network destination, as well as an
>indication of whether the entry constitutes an update, a query,
>or a reply to a previous query. The new algorithms treat the
>problem of distributed shortest-path routing as one of
>diffusing computations, which was first proposed by Dijkstra
>and Scholten.
Here's what all these big words mean: It's a distance vector algorithm.
&;-) Nothing in there implies it's a link-state protocol.
Priscilla
________________________
Priscilla Oppenheimer
http://www.priscilla.com
_________________________________
FAQ, list archives, and subscription info: http://www.groupstudy.com/list/cisco.html
Report misconduct and Nondisclosure violations to [EMAIL PROTECTED]
