×

Method and system for fast computation of routes under multiple network states with communication continuation

  • US 20020172157A1
  • Filed: 03/12/2002
  • Published: 11/21/2002
  • Est. Priority Date: 03/12/2001
  • Status: Active Grant
First Claim
Patent Images

1. A method for computing routes on a network, which is composed of nodes and links that may take on a multitude of possible metrics, comprising the steps of:

  • (a) initiating a current routing scenario;

    (b) creating an initial shortest path tree of the current routing scenario including a start node;

    (c) checking the shortest path tree for completeness;

    (d) selecting an edge for inclusion in the shortest path tree;

    (e) creating a new current routing scenario as a copy of the current routing scenario wherein the node reached by the edge selected in (d) is considered in its next state and recursively applying steps (c) through (h) to the new current routing scenario;

    (f) adding the edge selected in (d) to the shortest path tree and continuing at step (c) should further edge state exploration be not possible or allowed;

    (g) creating a new current routing scenario as a copy of the current routing scenario wherein the edge selected in step (d) is put into its next metric value and recursively applying steps (c) through (h) to the new current routing scenario;

    (h) returning the edge metric for the selected edge to its prior value and continuing at step (f).

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×