Multiplex communications – Diagnostic testing – Path check
Reexamination Certificate
1997-08-21
2001-03-13
Kizou, Hassan (Department: 2738)
Multiplex communications
Diagnostic testing
Path check
C370S255000, C370S351000, C370S408000, C379S221050, C709S239000
Reexamination Certificate
active
06201794
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The invention deals with systems in which data is communicated among a plurality of devices, and in particular with methods and apparatus for routing data on such systems.
2. Related Art
Systems which communicate data from one device to another typically route the data from a source to a destination along a route determined independently each time data is transmitted or determined in advance irrespective of dynamic traffic loads on a network. Such systems generally give no consideration to how data has previously been routed. For example,
FIG. 1
illustrates an arbitrary configuration of a network with devices
101
,
103
,
105
, and
107
. The devices communicate over lines connected to information transfer points
109
,
111
,
113
, and
115
. In routing a message from device
101
to
105
, several options are available. For example, a message can leave device
101
on signal line
117
and at node
109
be transferred to signal line
119
for routing to device
105
. Alternatively, at node
109
the message can be routed on signal line
121
to node
111
, which then transmits the message on signal line
123
to node
113
for transmission on line
125
to node
105
. Alternatively, node
111
can transmit the same message on signal line
127
to node
115
, which passes the message on signal line
129
to node
105
. Other alternative paths may also be available, depending on the present traffic on the network. As networks become more sophisticated involving additional devices and data transfer points, the routing decisions become more complex.
Conventionally, device
101
transmits its message using some method to determine an available transmit path to device
105
without any significant consideration of where device
105
is located on the network. Typically, device
101
looks for an available transmit path and leaves it up to device
105
to recognize the message and respond. Device
105
may receive the message quickly or slowly depending on the traffic and the route taken. If the message travels a circuitous route, its presence on the network consumes bandwidth that can be better utilized for other purposes. Thus, conventional systems which route information based on the availability of transmission resources at each of the data transfer points alone, may be highly inefficient.
SUMMARY AND OBJECTS OF THE INVENTION
In view of the above, it is an object of the invention to route a message from a first device to a second device over a known relatively efficient route.
It is another object of the invention to provide a method for identifying such relatively efficient routes.
It is a still further object of the invention to delay data transmission from a device until a predefined relatively efficient route becomes available, where using the available route is more efficient than transmission of the information on the first available transmission medium.
The above and other objects of the invention are accomplished by an information communication network with a plurality of nodes. At least one node of the plurality transmits a route determining message recognizable by another node in the plurality. The node transmitting the message records a path taken by the route determining message to the other node and routes subsequent messages over that path.
Another feature of the invention is that the route determining message can acquire routing tags indicative of points on a route taken through the network by the route determining message from the transmitting node to the destination node.
The routing tags can be stored in a memory so that subsequent messages from the first to the second node are passed through the points indicated by the routing tags.
The system according to the invention can also employ a master routing node in which the master routing node provides information for all nodes in the network. The master routing node can monitor message traffic as a background process by transferring messages to other nodes and receiving corresponding responses indicative of the route taken. Depending on the traffic and the routes taken by the messages transmitted as part of the background process, the master routing node can update information stored in the routing memory. Routing can be conducted by the master node or the routing memory can be distributed among the nodes using information sent by the master node. The master node can conduct the background processing for routing determination either at predetermined times or as a continuing background process. Moreover, the background process can be repeated for predetermined nodes more frequently at predetermined times, depending on the traffic pattern. For example, nodes which transmit information more frequently for a particular application can be monitored more often in the background process.
REFERENCES:
patent: 3705523 (1972-12-01), Alouisa
patent: 4032719 (1977-06-01), Blasbaig
patent: 5212789 (1993-05-01), Rago
patent: 5475732 (1995-12-01), Pester, III
patent: 5491695 (1996-02-01), Meagher et al.
patent: 5559877 (1996-09-01), Ash et al.
patent: 5570466 (1996-10-01), Oechsle
patent: 5613069 (1997-03-01), Walker
patent: 5703940 (1997-12-01), Sattar et al.
patent: 5721820 (1998-02-01), Abali et al.
patent: 5757895 (1998-05-01), Aridas et al.
patent: 5805593 (1998-09-01), Busche
Stewart Brett B.
Teich Paul R.
Advanced Micro Devices , Inc.
Foley & Lardner
Kizou Hassan
Pezzlo John
LandOfFree
Network with efficient message routing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Network with efficient message routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network with efficient message routing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2451277