IP Library Granted Patent US 6,915,451
Granted Patent B2
US 6,915,451 · App. 10/006,261 · Granted Jul 5, 2005

Distributed computer network including hierarchical resource information structure and related method of distributing resources

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 6,915,451
App. No.
10/006,261
Granted
Jul 5, 2005
Kind
B2
Abstract

In an enterprise-wide network which includes at least one centralized computer and a plurality of desktop computers, a method for enterprise system management comprising the steps of: storing an Already Have list for each desktop; storing a plurality of Should Have sub-lists; and generating a respective Should Have list from the stored sub-lists for a respective desktop computer during configuration of the desktop computer; wherein the Schema of the generated Should Have list includes at least one dynamic linkage which encompasses more than on Should Have sub-lists.

Claims (7)

1. A process of enterprise system management for use with an enterprise-wide network which includes at least one centralized computer and a plurality of desktop computers, the method comprising the steps of:

storing an Already Have list for each desktop;

storing a plurality of Should Have sub-lists;

allowing the specification, unique fingerprinting (OID's) and aging of configuration information to be used in the process of generating (resolving) Should Have lists;

generating a respective Should Have list for a desktop computer during configuration of the desktop computer, during which structural information (OIDCs) is calculated and imbedded in the Should Have List/Sublists, list/sublist last update date/time is percolated to higher list levels, and where configuration items and lists can be associated using dynamically resolved linkages;

differencing the Already Have and Should Have lists and sublists via a combination of structural verification, fractional change detection using the imbedded structural information (OIDCS) and date/time differences between the structures to detect all changes without having to process all items in all lists/sublists;

wherein the Schema of the generated Should Have list allows dynamic linkage with no disadvantage in performance or efficiency.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 12, 2005
From: HEWLETT-PACKARD COMPANY
To: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
Reel/Frame 016050/0887 →
MERGER Recorded Nov 9, 2004
From: NOVADIGM, INC.
To: HEWLETT-PACKARD COMPANY
Reel/Frame 015355/0969 →