Complex adaptive routing system and method for a nodal communication network
First Claim
1. A method for routing a data packet in a network comprising nodes interconnected by links, the method comprising at a routing node:
- receiving said data packet;
extracting routing strategy data from said received data packet, said routing strategy data including information pertaining to at least one routing path via which to route said received data packet to a destination node, each said routing path including at least one other of said nodes;
comparing said routing strategy data with one or more routing information including one or more alternative routing strategies stored within said routing node;
selecting a routing path via which to route said data packet based on said comparing of said routing strategy data;
assigning credits to the routing strategy data and the one or more alternative routing strategies;
selecting a revised routing strategy by comparing the assigned credits when the selected routing path differs from the routing strategy data; and
updating said routing strategy data in said data packet.
8 Assignments
0 Petitions
Accused Products
Abstract
A complex adaptive routing system and method for routing data packets in a nodal network, in particular, an ad-hoc nodal network. Each data packet contains data representing its routing strategy for routing to a destination node. When a node receives the data packet, it executes an agent program to determine the best route for routing the data packet to its destination node based on the routing strategy and other factors, such as the current conditions of the nodes and paths to the nodes. The agent program updates the strategy data in the data packet, as well as the routing table of the node, before the node sends the data packet to the next node in the selected route. The system and method therefore enables the data packet routing decisions to be dynamically adapted to changing conditions in the network.
155 Citations
40 Claims
-
1. A method for routing a data packet in a network comprising nodes interconnected by links, the method comprising at a routing node:
-
receiving said data packet; extracting routing strategy data from said received data packet, said routing strategy data including information pertaining to at least one routing path via which to route said received data packet to a destination node, each said routing path including at least one other of said nodes; comparing said routing strategy data with one or more routing information including one or more alternative routing strategies stored within said routing node; selecting a routing path via which to route said data packet based on said comparing of said routing strategy data; assigning credits to the routing strategy data and the one or more alternative routing strategies; selecting a revised routing strategy by comparing the assigned credits when the selected routing path differs from the routing strategy data; and updating said routing strategy data in said data packet. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A node for routing a data packet in a network comprising nodes interconnected by links, the node comprising:
-
a receiver, for receiving said data packet; and a controller, for extracting routing strategy data from said received data packet, said routing strategy data including information pertaining to at least one routing path via which to route said received data packet to a destination node, each said routing path including at least one other of said nodes, for comparing said routing strategy data with one or more routing information including one or more alternative routing strategies stored within said routing node, for selecting a routing path via which to route said data packet based on said comparing of said routing strategy data, for assigning credits to the routing strategy data and the one or more alternative routing strategies, and selecting a revised routing strategy by comparing the assigned credits when the selected routing path differs from the routing strategy data, and for updating said routing strategy data in said data packet. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A method for routing a data packet within an adhoc network comprising
generating a data packet at an originator node, the data packet comprising: -
a node history, a routing strategy, and a destination node field; receiving the data packet by a routing node; when the routing node is not the destination node, at the routing node; identifying a best routing strategy by comparing the routing strategy to one or more route information stored in the routing node, assigning credits to each of the routing strategy and the one or more alternative routing strategies and selecting a revised data packet route by comparing the assigned credits, generating the revised data packet route including a revised routing strategy when the best routing strategy differs from the routing strategy, and transmitting the data packet to a next routing node along a data packet route associated with the best routing strategy; and repeating the receiving, identifying, generating, and transmitting steps at the next routing node. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30)
-
-
31. A method of operation of a node within an adhoc network comprising:
-
receiving a data packet, the data packet comprising; a node history, a routing strategy, and a destination node field; comparing the node to the destination node; when the node is not the destination node, identifying a best routing strategy by comparing the routing strategy to one or more route information stored in the node, assigning credits to each of the routing strategy and the one or more alternative routing strategies and selecting a revised data packet route by comparing the assigned credits, generating the revised data packet route including a revised routing strategy when the best routing strategy differs from the routing strategy, and transmitting the data packet to a next node along a data packet route associated with the best routing strategy. - View Dependent Claims (32, 33, 34, 35, 36, 37, 38, 39, 40)
-
Specification