| 摘要 |
This invention relates to improvements in the manner in which data is routed through a data network. Specifically, an improved method for updating the status of nodes and thereby determining an optimal data route in a network is defined, where a cost is associated with each node, optimal routes are already known and there are only one or a few links which change. The method of determining the optimum path between a source node and all destination nodes comprises: assigning an infinite cost to nodes whose optimal path runs through a disconnected link or through a link whose cost has increased; and starting an expansion process with any of: (i) the nodes which are neighbors with those that have an infinite cost; (ii) the starting nodes of links whose cost has either increased or decreased; and (iii) the starting nodes of new links. In this way a new set of optimum paths to the source node is determined.
|
