Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing
Reexamination Certificate
1992-07-30
2001-02-20
Follansbee, John A. (Department: 2783)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
C709S223000
Reexamination Certificate
active
06192413
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The invention disclosed broadly relates to data processing systems and more particularly relates to routing communications between computer processes in the same communications node.
2. Background Art
The copending U. S. patent application by S. K. Miller, et al. cited above, is directed to a computer-based telephone call placement and answering system. A local area network is described in the S. K. Miller, et al. patent application, which includes a plurality of workstations, a gateway server, an archive server, and other equipment used to distribute incoming telephone calls to a plurality of operators working at workstations connected to a local area network. The operators can also place outbound calls. The gateway server connected to the local area network will receive caller identity information for inbound calls and will initiate the accessing of a data base coupled to the local area network, so as to enable the operators working at the workstations to have caller-related data displayed to them at the time that their telephone rings with the inbound call. The gateway server interacts with a PBX (Public Branch Exchange) connected to the public telephone network.
The system described in the S. K. Miller, et al. patent application is typical of multiple node local area network embodiments, in that it requires a communications program to be resident at each communications node to interact with a local area network for sending and receiving messages between the nodes. Many of the nodes are functionally different from one another, for example the workstation nodes are functionally different from the gateway server node, the workstation nodes are functionally different from the archive server node, and other types of functions for nodes connected to the local area network can be postulated which are different from the workstation nodes. The usual embodiment in the prior art for the communications program interfacing a communications node with a local area network, requires that the communications program be customized in its source code to interact with the plurality of computer program processes running in the node which must carry out the unique function assigned to that node.
When the function assigned to a particular node in a local area network is to be changed, it is typical in the prior art that the communications program for that node must also be changed in order to properly communicate with the new or modified processes to be resident in the node. Further, where a different node having a new function is added to the local area network, it may be necessary to modify the communications program in each of the other nodes to enable the proper receipt and processing of messages from the newly added node.
OBJECTS OF THE INVENTION
It is therefore an object of the invention to provide an improved method for performing communications management in a communications node of a local area network.
It is another object of the invention to provide a more flexible means for managing communications between a communications node and a local area network.
It is still a further object of the invention to provide a easily programmed means to change the unique program functions performed in a communications node so as to make unnecessary the reprogramming of communications software in the communications node.
SUMMARY OF THE INVENTION
These and other objects, features and advantages are accomplished by the invention disclosed herein. An interprocess communications routing method and system are disclosed for receiving messages at a communications node from a local area network or other type of communications network. The messages are directed to selected process queues. The method includes the step of receiving at the communications node a message from the communications network. The message includes a message type designation and accompanying data. The method continues by searching a router table stored in the communications node. The search is performed by using the message type designation as a query term in the router table. The search is performed to get a process queue name for a process queue which is resident in the communications node. Once the process queue name has been obtained from the router table, the method continues by writing the data from the message into the named process queue.
The router table can include a plurality of message type designations and a corresponding plurality of process queue names. Typical message type designations can include a heartbeat message, a progress message, a transfer data message, a telephony request message, a workstation message, an archive server message, or an event status message. Other types of functions such as diverse telephony functions can also have their messages designated. Each of these corresponding message types can correspond to a particular communications or telephony function which is carried out at the communications node.
By providing the router table in each communications node to enable the mapping of diverse messages to selected computer programs and their corresponding process queues, flexibility is provided in the reconfiguration of an individual communications node. Flexibility is also provided in the reconfiguration of the overall local area network, without the necessity of changing the communications software which must support that communications in each node.
REFERENCES:
patent: 3989900 (1976-11-01), Norwich
patent: 4320256 (1982-03-01), Freeman
patent: 4406925 (1983-09-01), Jordan et al.
patent: 4438296 (1984-03-01), Smith
patent: 4451700 (1984-05-01), Kempner et al.
patent: 4599493 (1986-07-01), Cave
patent: 4742511 (1988-05-01), Johnson
patent: 4797911 (1989-01-01), Szlam et al.
patent: 4870571 (1989-09-01), Frink
patent: 4894857 (1990-01-01), Szlam et al.
patent: 4896290 (1990-01-01), Rhodes et al.
patent: 5036535 (1991-07-01), Gechter et al.
patent: 5084816 (1992-01-01), Boese et al.
patent: 5097528 (1992-03-01), Gursahaney et al.
patent: 5119370 (1992-06-01), Terry
patent: 5218676 (1993-06-01), Ben-Ayed et al.
patent: 5245705 (1993-09-01), Swaney
patent: 5249178 (1993-09-01), Kurano et al.
patent: 5283897 (1994-02-01), Georgiadis et al.
patent: 5309431 (1994-05-01), Tominaga et al.
patent: 5335347 (1994-08-01), Foss et al.
Gursahaney Suresh K.
Lee Dana R.
Madrid Richard J.
Flynn John D.
Follansbee John A.
International Business Machines - Corporation
LandOfFree
Method and system for process queue communications 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 Method and system for process queue communications routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for process queue communications routing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2611104