System for establishing route by selecting minimum of time-independent link parameters of incremental values

Claim 1

In a communication network of multiple nodes interconnected by links, a method for establishing a route between a source node and a destination node via an intermediate node, said nodes having respective identifications and each of said links having a link parameter of time-independent value, comprising the steps of: a) determining a second node as corresponding to said intermediate node which is reached from a first node by a single hop, said first node corresponding to said source node; b) determining a third node as corresponding to said destination node which is reached from said second node by (m-1) hops, where m is an integer equal to or greater than unity; c) selecting links on a route between said first and third nodes via said second node if, said route of the selected links is the only route available between said first and third nodes; d) if said route of the selected links is not the only route available between said first and third nodes, storing initial values of the link parameters of possible routes between said first and third nodes in matrix locations of a link parameter memory, said link parameters representing an amount of traffic carried by a link; e) incrementing said initial values of said selected links by a predetermined amount to update said link parameter memory; (f) summing said link parameters of said possible routes; g) selecting links on one of said possible routes which give a minimum sum of the link parameters; h) storing an identification of a second node of the links selected according to step (c) or (g) in a routing memory addressable as a function of identifications of said first and third nodes; i) repeating steps (a) to (h) by shifting a first node to the next and incrementing the value m by one to thereby store a plurality of identifications of said second node in said routing memory; and j) recalling one of said stored identifications from said routing memory as a function of identifications of said source and destination nodes and establishing a route between said source node and said destination nodes through an intermediate node having said recalled identification.

Claim 5

A method for establishing a route between a source node and a destination node via an intermediate node in a communications network, said nodes having respective identifications and being interconnected by links each having a link parameter of time-independent value, comprising the steps of: a) determining an intermediate node which is reached from a source node by a single hop; b) determining a destination node which is reached from said intermediate node by (m-1) hops, where m is an integer equal to or greater than unity; c) selecting links on a route between said source node and said destination node via said intermediate node if said route is the only route available between said source node and said destination node; d) if said route of said selected links is not the only route available between said source and destination nodes, setting initial values of the link parameters of possible routes between said source node and said destination node, said link parameters representing an amount of traffic carried by a link; e) incrementing said initial values of said selected links by a predetermined amount; f) summing said link parameters of said possible routes; g) selecting links on one of said possible routes which give a minimum sum of the link parameters; and h) establishing a route between said source node and said destination node via an intermediate node via the links selected by step (c) or (g).

Claim 6

A method for establishing a route between a source node and a destination node via an intermediate node in a communications network, said nodes having respective identifications and being interconnected by links each having a link parameter of time-independent value, comprising the steps of: a) determining an intermediate node which is reached from a source node by a single hop; b) determining a destination node which is reached from said intermediate node by (m-1) hops, where m is an integer equal to or greater than unity; c) selecting links on a route between said source node and said destination node via said intermediate node if said route is the only route available between said source node and said destination node; d) if said route of said selected links is not the only route available between said source and destination nodes, setting initial values of the link parameters of possible routes between said source node and said destination node, said link parameters representing an amount of traffic carried by a link; e) incrementing said initial values of said selected links by a predetermined amount; f) summing said link parameters of said possible routes; g) selecting links on one of said possible routes which give a minimum sum of the link parameters; and h) establishing a route between said source node and said destination node via an intermediate node via the links selected by step (c) or (g).