Interprocess communication queue location transparency

Claim 2

A network management system for communication among processes at different nodes in a network executing user applications via key identified message queues at node locations unknown within an application requesting a communication transaction on a target queue comprising: an address resolution table at each node correlating a first, application supplied node unique target queue key with a second node unique key associated with said target queue; and routines at each node for accessing said table and constructing a target queue address for use in completing the requested communication transaction, and means for executing said routines to complete the requested communication transaction.

Claim 3

The system of claim 1 wherein each address resolution table is predefined by a network administrator.

Claim 8

In a network supporting a plurality of processor nodes for executing user application programs, and enabling access to target queues located at any node from any node, system means for making target queue node location transparent to user applications comprising: means for providing to user applications node unique target queue keys; means at each node for correlating user application target queue keys with target queue location nodes and keys; and message handling system call routines at each node for reading said means for correlating and establishing links for communicating between said application node and said location target queue node.

Claim 9

In a network supporting a plurality of processor nodes for executing user application programs, and enabling access to target queues located at any node from any node, system means for making target queue node location transparent to user applications comprising: means for providing to user applications node unique target queue keys; means at each node for correlating user application target queue keys with target queue location nodes and keys; and message handling system call routines at each node for reading said means for correlating and establishing links for communicating between said application node and said location target queue node.

Claim 10

In a distributed services network including interconnected processors, each located at a different network node, each processor including memory resident system resources and routines for creating and accessing message queues, and each processor being able to execute a plurality of user application programs, wherein communication among processors occurs via message queues located at any node in the network, a system for making message queue node locations transparent to user application programs comprising: library routine means callable from each node for assigning node unique keys to each user application program supplied queue name; table loading means operable at processor startup for providing at each node, a kernel resident mapping table having entries correlating said assigned node unique keys with message queue location nodes and key and system call routines for accepting a user application program supplied keys, locating a correlated message queue location node, and establishing a communication link between the user application program node and a correlated message queue location node for performing a message operation.

Claim 11

In a distributed services network including interconnected processors, each located at a different network node, each processor including memory resident system resources and routines for creating and accessing message queues, and each processor being able to execute a plurality of user application programs, wherein communication among processors occurs via message queues located at any node in the network, a system for making message queue node locations transparent to user application programs comprising: library routine means callable from each node for assigning node unique keys to each user application program supplied queue name; table loading means operable at processor startup for providing at each node, a kernel resident mapping table having entries correlating said assigned node unique keys with message queue location nodes and key and system call routines for accepting a user application program supplied keys, locating a correlated message queue location node, and establishing a communication link between the user application program node and a correlated message queue location node for performing a message operation.

Claim 12

The methods of claims 3 or 4 additionally including the step of: determining whether the message queue node has experienced a power cycle during a period between returning a message queue identifier to a node and the use thereof by said node.

Claim 13

The systems of claims 1, 5 or 6 additionally including: means for determining whether a message queue location node has experienced a power cycle during a period between returning a message queue identifier to a user application node and the use thereof at said user application node.

Claim 16

The methods of claims 3 or 4 including the additional steps of: associating a unique type value with each queue; post incrementing said unique type value when an application requests a unique type value; and using said type value to select a desired message from among a plurality of messages on a message queue.

Claim 17

The system of claim 9 wherein said demultiplexing means includes: means for associating a unique type value with each queue; means for post incrementing said unique type value when an application requests a user type value; and means using said type value for selecting a desired message from among a plurality of messages on a message queue.

Claim 18

The system of claim 1 additionally comprising: means for accepting a user application supplied alpha-numeric queue name and associating therewith a node unique numeric key.