×

Routing over similar paths

  • US 6,061,736 A
  • Filed: 03/13/1998
  • Issued: 05/09/2000
  • Est. Priority Date: 03/13/1998
  • Status: Expired due to Term
First Claim
Patent Images

1. A method for determining routing paths in a computer network, the method comprising the steps of:

  • providing a plurality of nodes with a plurality of links, each of said plurality of links having a metric;

    selecting one of said nodes as a root node;

    labeling all nodes directly connected to said root node by said links as tentative nodes;

    labeling a most optimum link connecting said root node to said tentative nodes based on said metrics as a routing path;

    changing said tentative node connected to said root node by said routing path to a path node;

    labeling all non-path nodes directly connected to said path node as tentative nodes;

    for each of said nodes twice labeled as tentative nodes, determining a difference between two most optimum paths of said links connecting said root node to said each twice labeled tentative node, when said difference is above a predetermined difference amount a most optimum path of said two most optimum paths is labeled as a routing path, when said difference is below said predetermined difference amount one of said two most optimum paths is randomly labeled as a routing path;

    labeling a most optimum link connecting said root node to said tentative nodes as a routing path based on said metrics;

    changing said tentative nodes connected to said root node by said routing paths to a path node;

    repeating the method steps from said twice labeled tentative node until no tentative nodes are present.

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