Data model for automated server configuration

• US 20020082821A1
• Filed: 01/23/2001
• Published: 06/27/2002
• Est. Priority Date: 10/31/2000
• Status: Abandoned Application

• Current Assignee: Opsware, Inc. (HP Inc.)
• Original Assignee: Opsware, Inc. (HP Inc.)
• Inventors: Poskanzer, Harold, Ferguson, Glenn, Suorsa, Raymond
• Application Number:
  US09/766,652
• Publication Number:
  US 20020082821A1
• Time in Patent Office: Days
• US Class Current: 703/22
• CPC Class Codes: H04L 41/024 using relational databases for representation of network management data, e.g. managing via structured query language [SQL]
• CPC Class Codes: H04L 41/0806 for initial configuration or provisioning, e.g. plug-and-play
• CPC Class Codes: H04L 41/0856 by backing up or archiving configuration information
• CPC Class Codes: H04L 43/00 Arrangements for monitoring or testing data switching networks
• CPC Class Codes: H04L 43/065 related to network devices
• CPC Class Codes: H04L 43/0817 by checking functioning
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/45 Network directories; Name-to-address mapping
• CPC Class Codes: H04L 63/101 Access control lists [ACL]
• CPC Class Codes: H04L 63/105 Multiple levels of security

Abstract

The present invention is directed to a data model. The data model allows for modeling of all information relating to a computer network to be conveniently stored in a database in a manner which minimizes the effort associated with the addition of new devices to the network and maximizes software code reuse. The information relating to the network that may be modeled in the data model of the present invention include: software information, configuration information, monitoring information, hardware information, domain name server (DNS) information, network information, and information regarding queues that may be used by business logic, or intelligent agents in accessing and maintaining various portions of the network.

Claims

1. A queues data model for interacting with intelligent agents that perform tasks on a computer network by relating a list of tasks to be performed by the intelligent agents with specific agent commands and agent command outputs, said data model comprising:

a plurality of agent queues entities that represent a list of tasks to be performed by the intelligent agents on a computer network;

a plurality of agent queues commands entities that relate the plurality of agent queues entities with specific agent commands and agent command outputs;

a plurality of agent command output entities that represent the agent command outputs; and

a plurality of agent commands entities that represent the specific agent commands to be executed by the intelligent agents.

2. The data model of claim 1, further comprising:

a plurality of agent queue mutex entities that serve as a locking mechanism to prevent an agent from attempting to execute commands on a busy device until the device is no longer busy.

3. The data model of claim 1, further comprising:

a plurality of agent command mutex entities that serve as a locking mechanism for preventing an agent from executing more than a single queue at a given time.

4. A data model for relating commands and command outputs of intelligent agents of a computer network with queues associated with the intelligent agents, comprising:

a plurality of agent queue command entities for relating agent queues to agent commands and agent command outputs;

a plurality of agent queues entities representing said agent queues, which are a list of tasks to be completed by an intelligent agent on a computer network;

a plurality of agent command output entities representing said agent command outputs; and

a plurality of agent commands entities representing said agent commands.

5. The data model of claim 4, wherein the agents are prevented from executing more than a single queue at a given time by a plurality of agent command mutex entities, and wherein the agents are prevented from executing queues on devices that are already busy, thereby preventing a device from executing more than a single queue at a given time.

6. A queues data model for characterizing the interaction of queues entities, comprising:

a plurality of agent queues entities;

a plurality of agent queue commands entities;

a plurality of agent command output entities;

a plurality of agent commands entities; and

a plurality of agent command text entities.

7. The data model of claim 6, further comprising a plurality of agent queue mutex entities that serve as a locking mechanism by signalling to agents that a particular device is currently busy.

8. The data model of claim 6, further comprising a plurality of agent command mutex entities that serve as a locking mechanism to prevent an agent from attempting to accomplish more than one task at a time.

9. The data model of claim 6, wherein said agent queues entities is used to indicate to agents a list of tasks to be performed and may optionally relate to multiple agent queues entities and may relate to said agent queue commands entities by a one-to-many relationship.

10. The data model of claim 6, wherein said agent queue commands entities relate to said agent queues entities and said agent commands in many-to-one relationships and to said agent command output entities in a one-to-many relationship.

11. The data model of claim 6, wherein said agent command text entities relate to said agent commands entities by a many-to-one relationship.