The table 300 may be augmented with parameters such as distance or propagation time between any two nodes that are connected by direct links and appropriate transformations that can be done so as to run Dijkstra's algorithm to determine the shortest path, as described above. [0028]FIG. 4 is a flowchart of the operation of one embodiment of the RITE method of the present invention.