Changes between Version 3 and Version 4 of 2011/Projects/MobilityFirst/NehalSomani


Ignore:
Timestamp:
Aug 12, 2011, 12:37:25 PM (6 years ago)
Author:
nsomani
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • 2011/Projects/MobilityFirst/NehalSomani

    v3 v4  
    4747The above messaging process, enables each node to have a complete up-to-date information of all the other nodes of the current network partition.  
    4848 
    49 Each node then uses "Djikstra's Algorithm" to calculate a path with least SETT for reaching all other nodes in the current network partition. 
     49Each node then uses "Djikstra's Algorithm" to calculate fastest paths (i.e. paths with least SETT) for reaching all other nodes in the current network partition. 
    5050 
    5151