US2001034829A1PendingUtilityA1

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

Priority: Apr 30, 1993Filed: May 29, 2001Published: Oct 25, 2001
Est. expiryApr 30, 2013(expired)· nominal 20-yr term from priority
Y10S707/99954G06F 8/64Y10S707/99953G06Q 10/10G06F 8/71G06F 8/65G06F 8/41
29
PatentIndex Score
0
Cited by
0
References
0
Claims

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

exact text as granted — not AI-modified
What is claimed is:  
     
         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.

Join the waitlist — get patent alerts

Track US2001034829A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.