Method and apparatus for routing and link metric assignment in shortest path networks

• US 5,596,719 A
• Filed: 08/29/1995
• Issued: 01/21/1997
• Est. Priority Date: 06/28/1993
• Status: Expired due to Term

• Current Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Rodrigues, Manoel A., Ramakrishnan, Kajamalai G.
• Primary Examiner(s): Lall, Parshotam S.
• Assistant Examiner(s): VU, VIET DUY
• Application Number:
  US08/521,285
• Time in Patent Office: 511 Days
• Field of Search: 370/60, 370/60.1, 370/94.1, 370/94.3, 370/54, 370/16, 364/402, 395/200.01, 395/200.02, 395/200.1, 395/200.15
• US Class Current: 709/241
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/123 Evaluation of link metrics techniques for monitoring network metrics H04L43/08

Abstract

The invention discloses a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given. The routing optimality is measured with respect to some objective function (e.g., average network delay).

Claims

1. A method of routing information in a network, the method comprising the steps of:

assigning link metrics in said network, wherein said network comprises nodes connected by links, the step of assigning comprising the steps of;

a. assigning an initial link metric value to each link;

b. determining an initial set of shortest paths between each pair of nodes in said network;

c. determining a level of initial performance of said network with said initial link metric values according to a performance measure;

d. finding a neighborhood to said initial set of shortest paths wherein said neighborhood is a set of neighbors and wherein each neighbor is a set of shortest paths and associated link metrics wherein only a minimum number of paths in the set of shortest paths for each neighbor are changed with respect to the initial set of shortest paths as a consequence of an increase in an initial link metric associated with a specific neighbor;

e. selecting the neighbor in said neighborhood that yields a performance level for said network meeting a first performance criterion as determined according to the performance measure; and

f. assigning as link metrics for said network the link metrics associated with said selected neighbor; and

routing information on a single path between a pair of nodes, said single path between said pair of nodes being determined as a function of the assigned link metrics.

2. The method of claim 1 wherein said step of finding a neighborhood further comprises the steps of:

a. for each link l;

determining the shortest paths between each pair of nodes with link l removed;

determining a set of increases in the length in said shortest paths over said initial set of shortest paths;

ordering elements of said set of increases in ascending order;

defining as a perturbation for link l the average of the first and second positive minimum elements of said set of increases;

increasing the link metric for link l by said perturbation and determining a new set of shortest paths;

determining the performance of said network according to said performance measure for said new set of shortest paths;

resetting the link metric for link l; and

b. finding the link that provides a performance level for said network which meets a predetermined second performance criterion and increasing the metric of said link by the perturbation for said link.

3. The method of claim 1 wherein the step of assigning comprises the step of sending a signal from a network manager processor to said nodes in said network wherein said signal comprises information regarding a subset of said link metrics.

4. The method of claim 1 wherein each link in the network is characterized by a link capacity and wherein said initial link metric for each link in said network is initially selected as the inverse of the link capacity for said each link.

5. The method of claim 1 wherein said performance measure is average network delay.

6. The method of claim 1 wherein said initial link metric is based on a measure of traffic between sets of nodes in said network measured over an interval.

8. The method of claim 1 wherein said single path is the shortest path between said pair of nodes as determined as a function of the assigned link metrics.

7. A system for routing information in a network by assigning link metrics in said network, wherein said network comprises nodes connected by links, said system comprising:

a. means for assigning an initial link metric value to each link;

b. means for determining an initial set of shortest paths between each pair of nodes in said network;

c. means for determining a level of initial performance of said network with said initial link metric values according to a performance measure;

d. means for finding a neighborhood to said initial set of shortest paths wherein said neighborhood is a set of neighbors and wherein each neighbor is a set of shortest paths and associated link metrics such that only a minimum number of paths are changed with respect to the initial set of shortest paths as a consequence of an increase in each initial link metric;

e. means for selecting the neighbor in said neighborhood that yields a performance level for said network meeting a predetermined criterion as determined according to a performance measure;

f. means for assigning as link metrics for said network the link metrics associated with said selected neighbor; and

g. means for routing information on a single path between a pair of nodes, said shortest path being determined as a function of the assigned link metrics.

9. The system of claim 7 wherein said single path is the shortest path between said pair of nodes as determined as a function of the assigned link metrics.