|Publication number||US7735142 B2|
|Application number||US 11/768,055|
|Publication date||Jun 8, 2010|
|Filing date||Jun 25, 2007|
|Priority date||Jun 30, 2003|
|Also published as||US7237266, US20050015382, US20080172743|
|Publication number||11768055, 768055, US 7735142 B2, US 7735142B2, US-B2-7735142, US7735142 B2, US7735142B2|
|Inventors||Jeffrey A. Aaron|
|Original Assignee||At&T Intellectual Property I, L.P.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (100), Non-Patent Citations (26), Referenced by (4), Classifications (16), Legal Events (9) |
|External Links: USPTO, USPTO Assignment, Espacenet|
Electronic vulnerability and reliability assessment
US 7735142 B2
Systems for providing information on system vulnerabilities include a database populated with descriptive system information and a database structure configured as a hierarchical plurality of database pages configured to include element vulnerability information and links to related database pages. A rule processor module is configured to provide rules for cycling through the database structure to match keywords, such as keywords provided by user input, and descriptive system information from the database with element vulnerability information from the database structure. Other systems and methods are also provided.
1. A system for providing vulnerability information regarding a system, comprising:
a database populated with descriptive system information about the system;
a database structure configured as a hierarchical plurality of database pages, at least a portion of the hierarchical plurality of database pages including a page index, a data section and a selector section, wherein the data section is configured to include information regarding vulnerability of an element of the system and the selector section is configured to include keywords associated with at least one page index of a further, related database page of the hierarchical plurality of database pages;
a rule processor module configured to provide rules for cycling through the hierarchical plurality of database pages of the database structure to obtain a database page of the hierarchical plurality of database pages having at least one keyword that matches keywords provided by user input, wherein the at least one page index associated with the at least one keyword of the obtained database page is associated with a further, related database page to be obtained while cycling through the hierarchical plurality of database pages;
an input parser/filter module operatively coupled to the rule processor module, the input parser/filter module configured to receive policy or profile input from a user's processing device and to convert the input into data usable by the rule processor module, wherein the data usable by the rule processor comprises at least the keywords provided by the user input;
a state accumulator module operatively coupled to the rule processor module, the state accumulator module configured to store intermediate vulnerability status and result information; and
a vulnerability accumulator module operatively coupled to the rule processor module, the vulnerability accumulator module configured to store the information regarding vulnerability of an element of the system accumulated from the data section of each of the hierarchical plurality of database pages accessed while cycling through the hierarchical plurality of database pages.
2. The system of claim 1, further comprising a presentation module operatively coupled to a user's processing device and the vulnerability accumulator module, the presentation module configured to summarize and format the information regarding vulnerability of an element of the system accumulated from the data section of each of the hierarchical plurality of database pages accessed while cycling through the hierarchical plurality of database pages for utilization by the user's processing device.
3. The system of claim 1, further comprising a database interface module operatively coupled between the database and database structure, and the result accumulator module, the database interface module configured to enable provisioning and access to the database and the database structure.
4. The system of claim 1, wherein the database comprises an element descriptive database (EDD).
5. The system of claim 1, wherein the database structure comprises a hierarchical vulnerability database (HVD) structure.
CROSS REFERENCE TO RELATED APPLICATIONS
This patent application is a divisional of U.S. patent application Ser. No. 10/611,637, now U.S. Pat No. 7,237,266 entitled “Electronic Vulnerability and Reliability Assessment,” filed Jun. 30, 2003, which is herein incorporated by reference in its entirety.
The present invention is generally related to computer systems and, more particularly, is related to network management and troubleshooting systems.
BACKGROUND OF THE INVENTION
Electronic networks are increasingly becoming more complex. Typically these networks include a plurality of processing devices, communications systems, software, routing elements, and security intrusion protection, etc. Managing and controlling components of these complex networks has become challenging due to the large number of elements included in the networks. In addition, administration of an electronic network involves understanding policies for use and protection of the network elements and the characteristics of the network that are unique to each customer.
Administrators of electronic networks continue to be concerned with reliability and security of these complex networks, among other concerns. Because of the large number of elements of the network, it may not be readily apparent to the administrators, which components or portions of the network are vulnerable to failure or unauthorized intrusion. As a result, the administrators may be unable to determine what, if any impact system or policy changes will have on the network. Without this knowledge, administrators may unintentionally implement policies that negatively impact the reliability and/or security of the network.
Thus, heretofore-unaddressed needs exist for a solution that addresses the aforementioned deficiencies and inadequacies.
SUMMARY OF THE INVENTION
Preferred embodiments of the present invention provide a system and method for electronic vulnerability and reliability assessment.
Briefly described, in architecture, one embodiment of the system, among others, can be implemented to include a database populated with descriptive system information and a database structure configured as a hierarchical plurality of database pages configured to include element vulnerability information and links to related database pages. A rule processor module is configured to provide rules for cycling through the database structure to match keywords provided by user input with element vulnerability information from the database structure.
Preferred embodiments of the present invention can also be viewed as providing methods for the electronic profile and policy vulnerability and reliability assessment. In this regard, one embodiment of such a method, among others, can be broadly summarized by the following steps: populating a database with element or system vulnerability information; obtaining policy-based descriptive information for the system; and selecting database pages to access from a database structure configured as hierarchical plurality of database pages; and utilizing keyword matching to obtain vulnerability information for the element or combination of elements.
Other systems, methods, features, and advantages of the present invention will be or become apparent to one with skill in the art upon examination of the following drawings and detailed description. It is intended that all such additional systems, methods, features, and advantages be included within this description and be within the scope of the present invention.
BRIEF DESCRIPTION OF THE DRAWINGS
Many aspects of the invention can be better understood with reference to the following drawings. The components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the present invention. Moreover, in the drawings, like reference numerals designate corresponding parts throughout the several views.
FIG. 1 is a block diagram depicting a preferred embodiment of a system for electronic profile and policy vulnerability and reliability assessment.
FIG. 2 is a block diagram depicting a more detailed illustrative example of a preferred embodiment of a system for providing electronic profile and policy vulnerability and reliability assessment.
FIG. 3 is a block diagram of an illustrative example of a preferred embodiment of modules of a sequential examination engine of a system for electronic profile and policy vulnerability and reliability assessment.
FIG. 4 is a block diagram of an illustrative example of a preferred embodiment of a hierarchical vulnerability database structure of a system for electronic profile and policy vulnerability and reliability assessment.
FIG. 5 is a flowchart depicting general functionality, in accordance with one preferred embodiment, of an implementation of electronic profile and policy vulnerability and reliability assessment.
FIGS. 6A and 6B are flowcharts depicting more specific functionality, in accordance with one preferred embodiment, of an implementation of electronic profile and policy vulnerability and reliability assessment.
FIG. 7 is an illustrative example of a preferred embodiment of cycling through a hierarchical vulnerability database structure of a system for electronic profile and policy vulnerability and reliability assessment.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Disclosed herein are systems and methods for the electronic profile and policy vulnerability and reliability assessment. To facilitate description, an example system that can be used to implement the electronic profile and policy vulnerability and reliability assessment is discussed with reference to the figures. Although this system is described in detail, it will be appreciated that this system is provided for purposes of illustration only and that various modifications are feasible without departing from the inventive concept. After the example system has been described, an example of operation of the system will be provided to explain the manner in which the system can be used to provide the electronic profile and policy vulnerability and reliability assessment.
Referring now in more detail to the drawings, in which like numerals indicate corresponding parts throughout the several views, FIG. 1 is a block diagram depicting a preferred embodiment of a system 100 for electronic profile and policy vulnerability and reliability assessment. The system 100 includes a user processing device 102, a provider network 104, a computing device 108 that depicts an illustrative example of an implementation of electronic profile and policy vulnerability including logic configured to provide for profile and policy vulnerability assessment information, and a plurality of databases 112, 114. In one preferred embodiment, information stored in databases 112, 114 is organized as field, records, or files, etc. In another preferred embodiment, the databases 112, 114 are accessible to the computing device 108 via a system I/O interface 126. In yet another preferred embodiment, the computing device 108 is configured to include the databases 112, 114 in memory. In still another preferred embodiment, the databases reside on a storage server (not shown) accessible by the computing device 108.
The provider network 104 may be any type of communications network employing any network topology, transmission medium, or network protocol. For example, such a network may be any public or private packet-switched or other data network, including the Internet, circuit-switched network, such as a public switch telecommunications network (PSTN), wireless network, or any other desired communications infrastructure and/or combination of infrastructure. In an alternative preferred embodiment, the user could interact directly with the computing device 108.
Generally, in terms of hardware architecture, as shown in FIG. 1, the computing device 108 includes, inter alia, a processor 120 and memory 122. Input and/or output (I/O) devices (or peripherals) can be communicatively coupled to a local interface 124 via a system I/O interface 126, or directly connected to the local interface 124. The local interface 124 can be, for example but not limited to, one or more buses or other wired or wireless connections, as is known in the art. The local interface 124 may have additional elements, which are omitted for simplicity, such as controllers, buffers (caches), drivers, repeaters, and receivers, to enable communications. Further, the local interface may include address, control, and/or data connections to enable appropriate communications among the aforementioned components.
The processor 120 is a hardware device for executing software, particularly that stored in memory 122. The processor 120 can be any custom made or commercially available processor, a central processing unit (CPU), an auxiliary processor among several processors, a semiconductor based microprocessor (in the form of a microchip or chip set), a macroprocessor, or generally any device for executing software instructions.
The memory 122 can include any one or combination of volatile memory elements (e.g., random access memory (RAM, such as DRAM, SRAM, SDRAM, etc.)) and nonvolatile memory elements (e.g., ROM, hard drive, tape, CDROM, etc.). Moreover, the memory 122 may incorporate electronic, magnetic, optical, and/or other types of storage media. Note that the memory 122 can have a distributed architecture, where various components are situated remote from one another, but can be accessed by the processor 120.
The software and/or firmware in memory 122 may include one or more separate programs, each of which comprises an ordered listing of executable instructions for implementing logical functions. In the example of FIG. 1, the software in the memory 122 can include policy vulnerability and reliability assessment logic 130, and a suitable operating system (O/S) 128. The operating system essentially controls the execution of other computer programs, and provides scheduling, input-output control, file and data management, memory management, and communication control and related services.
The logic 130 is a source program, executable program (object code), script, or any other entity comprising a set of instructions to be performed. When the logic 130 is implemented as a source program, then the program needs to be translated via a compiler, assembler, interpreter, or the like, which may or may not be included within the memory 122, so as to operate properly in connection with the O/S. Furthermore, logic 130 can be written as (a) an object oriented programming language, which has classes of data and methods, or (b) a procedure programming language, which has routines, subroutines, and/or functions, for example but not limited to, C, C++, Pascal, Basic, Fortran, Cobol, Perl, Java, and Ada.
The I/O devices may include input devices, for example but not limited to, a keyboard, mouse, scanner, microphone, etc. Furthermore, the I/O devices may also include output devices, for example but not limited to, a printer, display, etc. The I/O devices may further include devices that communicate both inputs and outputs, for instance but not limited to, a modulator/demodulator (modem; for accessing another device, system, or network), a radio frequency (RF) or other transceiver, a telephonic interface, a bridge, a router, etc. Finally, I/O 126 may couple to the provider network 104 that is configured to communicate with the user processing device 102.
When the logic 130 is implemented in software, as is shown in FIG. 1, it should be noted that logic 130 can be stored on any computer-readable medium for use by or in connection with any computer related system or method. The logic 130 can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. In the context of this document, a “computer-readable medium” can be any means that can store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The computer-readable medium can be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. More specific examples (a nonexhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic) having one or more wires, a portable computer diskette (magnetic), a random access memory (RAM) (electronic), a read-only memory (ROM) (electronic), an erasable programmable read-only memory (EPROM, EEPROM, or Flash memory) (electronic), an optical fiber (optical), and a portable compact disc read-only memory (CDROM) (optical). Note that the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
In an alternative embodiment, where the logic 130 is implemented in hardware, the logic 130 can be implemented with any or a combination of the following technologies, which are each well known in the art: a discrete logic circuit(s) having logic gates for implementing logic functions upon data signals, an application specific integrated circuit (ASIC) having appropriate combinational logic gates, a programmable gate array(s) (PGA), a field programmable gate array (FPGA), etc.
FIG. 2 is a block diagram depicting a more detailed illustrative example of a preferred embodiment of a system 200 for providing electronic profile and policy vulnerability and reliability assessment. The system 200 includes the computing device 108 that communicates with the user processing device 102, provider network 104, databases 112, 114 configured as an index database (EDD) 210 and a deep database (HVD) 212. The computing device 108 further includes a presentation module 204, memory 122 having operating system 128 and logic 130 configured as a sequential examination engine 206, and system interfaces 126, 126A. Further, computing device 108 includes local interface 124, processor 120, and network interface card 214. In an example, the user processing device 102 communicates with the computing device 108 via the I/O 126A. In another preferred embodiment, the user processing device 102 communicates with the computing device 108 via the provider network 104. In a preferred embodiment, the network interface card 214, I/O 126, and database interface modules 208 are utilized for communicating between the provider network 104 and databases EDD (element descriptive database) and HVD (hierarchical vulnerability database) 210, 212.
1. Sequential Examination Engine
The sequential examination engine (SEE) 206 provides an interface and algorithmic intelligence between the user processing device 102, presentation module 204 and the databases 210, 212 via the database interface module 208. In a preferred embodiment, the SEE 206 is configured to receive user input requesting policy and/or profile information for an element or combination of elements of a network or system and to access the databases 210, 212 to obtain a result. Preferably, the SEE 206 accesses the EDD 210 for element descriptions of the selected network/system (as well as customer records) and cycles through the HVD 212 starting at a general level for each element, examining each level until every possible vulnerability for that element has been examined. After all elements or combination of elements have been examined, the results are accumulated and made available to the presentation module 204 and/or the user's processing device 102.
2. Presentation Module
The presentation module 204 summarizes and formats the accumulated vulnerability results in an appropriate manner to be informative and useful to a user. In one preferred embodiment, the presentation module 204 utilizes software engineering to accomplish the presentation of accumulated vulnerability results to the user. For example, application programming interfaces can be utilized that are consistent with the user's operating system such as Unix, Linux, Windows, etc., with specific configurations being dependent upon the user's particular implementation. In another preferred embodiment, the presentation module 204 includes functionality to eliminate repetitious information in the results stored from each cycle and cycle set, for instance, by searching within the accumulated vulnerability information for identical material and deleting subsequent occurrences so that the final results presented to the user do not exhibit any redundancies. Intermediate accumulated vulnerability results (i.e., accumulated after the completion of each cycle set) are presented to the user so that the user can monitor the process and take action if needed, for example, to abort and restart the process with corrected policy and/or profile input. In addition, the presentation module 204 allows the user to terminate or modify the process as needed. For example, when the monitored results are not satisfactory, or early-found vulnerabilities are so severe that the user recognized that major policy changes are required, the user may choose to immediately modify the input accordingly and re-start the examination with corrected policy interaction. In one preferred embodiment, the process continues to completion without user input. In an alternative preferred embodiment, when intermediate accumulated results are presented to the user, a portion of that information accessed from the HVD 212 as a result of the cycle just completed can include pertinent questions associated with specific keywords. The user can be prompted for additional input at the end of a cycle in which some degree of uncertainty has occurred such that the vulnerability results could be improved with additional input. This input becomes keywords for matching in the HVD 212 during the next cycle via the action of an input parser/filter module (shown in FIG. 3). In addition, the presentation module 204 preferably provides keywords associated with any current prompting to the input parser/filter module (shown in FIG. 3) so that user input/responses to that prompting can be associated with the pertinent keywords, such that the keywords can be provided to the rule processor module (shown in FIG. 3). In an alternative embodiment, where keywords are not actually extracted from the user, but rather the user answers a specific prompt with a yes or no, when the response is yes, the keyword associated with that prompt is provided to the rule processor module (shown in FIG. 3).
3. Database Interface Module
The database interface module 208 provides standard functionality utilizing, for instance, a structured query language to enable provisioning and access of the databases EDD 210 and HVD 212. In an alternative preferred embodiment, an additional interface, such as a provisioning interface can be provided which provides for provisioning of the databases.
In a preferred embodiment, the HVD 212 is pre-provisioned with descriptive vulnerability and reliablity data such that correct results can be achieved. Preferably, data in the HVD 212 is arranged hierarchically and includes a plurality of database pages (shown in FIG. 4) having a page index, data section and selector section. The HVD 212 is preferably organized in a database structure of HVD pages as a range of information or as a continuum into a set of discrete stages that allow for repeated progression into deeper stages utilizing a sequence of questions and answers that an expert would typically utilize to progress accurately from each stage to the next.
For example, a top section of the HVD structure includes information necessary to identify broad categories of security or reliability vulnerabilities based on general information regarding system and/or network elements. An inquiry to a bottom section of the HVD structure results in specific vulnerability information resulting from a sequential process of delving further and further into details regarding the system/network elements, and provides specific advice for remedial action. Intermediate sections of the HVD structure are preferably pre-provisioned with information and questions/answers that allows a rule processor (shown in FIG. 3) to proceed from a top HVD page to the desired bottom page(s), and allows for branching to related HVD pages as needed to identify all associated helpful information.
In a preferred embodiment, the EDD 210 includes descriptive information for the elements of the customer's network or system, customer records, and any other pertinent customer information.
FIG. 3 is a block diagram of an illustrative example of a preferred embodiment of modules of a sequential examination engine 206 of a system for electronic profile and policy vulnerability and reliability assessment. In a preferred embodiment, the sequential examination engine 206 includes a vulnerability accumulator module 302 that communicates with the presentation module 204 and a rule processor module 304, a state accumulator module 306 that communicates with the rule processor module 304, and an input parser/filter module 308 that communicates with the rule processor module 304, presentation module 204 and the user processing device 102 (not shown in FIG. 3).
5. Input Parser/Filter Module
The input parser/filter module 308 receives policy/profile input from a user's processing device 102 in a plurality of formats, such as data files of an acceptable format, or other input either automatically provided by a policy/profile management application or manually in response to prompting from the presentation module 204, among others. In one preferred embodiment, the input parser/filter module 308 utilizes standard software engineer techniques to convert the input data usable by the rule processor module 304. The input parser/filter module 308 preferably interacts with the user's processing device 102 via application programming interfaces that are consistent with the user's operating system, for instance, Unix, Linux, windows, etc., with the details of the interfaces being dependent upon the specific implementation including the choice of software language and design. In a preferred embodiment, the implementation is selected to perform the specific conversions needed for each allowed input type. During the conversion process, the input parser/filter module 308 filters out extraneous data, such that only pertinent input remains. Further, the input parser/filter module 308 receives keyword information from the presentation module 204 regarding any current prompting provided to the user so that user responses to that prompting can be associated with those pertinent keywords.
6. Rule Processor Module
The rule processor module 304 cycles through the process shown in FIG. 7 for each element under examination, then for any combination of elements as needed, gathering additional vulnerability information that is accumulated or stored in the state accumulator module 306 until complete vulnerability results are obtained for each element, and then finally for the system under examination as a whole. Preferably, the rule processor module 304 receives input from the input parser/filter module 308. The rule processor module 304 queries the EDD 210 to obtain pertinent descriptive information for the system under examination, including the elements of that system and how they are related or connected. Subsequently, the rule processor module 304 checks the “state” via the state accumulator module 306. A state is comprised of summary and/or special information obtained from the HVD 212 in previous cycles, or obtained from the EDD 210, for the purpose of potentially aiding or modifying subsequent keyword matching/filtering (in various ways as described later). For the first element of the system under examination, and later for subsequent elements and element combinations, the rule processor module 304 selects the HVD indices/pages to access via keyword matching between (a) the filtered policy/profile input for the system under examination along with any “special state” info (if any), and (b) the information contained in the HVD page selector. After accessing the selected HVD pages, the rule processor module 304 sends the pertinent vulnerability information (i.e., the data section of a HVD page) from these pages to the vulnerability accumulator module 302, retains the new selector information (i.e., selector section of a HVD page), updates the “state” in the state accumulator module 306 as appropriate by for example, adding the HVD indices of pages just accessed. In addition, the rule processor module 304 either (i) loops back to obtain additional input to continue accessing deeper levels of the HVD 212 for the same element, (ii) begins cycling for a subsequent element or element combination, or (iii) finishes by updating the EDD system-descriptive information with the element counter value (e.g., indicating the breadth/extent of the process just concluded) and the final vulnerability findings (e.g., the list of pages/indices accessed to provide the final accumulated results for the examined system as a whole). In an alternative embodiment, the rule processor module 304 is configured to utilize accumulated state information from the state accumulator module 306 to modify the matching or filtering of keywords, such that a likelihood of success of a probability of matching or filtering of keywords is changed based upon probabilistic, statistical, conditional pre-requisite item, occurrence, situation, or rules information.
7. State Accumulator Module
The state accumulator module 306 stores intermediate status and result information that provides for keeping track of progress and for appropriately selecting the subsequent database accesses for each cycle of additional user input and database access/result determination. The state accumulator module 306 stores both the list of pages (via indices) accessed and any special state information. In an example, special state information provides a mechanism for adding in or subtracting from the matching process for a specified keyword, in a circumstance where matching is not all or none but rather is by degree where the matching must for example exceed a pre-specified threshold in order to qualify as a match. In one preferred embodiment, the state accumulator module 306 provides a short-term memory that is utilized until the set of cycles associated with the examination of one policy/profile-managed system, which preferably includes all the sets of cycles for each element and element combinations considered, is completed and the final accumulated vulnerabilities are presented to the user. At the conclusion of this superset of cycles, the state is reset, or alternatively, the state is reset at the start of the next superset.
8. Vulnerability Accumulator Module
The vulnerability accumulator module 302 stores intermediate results. The results of each cycle of additional user input and database access/result determination are added to the vulnerability accumulator module 302. In one preferred embodiment, at the end of the entire superset of cycles and preferably while the examination is still underway, as well as at the end of each set of cycles for each element and element combination that has been completed, the vulnerability accumulator module 302 contains the resulting identified vulnerabilities for each element and element combination considered at that point. Eventually the vulnerability accumulator module 302 contains results for the examined system as a whole, and makes the results available to the user's processing device 102 via the presentation module 204.
FIG. 4 is a block diagram of an illustrative example of a preferred embodiment of a hierarchical vulnerability structure database (HVD structure) 400 of a system for electronic profile and policy vulnerability and reliability assessment. The HVD structure 400 includes a plurality of database pages such as page 402. The database page 402 includes a page index 404, a data section 406 and a selector selection 408. The database pages 402 may also be referred to as entries or forms. The page index 404 preferably includes an index number and a descriptive title. In a preferred embodiment, the page index 404 is utilized by the HVD structure 400 to retrieve the appropriate database page 402.
The data section 406 includes the actual information and data accumulated and presented to the user regarding details of the identified vulnerability results. The selector section 408, in a preferred embodiment encompasses one or more independent lines of data, includes up and down links to related database pages. In a preferred embodiment, the selector section 408 includes one or more index numbers as a database link to any related pages and a matching field which contains a list of keywords, associated numeric ranges, etc., all of which can be used in the matching process to select subsequent pages to access. Thus, in a preferred embodiment, each independent line of the selector section contains one or more keywords plus one or more specific database page link indices with which these keywords are specifically associated (as well as optional data such as related numeric ranges for alternate or advanced matching/filtering). In an alternative embodiment, the selector section 408 includes an empty or “null” downward-pointing indicator line if the page is a “bottom page.”
In the illustrative example shown in FIG. 4, a cycle typically begins at the top database page 402. In an example, the database page 402 contains mostly selector section information. The database pages at level 410 each include selector section 408 information, however, the amount of solution data in the data section 406 is increasing. At level 412, the database pages include less selector section 408 information and more solution data in the data section 406. At level 414, the database pages include more detailed solution data in the data section 406 and very little information in the selector section 408. Level 416 shows the bottom of the HVD structure 400 for the illustrative example. Database page 420 includes a null section 422 indicating that this page is the bottom page. The bottom database page 420 does not include downward pointing selector information and thus, a cycle stops at this page unless the cycle was previously stopped.
As shown in FIG. 4, the database pages are preferably organized in a hierarchical structure. For example, a cycle or search typically begins at HVD page 402. The selector section 408 of this page 402 provides links to a number of related pages. In an example, only one page, for example, HVD page 411 contains relevant information. Another cycle based on keywords identified in HVD page 411 uncovers links to the next level of HVD pages with HVD page 413 providing relevant information. Another cycle based on keywords identified in HVD page 413 reveals a link to HVD page 415. Another cycle based on keywords identified in HVD page 415 reveals a link to HVD page 420. In this example, HVD page 420 is the bottom page, as indicated by the null 422 reference, and thus no downward pointing selector information is available and the cycle ends.
FIG. 5 is a flowchart depicting general functionality (or method), in accordance with one preferred embodiment, of an implementation of electronic profile and policy vulnerability and reliability assessment. The process begins at 502. At 504, a user requests or inputs policy information to assist in identifying security and/or reliability related vulnerabilities of computer and/or network systems. The user can submit the request or policy information via numerous formats including email, web form, policy management application file, automatically generated files such as firewall or intrusion detection system logs, electronic interactive form input filled out by a customer representative talking with a customer, input in response to prompting from a presentation module, among others. In a preferred embodiment, the user's request for information is converted into data usable by a rule processor module. At 506, the rule processor module (or other searching processing devices) cycles through databases, such as the hierarchical vulnerability database to obtain a reply to the user's request for information. At 508, the user determines if the reply answers the question or request for vulnerability information by considering each network/system element (or combination of elements) separately, i.e. by determining its potential vulnerabilities alone (or as a particular specified combination). If not, at 510, a determination is made as to whether to consider additional elements or combinations. If so, the process continues at 504 with the next element or combination. If consideration of further elements or combination is unnecessary, the process ends at 512. If all necessary elements and combinations have been considered, at 514, the user has the option to consider another network or system. If the user chooses to consider another network or system, the process begins again at 504 with the user requesting vulnerability information for that network or system. If the user does not choose to ask another question, the process ends at 512.
FIGS. 6A and 6B are flowcharts depicting more specific functionality (or methods), in accordance with one preferred embodiment, of an implementation of electronic profile and policy vulnerability and reliability assessment. The process begins at 602. At 604, the network or system is selected in order to identify the user so that the appropriate set of information contained in the EDD (which may contain information associated with many different networks or systems) can be appropriately selected and accessed. The element counter is set to 1, and the cycle counter is set to 1. In an alternate preferred embodiment, a combination counter is also set to 1, while a cumulative cycle counter is set to zero. At 606, policy input is requested. In a preferred embodiment, a user's processing device configured to interact with a presentation module is utilized to query the user. At 608, the policy input is received. Policy input can be received via a plurality of mechanisms, including input received directly from the user, email, policy management application file, web page form, or pager, or a combination of these inputs, among others. At 610, the input type is identified. For instance, the input is identified as being manual, application file, web form, log file, email, or a combination of these types of input, among others. At 612, the input is parsed and/or filtered such that only potentially useful information remains. At 614, in a preferred embodiment, a rule processor module receives the filtered input. Preferably, the filtered input is provided in a format that is suitable for matching with data selector information of a database page of a hierarchical vulnerabilities database (HVD). At 616, the rule processor module queries an element descriptive database (EDD) to obtain descriptive information regarding the elements of the system/network and how they are related or connected, as well as user records (or profile) information. At 618, the rule processor module checks for any “states” via the state accumulator module. The state is comprised of summary and/or special information obtained from the HVD in previous cycles, or obtained from the EDD, for the purpose of potentially aiding or modifying subsequent keyword matching/filtering (in various ways, some of which are described for purposes of example in the several paragraphs following). At 620, the rule processor module selects the HVD indices and/or pages to access utilizing the matching of the filtered input and state information against the HVD page selector information. In a preferred embodiment, the rule processor module begins at a top page of the HVD structure on the first cycle. A portion of each HVD page includes selector information that is matched against the next cycle. In a preferred embodiment, the rule processor module performs matching to determine the next HVD page or pages to access by performing a matching between (a) the filtered input plus any special state information, if any, and (b) the information contained in the HVD page selector from the last HVD page or pages accessed. In one preferred embodiment, these matches consist of whether keywords are present or not in both the filtered input and the currently held page selector information. If simultaneously present, there is a match, and the associated page index or indices within that line of the page selector information provides the identification of subsequent pages to be accessed. In an alternative preferred embodiment, a more complex match “by degree” is also possible, utilizing “special state” information in the form of positive or negative numerical values which are combined with numerical values assigned to certain keywords to determine whether pre-set thresholds are exceeded. If exceeded, then there is a match and the associated page index or indices within that line of the page selector information provide the identification of subsequent pages to be accessed. The special state information, assigned keyword numerical values, and the pre-set thresholds can be part of the data or selector areas on any HVD page, and if encountered are held in the state accumulator module until it is reset at the beginning of the next inquiry. When the special state information occurs in an early cycle this causes an increased or decreased sensitivity to the occurrence of specified keywords which may be encountered in later cycles (within the same set of cycles), and provides additional flexibility in the matching process. In some embodiments, this is used to reflect cases where associations between input and results are of a probabilistic nature or in certain one-to-one associations.
In an alternative preferred embodiment, the special state information could be arranged to be “multiplicative” or “divisional” (or any other suitable mathematical process) in addition to, or rather than, being “additive” or “subtractive,” in which case the default keyword numerical value would be multiplied or divided by the “special state” numerical values before being applied to the threshold test. A single match can occur, or multiple matches can occur at the same step (cycle) of the process, where multiple matches represent the occurrence of multiple simultaneous conditions. The process continues on FIG. 6B.
Referring to FIG. 6B, at 622, the rule processor module accesses the HVD selected pages and sends the results to a vulnerability accumulator module. At 624, the rule processor module updates the state information in the state accumulator module with HVD indices of pages just accessed. At 626, a determination is made as to whether more cycles are needed to satisfy the customer's input request. In a preferred embodiment, the determination is made by the rule processor module, which decides if more cycles are needed to obtain vulnerabilities for the element currently being considered, or whether the next element (or combination of elements) needs to be considered in turn. For a given combination, the rule processor module knowing that it has not yet reached the bottom HVD page makes the determination when the cycling has occurred down to the bottom of the HVD structure, in which case the selector information contains no further possible page look-ups for that element or combination of elements. If more cycles are needed, the cycle counter is incremented by one and the process continues at 606 with additional data from the policy-based descriptive input being utilized for each new cycle. If a new element is to be considered, the cumulative cycle counter is incremented by the value of the cycle counter, then the element counter is incremented, while the cycle counter is reset to 1. If a new combination is to be considered, the cumulative cycle counter is incremented by the value of the cycle counter, then the combination counter is incremented, while the cycle counter is reset to 1. Preferably, the state is accumulated as the cycles continue, and the process ends when no further elements or combinations must be considered, or when the user provides a “no further cycles” notification. If no more cycles are needed, at 628, the rule processor module updates the EDD with customer information. Customer information can include, but is not limited to, cycle counter and/or cumulative cycle counter values, element counter value, combination counter value, system/network “checked” status and date last checked for vulnerabilities, and problem resolution data. The process ends at 630.
Example of Obtaining a Response to User Input Utilizing HVD Structure
FIG. 7 is an illustrative example of a preferred embodiment of cycling through a hierarchical vulnerability database structure 700 of a system for electronic profile and policy vulnerability and reliability assessment. In an example, a user, such as a system administrator requests help examining a policy/profile-controlled network (e.g., encompassing a set of interconnected routers, etc.) for potential security vulnerabilities. In one preferred embodiment, the user utilizes the implementation shown in FIGS. 6A and 6B. Preferably, the HVD structure 700 has been pre-provisioned with the associated vulnerability information for the type of elements included in the network (i.e., the routers, and perhaps even the specific make and model of routers). In an example, the policy/profile information, which may be stored in the EDD 210 or provided as input by the user, preferably includes the set-up configuration and all operating options defined and activated on each router and router interface in the network, as well as certain network-wide configuration information possibly including network topology and any divisions into network “zones,” etc.
Generally, a cycle begins at a top level of the HVD structure 700, with a user responding to the “start” prompt presented by the presentation module 204 at the user's processing device 102 by clicking on a “yes” icon, or other indication, which initiates the cyclical process for the initial router element under examination. Throughout the process of cycling through the HVD structure 700 more detailed information is accessed with each cycle, gradually traversing down through lower levels of the HVD structure 700 until that element has been completely examined. The next element (e.g., another router) is then examined in the same fashion. As the process proceeds, certain combinations of elements are flagged and added to the “state” information so that these combinations of routers will be examined together. The user monitors the process via intermediate results found, although the user does not need to continuously monitor the cycling process. At the completion of the process, all vulnerability results for the network and the routers comprising it (and necessary combinations of routers, etc.) are provided to the user for viewing or saving in a file.
The HVD pages shown in FIG. 7, and any keywords listed are merely illustrative examples. In a preferred embodiment, initialization begins with any state previously stored in the state accumulator module 306 being reset (i.e., erased). The user and network (or system) are identified, allowing the EDD 210 to be accessed to retrieve the pertinent records. User and/or system records can include known configuration information, for instance that some of the edge routers utilize the Border Gateway Protocol (BGP) routing method, services installed/used, such as telnet for user access, ftp for file transfer, and that are both available, level of vulnerability examination service purchased, etc. This information, or a subset of it, is preferably stored in the state accumulator module 306 for reference. The cycle counter and element counter are both reset to equal “1” which represents the first cycle for the first element.
In an example, the element initially being examined, i.e., the router, is a single element. Combinations of elements, such as combinations of routers, or router components such as various interface cards can also be examined, in later stages of the process, as is determined necessary by information obtained in earlier stages from the HVD 212 and stored in the state accumulator module 306. If desired during implementation, these combinations can be denoted using element counter numbers greater than the total number of elements in the examined system. For example, if there are 100 routers in the network, and 500 additional combinations of routers and/or router components that must be examined, then those combinations can be identified as element counter values 101 through 601 while the routers themselves are denoted using values 1 through 100. Alternately, a separate combination counter can be added to directly indicate the sequential number of the combination being considered (with value initially set to 1).
In an example, HVD page 702 is the top page of the HVD structure 700 with a page with Index=1 and is the “current” page. The current page is preferably arranged to list a number of high level conditions, which ultimately, by deeper access into the HDV structure 700, may lead to identified vulnerabilities. In an illustrative example, one of these conditions is “IP (Internet Protocol) Interfaces.” The rule processor module 304 matches this condition with policy information for the router under examination since the policy information indicates several IP interfaces are present and active. Preferably, if any extraneous input is provided in the policy/profile input for that router, the input parser/filter module 308 removes the extraneous information from consideration. Associated with this matched condition is the keyword “IP_int_present_active.” The rule processor module 304 looks in the selector section 708 of the current page 702 and sees that “IP_int_present_active Index 6, 8, 24” is present as one of the lines of selector information, indicating that pages 6, 8, and 24 should be accessed. The cycle counter is incremented to “2.” Note that in this step, there is only one current page.
HVD pages 6, 8, and 24 (710, 712 and 714, respectively) are accessed. Data section portions of each page 710, 712 and 714 are provided to the vulnerability accumulator module 302. The vulnerability accumulator module 302 stores the information and provides the included prompt-related information and the informative text and graphics to the user via the presentation module 204. The user may choose to view the intermediate results, and can also respond to a prompt to “stop” or “re-start” the cycling process. Pages 6, 8, and 24 (710, 712 and 714) become the “current” pages. Upon reviewing the current pages 710, 712 and 714, the rule processor module 304 cannot find any matches between the policy/profile input for the current router on the information contained on pages 6 and 8 (710, 712), but one match occurs regarding page 24 (714), which indicates that the current router is an edge router. In other examples where multiple pages are reviewed, the rule processor module 304 may find pertinent information and/or prompts from all or some subset of the current pages. The associated keyword is “IP_edge.” This keyword utilized by the rule processor module 304 is located in the selector section 720 of page 24 (714) on the same line as index 20366, such that it determines that page 20366 should be accessed to obtain information about particular vulnerabilities possible with IP edge routers. Indices 6, 8, and 24 are stored as “state” in the state accumulator module 306. The cycle counter is again incremented and now it equals “3”.
HVD page 20366 (722) is accessed and its data section 723 portion of the page 722 is provided by the rule processor module 304 to the vulnerability accumulator module 304. In a preferred embodiment, the presentation module 204 provides the intermediate results including informative text and graphics to the user's processing device 102 for optional monitoring. The rule processor module 304 retains the matching field of the selector section 721, which needs to be tested for matching with the policy/profile input. One potential match addresses whether or not the IP interface exposes its IP address and utilizes packet filtering to ensure security, which in some embodiments is similar to the functionality of an electronic firewall. Another potential match addresses non-packet-filtered cases with exposed IP address, or other related cases such as the filtering functionality being present but being disabled. If such information is already in the configuration records retrieved from the EDD 210 during the first cycle and thus available in the state accumulator module 306, then some of these tests for matching may not need to be undertaken or may be undertaken to verify rather than obtain additional information. In this example, no packet filtering is active and the IP address is exposed. Therefore, the second case (i.e., IP address is exposed case) is matched by the rule processor module 304. This case has the keyword “IP_exposed_filtering_none,” enabling the rule processor module 304 to find (on the same line in the selector section 721) index references to pages 1109237 and 1210077. Index 20366 is added to the state stored along with the previously stored information in the state accumulator module 306. The cycle counter is incremented to “4.”
In this illustrative example, the rule processor module 304 only had to search the selector section 721 in one current page 722. Other examples may involve searching selector sections in more than one current page.
Pages 1109237 (724) and 1210077 (726) are accessed. Page 1109237 (724) contains information on potential vulnerabilities associated with a variant of IP technology called “MPLS” (Multiprotocol Label Switching). Page 1210077 (726) contains potential matches covering cases where the customer of the network provider connected at this edge router is either trusted (e.g., an affiliate or close partner of the network provider) or an unrelated customer (e.g., a regular customer which cannot be trusted as much as a close affiliate). In this example MPLS is used, and the customer is unrelated to the provider, leading to matches with the keywords “IP_mpls” (not shown) from page 724 and “Customer_untrusted” (not shown) from page 726. The rule processor module 304 accesses the indexes of the two pages 724, 726 and finds one line including “Index 45762979” and the other including “Index 45763016.” Indices 1109237 and 1210077 are added to the state of the state accumulator module 306. The cycle counter is incremented to “5.”
In this example, the rule processor module 304 searched selector sections in two current pages for keyword matches, and has found matches in both. In other examples, matches might be found in only one of a number of current pages. In other embodiments, a match might not be found at all, which would cause a default match to occur via the last line of each selector section, which would be a “return to higher level” entry. When this occurs, the rule processor module 304 is preferably provided with an Index such that the process returns to a point where the user is informed of the problem and prompted for optional additional input that subsequently would allow the process to continue. In still other examples, a “return to higher level” occurs repeatedly (because of repeated lack of matches) until the user returns to the top page, which by default preferably includes an “exit” option which causes the system to return to a start-up condition. In another preferred embodiment, every page may include an “exit” option as the second to last entry in the selector section, so that the user has an exit option at each page.
Pages 45762979 (728) and 45763016 (730) are accessed and their information is presented to the user. In an example, page 45762979 (728) provides indications that MPLS is vulnerable to exploitation when IP addresses are exposed on unprotected interfaces along with further explanatory information and suggestions regarding modifications to the policy/profile, which could alleviate the potential vulnerability. Pages 728 and 730 may include information that thanks the customer for using the service and prompts the customer to determine whether they wish to quit or re-start another search. In one preferred embodiment, the process continues automatically until final completion. Page 45763016 (730) provides indications that non-affiliated customers should not be provided with IP addresses of edge routers. Page 730 may also include information regarding several preferred alternatives, which can be incorporated into the policy/profile information. In this example, the user does not quit the cycling process and the cycle counter is incremented to “6.”
In one embodiment, cycling continues for each subsequent element and element combination. Preferably, an element counter (not shown) is incremented for each subsequent element. The cycle counter is reset for each new element and then incremented for each new cycle involving that element. In a preferred embodiment, the potential vulnerability information is accumulated in the vulnerability accumulator module 302.
Preferably, the EDD 210 contains the number and type of elements (e.g., routers) of the particular policy/profile-controlled system under examination. For example, the policy/profile information may contain information needed to set-up, provision, configure, control, and manage the system and its components.
In a preferred embodiment, as the examination process is undertaken for the elements of the system, i.e. the routers, cases will be identified and stored in the state accumulator module 306 for combinations of elements (i.e., sets of routers and router components) to be examined together in order for certain potential vulnerabilities to be uncovered which depend on or relate to interactions between the items in a particular combination. For example conditions identified in an earlier cycle may cause combinations to be selected and retained by the rule processor module 304 for evaluation in a later cycle. By way of example, any subset of routers participating together in a particular routing protocol may be divided into combinations of nearest-neighbors so that their configurations can be tested to be consistent with that necessary to avoid security vulnerabilities. Another example of a combination includes routers using cryptographic authentication to identify each other's routing updates, in which case the configurations would be tested in combination to ensure that the authentication set-up matches properly and that no options are configured which would circumvent security.
At the completion of the cycles for elements and element combinations, the cycling process terminates and the resulting vulnerabilities are presented to the user. In a preferred embodiment, the system returns to a start-up state, in which it is ready to begin another cycle. Preferably, accumulated vulnerability results are saved to the EDD 210 for this user. In another preferred embodiment, information saved to the EDD 210 includes associated information of any sort, which may be helpful for record keeping, billing, or future inquiries, among others. In another preferred embodiment, this information may include the number of levels or pages accessed, the element counter value (or alternately the values of the element and combination counters) and the cumulative cycle count, which indicates the number of elements or element combinations examined and the amount of time transpired, among others.
In an alternative preferred embodiment where the user quits the system, the accumulated state could be erased from the state accumulator module 306 rather than left intact to be erased at the next initialization occurrence. If the user chose not to quit, the system returns to initialization step. The user's records remain available and thus do not have to be pulled from the EDD 210. In this example, pages 45762979 (728) and 45763016 (730) are both “bottom” pages, in that they include no selector section information other than the “return to higher level” and/or “quit” entries, i.e. they contain no other lines of keywords with associated index values (other than these last two default lines for “return” and “quit”). Thus pages 728, 730 include null selectors, and cannot be utilized to delve to any deeper level of the HVD structure 700 since no deeper level of the HVD structure 700 exists for this example inquiry.
In an alternative preferred embodiment, the information saved in the EDD 210 is saved at the conclusion of a previous step rather than at the inquiry conclusion. Interim saving of information is useful to, for example, improve operating efficiency, performance, or reliability when a user performs multiple back-to-back inquiries. In addition, interim saving of information is particularly helpful in the event of an unexpected malfunction or power loss.
It should be emphasized that the above-described embodiments of the present invention, particularly, any “preferred” embodiments, are merely possible examples of implementations, merely set forth for a clear understanding of the principles of the invention. Many variations and modifications may be made to the above-described embodiment(s) of the invention without departing substantially from the spirit and principles of the invention. All such modifications and variations are intended to be included herein within the scope of this disclosure and the present invention and protected by the following claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4888771||Jun 23, 1988||Dec 19, 1989||International Business Machines Corporation||Diagnostic configuration management for a data processing system|
|US4967337||Oct 11, 1988||Oct 30, 1990||Texas Instruments Incorporated||Automated diagnostic system|
|US4985857||Aug 19, 1988||Jan 15, 1991||General Motors Corporation||Method and apparatus for diagnosing machines|
|US5117353||May 5, 1989||May 26, 1992||Staff-Plus, Inc.||System for use in a temporary help business|
|US5224206||Apr 13, 1992||Jun 29, 1993||Digital Equipment Corporation||System and method for retrieving justifiably relevant cases from a case library|
|US5243689||Jun 11, 1991||Sep 7, 1993||Hitachi, Ltd.||Case-based inference processing method|
|US5267351||Dec 22, 1989||Nov 30, 1993||Avid Technology, Inc.||Media storage and retrieval system|
|US5388259||May 15, 1992||Feb 7, 1995||Bell Communications Research, Inc.||System for accessing a database with an iterated fuzzy query notified by retrieval response|
|US5408412||Apr 9, 1992||Apr 18, 1995||United Technologies Corporation||Engine fault diagnostic system|
|US5444823||Oct 18, 1994||Aug 22, 1995||Compaq Computer Corporation||Intelligent search engine for associated on-line documentation having questionless case-based knowledge base|
|US5491791||Jan 13, 1995||Feb 13, 1996||International Business Machines Corporation||System and method for remote workstation monitoring within a distributed computing environment|
|US5586252||May 24, 1994||Dec 17, 1996||International Business Machines Corporation||Computer network|
|US5596712||Jul 8, 1992||Jan 21, 1997||Hitachi, Ltd.||Method and system for diagnosis and analysis of products troubles|
|US5640403||Sep 28, 1995||Jun 17, 1997||Nec Corporation||Fault diagnosis method for a sequential circuit|
|US5668944||Sep 6, 1994||Sep 16, 1997||International Business Machines Corporation||Method and system for providing performance diagnosis of a computer system|
|US5696701||Jul 12, 1996||Dec 9, 1997||Electronic Data Systems Corporation||Method and system for monitoring the performance of computers in computer networks using modular extensions|
|US5704036||Jun 28, 1996||Dec 30, 1997||Mci Communications Corporation||Method in a network management layer|
|US5715374||Jun 29, 1994||Feb 3, 1998||Microsoft Corporation||Method and system for case-based reasoning utilizing a belief network|
|US5717835||Jan 11, 1995||Feb 10, 1998||International Business Machines Corporation||Simple approach to case-based reasoning for data navigation tasks|
|US5794237||Nov 3, 1997||Aug 11, 1998||International Business Machines Corporation||System and method for improving problem source identification in computer systems employing relevance feedback and statistical source ranking|
|US5822743||Apr 8, 1997||Oct 13, 1998||1215627 Ontario Inc.||Knowledge-based information retrieval system|
|US5862325||Sep 27, 1996||Jan 19, 1999||Intermind Corporation||Computer-based communication system and method using metadata defining a control structure|
|US5944839||Mar 19, 1997||Aug 31, 1999||Symantec Corporation||System and method for automatically maintaining a computer system|
|US5951611||Nov 18, 1996||Sep 14, 1999||General Electric Company||For analyzing engine trend data for aircraft engines|
|US5968195||Aug 4, 1997||Oct 19, 1999||Nec Corporation||Estimation of failure section region with small simulation calculation quantity|
|US5977964||Jan 5, 1998||Nov 2, 1999||Intel Corporation||Method and apparatus for automatically configuring a system based on a user's monitored system interaction and preferred system access times|
|US6006016||Oct 18, 1996||Dec 21, 1999||Bay Networks, Inc.||Network fault correlation|
|US6026388||Aug 14, 1996||Feb 15, 2000||Textwise, Llc||User interface and other enhancements for natural language information retrieval system and method|
|US6026393||Mar 31, 1998||Feb 15, 2000||Casebank Technologies Inc.||Configuration knowledge as an aid to case retrieval|
|US6052809||Oct 16, 1997||Apr 18, 2000||Teradyne, Inc.||Method for generating test patterns|
|US6073170||Nov 14, 1997||Jun 6, 2000||Kabushiki Kaisha Toshiba||Information filtering device and information filtering method|
|US6098061||Mar 13, 1997||Aug 1, 2000||Kabushiki Kaisha Toshiba||Computer system for interactive help using human-understandable knowledge and computer-understandable knowledge|
|US6125458||Nov 12, 1997||Sep 26, 2000||British Telecommunications||Fault management system for a telecommunications network|
|US6128753||Nov 13, 1996||Oct 3, 2000||British Telecommunications Public Limited Company||Fault management system for a telecommunications network|
|US6131085||Aug 28, 1996||Oct 10, 2000||Rossides; Michael T||Answer collection and retrieval system governed by a pay-off meter|
|US6189114||Jun 26, 1998||Feb 13, 2001||International Business Machines Corporation||Data processing system diagnostics|
|US6195773||Jul 14, 1998||Feb 27, 2001||Nec Corporation||LSI defective automatic analysis system and analyzing method therefor|
|US6236989||Dec 11, 1998||May 22, 2001||International Business Machines Corporation||Network-based help architecture|
|US6237114||May 13, 1998||May 22, 2001||Sun Microsystems, Inc.||System and method for evaluating monitored computer systems|
|US6249784||May 19, 1999||Jun 19, 2001||Nanogen, Inc.||System and method for searching and processing databases comprising named annotated text strings|
|US6266774||Dec 8, 1998||Jul 24, 2001||Mcafee.Com Corporation||Method and system for securing, managing or optimizing a personal computer|
|US6321192||Oct 22, 1998||Nov 20, 2001||International Business Machines Corporation||Adaptive learning method and system that matches keywords using a parsed keyword data structure having a hash index based on an unicode value|
|US6326962||Jul 13, 1999||Dec 4, 2001||Doubleagent Llc||Graphic user interface for database system|
|US6327677||Apr 27, 1998||Dec 4, 2001||Proactive Networks||Method and apparatus for monitoring a network environment|
|US6357017||Sep 15, 2000||Mar 12, 2002||Motive Communications, Inc.||Method, system and computer program product for iterative distributed problem solving|
|US6415395||Apr 2, 1999||Jul 2, 2002||General Electric Company||Method and system for processing repair data and fault log data to facilitate diagnostics|
|US6430558||Aug 2, 1999||Aug 6, 2002||Zen Tech, Inc.||Apparatus and methods for collaboratively searching knowledge databases|
|US6539387||Jul 7, 1997||Mar 25, 2003||Avraham Oren||Structured focused hypertext data structure|
|US6571236||Jan 10, 2000||May 27, 2003||General Electric Company||Method and apparatus for problem diagnosis and solution|
|US6587847||Aug 24, 1999||Jul 1, 2003||Stream International, Inc.||Method and system for monitoring knowledge use|
|US6643801||Jan 26, 2000||Nov 4, 2003||General Electric Company||Method and system for estimating time of occurrence of machine-disabling failures|
|US6708291||May 20, 2000||Mar 16, 2004||Equipe Communications Corporation||Hierarchical fault descriptors in computer systems|
|US6738780||May 16, 2001||May 18, 2004||Nec Laboratories America, Inc.||Autonomous citation indexing and literature browsing using citation context|
|US6738933||Oct 19, 2001||May 18, 2004||Mercury Interactive Corporation||Root cause analysis of server system performance degradations|
|US6754885||Nov 23, 1999||Jun 22, 2004||Invensys Systems, Inc.||Methods and apparatus for controlling object appearance in a process control configuration system|
|US6772375||Dec 22, 2000||Aug 3, 2004||Network Appliance, Inc.||Auto-detection of limiting factors in a TCP connection|
|US6795935||Jul 20, 2000||Sep 21, 2004||General Electric Company||Diagnosis of faults in a complex system|
|US6820082||Apr 3, 2000||Nov 16, 2004||Allegis Corporation||Rule based database security system and method|
|US6862710||Mar 22, 2000||Mar 1, 2005||Insightful Corporation||Internet navigation using soft hyperlinks|
|US6883120||Dec 3, 1999||Apr 19, 2005||Network Appliance, Inc.||Computer assisted automatic error detection and diagnosis of file servers|
|US6907545||Mar 2, 2001||Jun 14, 2005||Pitney Bowes Inc.||System and method for recognizing faults in machines|
|US6909994||Nov 25, 2002||Jun 21, 2005||General Electric Company||Method, system and computer product for performing failure mode and effects analysis throughout the product life cycle|
|US7013411||Jul 29, 2002||Mar 14, 2006||Abb Research Ltd.||Method for the automated generation of a fault tree structure|
|US7058822||May 17, 2001||Jun 6, 2006||Finjan Software, Ltd.||Malicious mobile code runtime monitoring system and methods|
|US7058861||Dec 31, 2002||Jun 6, 2006||Sprint Communications Company Llp||Network model audit and reconciliation using state analysis|
|US7076695||Jul 18, 2002||Jul 11, 2006||Opnet Technologies, Inc.||System and methods for adaptive threshold determination for performance metrics|
|US7080000||Jul 23, 2001||Jul 18, 2006||Mcafee, Inc.||Method and system for bi-directional updating of antivirus database|
|US7120559||Jun 29, 2004||Oct 10, 2006||Sun Microsystems, Inc.||System and method for performing automated system management|
|US7133866||Oct 2, 2002||Nov 7, 2006||Hewlett-Packard Development Company, L.P.||Method and apparatus for matching customer symptoms with a database of content solutions|
|US7155641||May 15, 2003||Dec 26, 2006||Microsoft Corporation||System and method for monitoring the performance of a server|
|US7237266||Jun 30, 2003||Jun 26, 2007||At&T Intellectual Property, Inc.||Electronic vulnerability and reliability assessment|
|US7246265||Mar 24, 2004||Jul 17, 2007||Abb Research Ltd||Method and system for automatically verifying fault hypotheses predetermined by a user|
|US7249058||Apr 10, 2002||Jul 24, 2007||International Business Machines Corporation||Method of promoting strategic documents by bias ranking of search results|
|US7257514||Apr 6, 2005||Aug 14, 2007||Hewlett-Packard Development Company, L.P.||Computer support service with solution function updates as a function of pre-delivery expert changes to automatically generated solutions|
|US7257744||Mar 16, 2004||Aug 14, 2007||Tyco Telecommunications (Us) Inc.||System and method for fault diagnosis using distributed alarm correlation|
|US7284162||Jul 26, 2004||Oct 16, 2007||Alcatel||Agent based router monitoring, diagnostic and maintenance|
|US20020078403||Jan 18, 2001||Jun 20, 2002||Gullo Louis J.||Reliability assessment and prediction system and method for implementing the same|
|US20020083371||Dec 27, 2000||Jun 27, 2002||Srinivas Ramanathan||Root-cause approach to problem diagnosis in data networks|
|US20020087408||Dec 21, 2001||Jul 4, 2002||Burnett Jonathan Robert||System for providing information to intending consumers|
|US20020091671||Nov 20, 2001||Jul 11, 2002||Andreas Prokoph||Method and system for data retrieval in large collections of data|
|US20020166082||Mar 2, 2001||Nov 7, 2002||Ramadei Michael J.||System and method for recognizing faults in machines|
|US20020169771||May 9, 2001||Nov 14, 2002||Melmon Kenneth L.||System & method for facilitating knowledge management|
|US20020180795||May 30, 2001||Dec 5, 2002||International Business Machines Corporation||Method, system, and program for generating a progress indicator|
|US20030065986||Oct 19, 2001||Apr 3, 2003||Fraenkel Noam A.||Root cause analysis of server system performance degradations|
|US20030233438 *||Oct 4, 2002||Dec 18, 2003||Robin Hutchinson||Methods and systems for managing assets|
|US20040073855||Mar 14, 2002||Apr 15, 2004||Richard Maxwell||Fault management system for a communications network|
|US20040103309||Nov 27, 2002||May 27, 2004||Tracy Richard P.||Enhanced system, method and medium for certifying and accrediting requirements compliance utilizing threat vulnerability feed|
|US20040107405||Oct 9, 2001||Jun 3, 2004||Sun Microsystems, Inc.||Method, system, and program for managing accesses to data objects by multiple user programs over a network|
|US20040193907||Mar 28, 2003||Sep 30, 2004||Joseph Patanella||Methods and systems for assessing and advising on electronic compliance|
|US20040225927||Apr 22, 2003||Nov 11, 2004||Bmc Software, Inc.||Two-phase root cause analysis|
|US20040250122||May 9, 2003||Dec 9, 2004||Chris Newton||Network intelligence system|
|US20040267750||Jun 30, 2003||Dec 30, 2004||Aaron Jeffrey A.||Automatically facilitated support for complex electronic services|
|US20050015667||Jun 30, 2003||Jan 20, 2005||Aaron Jeffrey A.||Automated diagnosis for electronic systems|
|US20050038697||Jun 30, 2003||Feb 17, 2005||Aaron Jeffrey A.||Automatically facilitated marketing and provision of electronic services|
|US20050210331||Mar 19, 2004||Sep 22, 2005||Connelly Jon C||Method and apparatus for automating the root cause analysis of system failures|
|US20060248389||Apr 29, 2005||Nov 2, 2006||Microsoft Corporation||Method and apparatus for performing network diagnostics|
|US20070038899||Jul 18, 2006||Feb 15, 2007||O'brien Michael||Method for managing faults in a computer system environment|
|US20070100892||Oct 28, 2005||May 3, 2007||Bank Of America Corporation||System and Method for Managing the Configuration of Resources in an Enterprise|
|US20070271304||May 19, 2006||Nov 22, 2007||Inmage Systems, Inc.||Method and system of tiered quiescing|
|US20080288821||Jun 16, 2008||Nov 20, 2008||Aaron Jeffrey A||Automated Diagnosis for Electronic Systems|
|1||Notice of Allowance and Allowability dated Apr. 5, 2007 in U.S. Appl. No. 10/611,637.|
|2||U.S. Notice of Allowance / Allowability dated Apr. 17, 2008 in U.S. Appl. No. 10/611,634.|
|3||U.S. Notice of Allowance / Allowability dated Jan. 8, 2008 in U.S. Appl. No. 10/611,634.|
|4||U.S. Official Action dated Aug. 19, 2009 in U.S. Appl. No. 10/611,630.|
|5||U.S. Official Action dated Aug. 24, 2006 in U.S. Appl. No. 10/611,637.|
|6||U.S. Official Action dated Dec. 15, 2005 in U.S. Appl. No. 10/611,630.|
|7||U.S. Official Action dated Dec. 21, 2005 in U.S. Appl. No. 10/611,637.|
|8||U.S. Official Action dated Dec. 29, 2005 in U.S. Appl. No. 10/610,807.|
|9||U.S. Official Action dated Dec. 5, 2006 in U.S. Appl. No. 10/611,630.|
|10||U.S. Official Action dated Jan. 25, 2010 in U.S. Appl. No. 10/611,630.|
|11||U.S. Official Action dated Jan. 28, 2009 in U.S. Appl. No. 10/611,630.|
|12||U.S. Official Action dated Jun. 1, 2006 in U.S. Appl. No. 10/611,630.|
|13||U.S. Official Action dated Jun. 19, 2006 in U.S. Appl. No. 10/610,807.|
|14||U.S. Official Action dated Mar. 29, 2006 in U.S. Appl. No. 10/611,634.|
|15||U.S. Official Action dated Mar. 29, 2006 in U.S. Appl. No. 10/611,637.|
|16||U.S. Official Action dated Mar. 29, 2007 in U.S. Appl. No. 10/611,634.|
|17||U.S. Official Action dated Mar. 9, 2010 in U.S. Appl. No. 12/139,749.|
|18||U.S. Official Action dated May 17, 2007 in U.S. Appl. No. 10/611,630.|
|19||U.S. Official Action dated May 21, 2007 in U.S. Appl. No. 10/610,807.|
|20||U.S. Official Action dated Nov. 21, 2006 in U.S. Appl. No. 10/610,807.|
|21||U.S. Official Action dated Oct. 1, 2009 in U.S. Appl. No. 12/139,749.|
|22||U.S. Official Action dated Oct. 3, 2007 in U.S. Appl. No. 10/611,630.|
|23||U.S. Official Action dated Sep. 10, 2007 in U.S. Appl. No. 10/611,634.|
|24||U.S. Official Action dated Sep. 20, 2006 in U.S. Appl. No. 10/611,634.|
|25||U.S. Supplemental Notice of Allowance / Allowability dated Apr. 22, 2008 in U.S. Appl. No. 10/611,634.|
|26||Website Article entitled, "A New Architecture for Managing Enterprise Log Data," by Adam Sah of Addamark Technologies, Inc., dated May 24, 2006. Presented at the LISA 2002: Sixteenth Systems Administration Conference, Berkeley, California: USENIX Association, 2002. pp. 1-8, and 17-26; (blank pages removed).|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8621628 *||Feb 25, 2010||Dec 31, 2013||Microsoft Corporation||Protecting user mode processes from improper tampering or termination|
|US8635596 *||Apr 21, 2006||Jan 21, 2014||Microsoft Corporation||Model-based event processing|
|US20070250525 *||Apr 21, 2006||Oct 25, 2007||Microsoft Corporation||Model-Based Event Processing|
|US20110209219 *||Feb 25, 2010||Aug 25, 2011||Microsoft Corporation||Protecting User Mode Processes From Improper Tampering or Termination|
| || |
|U.S. Classification||726/25, 713/166, 726/2, 726/1, 713/167, 713/165|
|International Classification||H04L29/00, G06F21/00, G06F17/30, G06F17/00, H04L29/06|
|Cooperative Classification||Y10S707/99943, G06F21/577, H04L63/0227|
|European Classification||G06F21/57C, H04L63/02B|
|Jul 29, 2014||FP||Expired due to failure to pay maintenance fee|
Effective date: 20140608
|Jun 8, 2014||LAPS||Lapse for failure to pay maintenance fees|
|Jan 17, 2014||REMI||Maintenance fee reminder mailed|
|Jun 18, 2013||AS||Assignment|
Owner name: INTELLECTUAL VENTURES II LLC, DELAWARE
Free format text: MERGER;ASSIGNOR:WORCESTER TECHNOLOGIES LLC;REEL/FRAME:030638/0027
Effective date: 20130523
|Nov 17, 2011||AS||Assignment|
Effective date: 20070427
Free format text: CORRECTION TO THE RECORDATION COVER SHEET OF THE CHANGE OF NAME RECORDED AT 019479/0520 ON 06/26/2007;ASSIGNOR:BELLSOUTH INTELLECTUAL PROPERTY CORPORATION;REEL/FRAME:027244/0160
Owner name: AT&T INTELLECTUAL PROPERTY, INC., DELAWARE
|Nov 16, 2011||AS||Assignment|
Owner name: AT&T BLS INTELLECTUAL PROPERTY, INC., DELAWARE
Effective date: 20070725
Free format text: CHANGE OF NAME;ASSIGNOR:AT&T INTELLECTUAL PROPERTY, INC.;REEL/FRAME:027242/0076
Effective date: 20071030
Owner name: AT&T DELAWARE INTELLECTUAL PROPERTY, INC., DELAWAR
Free format text: CHANGE OF NAME;ASSIGNOR:AT&T BLS INTELLECTUAL PROPERTY, INC.;REEL/FRAME:027242/0089
Owner name: WORCESTER TECHNOLOGIES LLC, DELAWARE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AT&T INTELLECTUAL PROPERTY I, LP;REEL/FRAME:027241/0681
Effective date: 20110923
|Aug 25, 2011||AS||Assignment|
Effective date: 20110815
Free format text: NUNC PRO TUNC ASSIGNMENT;ASSIGNOR:AT&T DELAWARE INTELLECTUAL PROPERTY, INC.;REEL/FRAME:026810/0547
Owner name: AT&T INTELLECTUAL PROPERTY I, L.P., GEORGIA
|Mar 22, 2011||CC||Certificate of correction|
|Jun 26, 2007||AS||Assignment|
Owner name: AT&T INTELLECTUAL PROPERTY, INC., DELAWARE
Free format text: CHANGE OF NAME;ASSIGNOR:BELLSOUTH INTELLECTUAL PROPERTY CORPORATION;REEL/FRAME:019479/0520
Effective date: 20070427
Owner name: AT&T INTELLECTUAL PROPERTY, INC., DELAWARE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AARON, JEFFREY A.;REEL/FRAME:019479/0414
Effective date: 20030801
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AARON, JEFFREY A.;REEL/FRAME:19479/414
Owner name: AT&T INTELLECTUAL PROPERTY, INC.,DELAWARE
Owner name: AT&T INTELLECTUAL PROPERTY, INC.,DELAWARE
Free format text: CHANGE OF NAME;ASSIGNOR:BELLSOUTH INTELLECTUAL PROPERTY CORPORATION;REEL/FRAME:19479/520