Multiplex communications – Wide area network – Packet switching
Patent
1990-03-06
1992-11-24
Olms, Douglas W.
Multiplex communications
Wide area network
Packet switching
370 941, 370 943, 370 54, 395 21, H04Q 1104
Patent
active
051669277
DESCRIPTION:
BRIEF SUMMARY
BACKGROUND ART
The present invention relates to communication networks including local and broad area networks, and more particularly to an adaptive routing method in a communication network. This method is flexibly adapted to enable the status of a network in a multi-media integrated network for processing various information such as ISDN to change in a mixed manner, thus realizing effective usage and high-performance communication.
As shown in FIG. 1, a future network has an increased scale, speed, variety and capacity, developing a multi-media integrated network which can process a variety of mixed information. In such integrated networks, requirements such as communication speed, reliability and real-time features change greatly with respect to time and space. Therefore, there is a great demand for a network which is flexibly adaptive to these changes in network status and able to realize effective usage and high-performance communication.
Data, such as voice or image data, which require real-time operation may be subjected to a packetexchange method routine. In this case, to avoid damage to the real-time operation it is necessary to transmit data comprising a series of plural packets without separation. Effective usage and high network performance is required to satisfy this condition.
The number of nodes in present networks is 10.sup.2 to 10.sup.3 and the transmission speed is several hundred Kbps. In future networks, the number of nodes is predicted to be 10.sup.4 to 10.sup.5 and the transmission speed to be several hundred Mbps. It is necessary to develop network control technology which will be useful for a long time to come in the future.
Packet exchange network technology is used to realize the above communication. Exchange methods for packet exchange networks include the datagram method in which no logical link is set between terminals. Here, a setting-up concept is not used, instead a virtual call method (VC) setting up a logical channel between terminals. A fixed logical link set between terminals is called a permanent logical virtual circuit (PVC).
Before a setting-up is conducted in a packet network using a general virtual call method which does not use a permanent virtual circuit, the amount of traffic to be entered into a network is first predicted and the most appropriate route is chosen to prevent predicted traffic from being concentrated in a predetermined node between respective terminals. The bus information is maintained at respective nodes. A plurality of alternate routes is also provided between terminals to prepare for and avoid a node fault or a busy condition which exceeds the predicted traffic.
FIG. 2 shows a prior art method of setting routes between terminals and a packet exchange network. In FIG. 2, the exchange network comprises 6 nodes, 1-6, and four terminals, 7-10. For example, between terminals 8 and 10, the route from node 2 to node 4 via node 3 is the most appropriate. In addition, there are two alternate routes: from node 2 via nodes 3 and 6, and from node 2- via nodes 5 and 6. When a virtual call is set up in such a network, the node containing the transmitting terminal collects the status of the network, i.e., faults or busy conditions, and selects the most appropriate route, or an alternative route. A packet is then transmitted along the route, to perform a setting up.
In a multi-media integrated large-scale network through which a great amount of data such as burst data or image data is transmitted, the width of the change of the media to be included with respect to the time and quantity becomes too large to be handled by the prior art methods. Therefore, for a virtual call, it is difficult to obtain the most appropriate route between terminals to adequately distribute network traffic, by predicting the manner of media usage.
To prepare a plurality of alternative routes, time is required to collect information from the entire network. Thus, the obtained route does not reflect the traffic condition of the current network, and the high speed and large capacity de
REFERENCES:
patent: 4656622 (1987-04-01), Lea
patent: 4660166 (1987-04-01), Hopfield
patent: 4825206 (1989-04-01), Brice, Jr. et al.
patent: 4920531 (1990-04-01), Isono et al.
patent: 4939718 (1990-07-01), Servel et al.
patent: 4974224 (1990-11-01), Boone
patent: 4991204 (1991-02-01), Yamamoto et al.
patent: 4999833 (1991-03-01), Lez
J. J. Hopfield et al., "Neural computation of decisions in optimization problems", Biological Cybernetics, vol. 52, 1985, pp. 141-152, Springer-Verlag.
R. Hecht-Nielsen, "Neurocomputing: picking the human brain", IEEE Spectrum, vol. 25, No. 3, Mar. 1988, pp. 36-41, IEEE, New York, N.Y.
M. S. Chrystall et al., "Adaptive routing in computer communication networks using learning automata", National Telecommunications Conference, New Oreleans, La., Nov. 29-Dec. 3, 1986, vol. 1, pp. A3.2.1-A3.2.7, IEEE, New York, N.Y.
Morishima et al., `Automatic Rule Extraction from Statistical Data and Fuzzy Tree Search`, Systems and Computers in Japan, vol. 19, No. 5, pp. 26-36 (1988).
Carpenter et al., `The Art of Adaptive Pattern Recognition by a Self-Organizing Neural Network`, IEEE-Computer, Mar. 1988, pp. 77-88.
Pourboghrat, `Neural Network for Learning Inverse-Kinematics of Redundant Manipulators`, E. I. Monthly No. EIM9102-008577 (1989).
Chugo Akira
Iida Ichiro
Fujitsu Limited
Hom Shick
Olms Douglas W.
LandOfFree
Adaptive pathfinding neutral network for a packet communication does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Adaptive pathfinding neutral network for a packet communication , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive pathfinding neutral network for a packet communication will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-928060