EP0278316A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method and system for network management
Assignee: International Business Machines Corp
•
Filing: 1988-01-26
•
Granted: —
•
Expires: 2008-01-26
Abstract
Abstract Network management system having an efficient message handling technique implemented in AIX, an operating system derived from UNIX System V, for use in a distributed services network comprising a plurality of multi-processing , multi-tasking nodes (A,B,C) among which interprocess communication occurs via queues, the actual node locations of which are transparent at the application interface.
Inventors
- 👤 Donavon William Johnson
- 👤 Larry Keith Loucks
- 👤 Amal Ahmed Shaheen-Gouda
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-28 11:15
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/546; H; H04; H04L; H04L69/00
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
100 words
A method of communicating among nodes (A,B,C) in a network in which each node comprises a processor executing applications able to perform operations on memory resident, key identified message queues at any node in the network comprising: providing predefined, modifiable tables for mapping a first node unique queue key supplied by an application requesting access to a given queue identified by said first key to a second node and node unique queue key indicative of the actual location of said given queue; and utilizing said second node unique queue key in formulating an actual address for accessing said given queue.
Claim 2
Independent Claim
100 words
A method of communicating among nodes (A,B,C) in a network in which each node comprises a processor executing applications able to perform operations on memory resident, key identified message queues at any node in the network comprising: providing predefined, modifiable tables for mapping a first node unique queue key supplied by an application requesting access to a given queue identified by said first key to a second node and node unique queue key indicative of the actual location of said given queue; and utilizing said second node unique queue key in formulating an actual address for accessing said given queue.
Claim 3
Independent Claim
105 words
A method of facilitating communication among user applications executing at processors located at one or more nodes in a network, using message queues the actual node locations of which are transparent to the user applications, comprising the steps of: maintaining in memory at each node a key mapping table correlating node unique queue keys assigned to applications running at each node with actual queue node location and keys of message queues; accessing a key mapping table with an application supplied key for obtaining the node and key of a message queue and establishing a communications link between the application node and the message queue node.
Claim 4
Independent Claim
105 words
A method of facilitating communication among user applications executing at processors located at one or more nodes in a network, using message queues the actual node locations of which are transparent to the user applications, comprising the steps of: maintaining in memory at each node a key mapping table correlating node unique queue keys assigned to applications running at each node with actual queue node location and keys of message queues; accessing a key mapping table with an application supplied key for obtaining the node and key of a message queue and establishing a communications link between the application node and the message queue node.
Claim 5
Dependent Claim
42 words
The methods of Claim 1 or 2 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 6
Dependent Claim
54 words
The methods of Claims 1 or 2 including the additional steps of: associating a unique type valus 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 7
Dependent Claim
88 words
A network management system for communication among processes executing user applications at nodes (A,B,C) in a network, via key identified message queues at node locations unknown within the 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 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.
Claim 8
Dependent Claim
88 words
A network management system for communication among processes executing user applications at nodes (A,B,C) in a network, via key identified message queues at node locations unknown within the 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 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.
Claim 9
Dependent Claim
16 words
The system of Claim 5 wherein each address resolution table is predefined by a network administrator.
Claim 10
Dependent Claim
47 words
A system means of Claim 5 or 6 comprising: system means for making the actual target queue node transparent to user applications comprising: means for providing to user applications node unique target queue keys; means for demultiplexing a plurality of reply messages on a given message queue.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.