H - Electricity – 04 – Q
Patent
H - Electricity
04
Q
H04Q 1/18 (2006.01) H04L 12/56 (2006.01)
Patent
CA 2266878
This invention relates to improvements in the manner in which data is routed through a data network. A method for determining optimal data routes is defined, specifically suitable for situations when only a few links and/or nodes have changed since the last optimization. In addition to the data organization used in known variations of the Dijkstra procedure, the new method records all nodes whose cost improved during the optimization process. It also suplements the traceback pointer by a tree organization, which permits the traversal of optimum routes in both directions. The method of determining the optimum routes between a source node and all destination nodes comprises: (i) assigning an infinite cost and undefined traceback to nodes whose original path ran through a node or a link which has been disconnected, or through a link whose cost has increased; (ii) starting the expansion process from those nodes F which have final costs and satisfy at least one of the following conditions: (a) there is a link which can transmit data from node F to node I, where I has infinite cost; (b) there is a new link which can transmit data from node F to another node; (c) the cost of one of the links which can transmit data from F to some other node has changed; (iii) the routing table is updated only for the nodes whose costs have improved during the expansion process. In this way a new set of optimum routes from the source node is determined.
Shapiro Cohen
Soukup Jiri
LandOfFree
Incremental network routing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Incremental network routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental network routing will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1780711