System and method for learning and dynamic routing of data in a mobile communication network

• US 5,654,958 A
• Filed: 06/05/1995
• Issued: 08/05/1997
• Est. Priority Date: 06/05/1995
• Status: Expired due to Term

• Current Assignee: Motorola Solutions, Inc.
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Natarajan, Kadathur S.
• Primary Examiner(s): Chin, Wellington
• Assistant Examiner(s): Hyun, Soon Dong
• Application Number:
  US08/463,816
• Time in Patent Office: 792 Days
• Field of Search: 370/94.1, 370/94.2, 370/94.3, 370/60, 370/60.1, 370/16, 370/16.1, 370/85.13, 370/85.14, 370/95, 370/1, 370/95.3, 340/827, 340/826
• US Class Current: 370/410
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/42 Centralised routing

Abstract

A communications system (20) and method (100) learns and dynamically selects routes among a number of nodes (1-12) based on network state information. Each of the nodes (1-12) monitors its links and determines the state of each of its link. Each of the nodes (1-11) transmits their respective link state information to a designated node called a center node (12) by using forward propagation. After the link state information has been received from all of the nodes (1-11), the center node (12) aggregates them and forms a comprehensive state of the entire network. This network state information is subsequently distributed by the center node (12) to each of the nodes (1-11) in the network using reverse propagation. Each of the node (1-11) uses the network state information in making route selection decisions for connection requests that arrive after the node updates its network state information. The process of learning about network state information is or will be repeated after a predetermined amount of time (or at periodic intervals).

Claims

1. A method for propagating network state information to a plurality of nodes, the method comprising the steps of:

a) gathering link state information at periodic intervals of time from each of the nodes;

b) a center node aggregating the link state information to create network state information;

c) the center node distributing the network state information to each of the nodes; and

d) communicating data between the nodes by selecting routes based on the network state information.

2. A method as recited in claim 1, wherein step (a) includes the steps of:

a1) monitoring a number of calls each link of each of the nodes is handling;

a2) monitoring a call capacity of each link of each of the nodes; and

a3) using the number of calls and the call capacity as the link state information for each of the nodes.

3. A method as recited in claim 1, wherein step (a) includes the step of forward propagating the link state information from each of the nodes to a center node.

4. A method as recited in claim 3, wherein step (a) further includes the step of each of the nodes transmitting the link state information to at least one adjacent node until the link state information of each of the nodes is received by the center node.

5. A method as recited in claim 1, wherein step (b) includes the step of aggregating link call capacities of each link of each of the nodes into the network state information.

6. A method as recited in claim 1, wherein step (b) includes the step of forming the network state information from the link state information of each of the nodes.

7. A method as recited in claim 1, wherein step (c) includes the step of reverse propagating the network state information from a center node to each of the nodes.

8. A method as recited in claim 7, wherein step (c) further includes the step of the center node transmitting the network state information to at least one adjacent node until the network state information is received by each of the nodes.

9. A method as recited in claim 1, wherein step (d) includes the step of communicating the data between the nodes based on routes selected that comprise less-utilized links as determined from the network state information.

10. A method as recited in claim 1, further comprising the step of repeating steps (a)-(d) at a periodic interval.

17. A method as recited in claim 1, further comprising the step of repeating steps (a)-(d) at a periodic interval.

11. A method for propagating network state information to a plurality of nodes, the method comprising the steps of:

a) forward propagating link state information about each link of each of the nodes from the nodes to a center node;

b) aggregating the link state information to create network state information;

c) reverse propagating the network state information from the center node to each of the nodes; and

d) communicating data between the nodes by selecting routes based on the network state information.

12. A method as recited in claim 11, further comprising the steps of:

e) monitoring a number of calls each link of each of the nodes is handling;

f) monitoring a call capacity of each link of each of the nodes; and

g) using the number of calls and the call capacity as the link state information for each of the nodes.

13. A method as recited in claim 11, wherein step (a) further includes the step of each of the nodes transmitting the link state information to at least one adjacent node until the link state information of each of the nodes is received by the center node.

14. A method as recited in claim 11, wherein step (b) includes the step of aggregating link call capacities of each link of each of the nodes into the network state information.

15. A method as recited in claim 11, wherein step (b) includes the step of forming the network state information from the link state information of each link of each of the nodes.

16. A method as recited in claim 15, wherein step (c) further includes the step of the center node transmitting the network state information to at least one adjacent node until the network state information is received by each of the nodes.

18. A nodal communication system comprising:

a plurality of nodes, each of the nodes including means for forward propagating link state information about each link of each of the nodes and means for reverse propagating network state information to each of the nodes; and

a center node coupled to some of the nodes, the center node receiving the link state information and aggregating the link state information to create the network state information.