PACKET DATA NEURAL NETWORK SYSTEM AND METHOD
First Claim
Patent Images
1. A method of using a packet data network to solve a complex math problem involving multiple related objects comprising:
- assembling an array of interconnected nodes of the packet data network on a surface;
organizing the objects of the math problem into an array;
mapping the objects onto the corresponding nodes;
building a path between a first node and a second node based on the relationship between the objects;
converting the relationship between the objects into a time delay value;
associating a path between the first node and the second node with the time delay value, and storing the value in a memory associated with said path;
receiving a route request packet at the first node;
using data included with the route request packet to retrieve the previously stored time delay value from the memory;
delaying the retransmission of the route request packet by the retrieved time delay value.
0 Assignments
0 Petitions
Accused Products
Abstract
This application discloses a neural network that also functions as a connection oriented packet data network using an MPLS-type label switching technology. The neural network uses its intelligence to build and manage label switched paths (LSPs) to transport user packets and solve complex mathematical problems. However, the methods taught here can be applied to other data networks including ad-hoc, mobile, and traditional packet networks, cell or frame-switched networks, time-slot networks and the like.
85 Citations
7 Claims
-
1. A method of using a packet data network to solve a complex math problem involving multiple related objects comprising:
-
assembling an array of interconnected nodes of the packet data network on a surface; organizing the objects of the math problem into an array; mapping the objects onto the corresponding nodes; building a path between a first node and a second node based on the relationship between the objects; converting the relationship between the objects into a time delay value; associating a path between the first node and the second node with the time delay value, and storing the value in a memory associated with said path; receiving a route request packet at the first node; using data included with the route request packet to retrieve the previously stored time delay value from the memory; delaying the retransmission of the route request packet by the retrieved time delay value. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
Specification