Unified message parser apparatus and system for real-time event correlation

• US 6,732,153 B1
• Filed: 05/23/2000
• Issued: 05/04/2004
• Est. Priority Date: 05/23/2000
• Status: Expired due to Fees

• Current Assignee: Verizon Laboratories Incorporated (Verizon Communications Inc.)
• Original Assignee: Verizon Laboratories Incorporated (Verizon Communications Inc.)
• Inventors: Weissman, Mark, Jakobson, Gabriel
• Primary Examiner(s): Harvey, Jack B.
• Assistant Examiner(s): VU, THONG H
• Application Number:
  US09/576,296
• Time in Patent Office: 1,442 Days
• Field of Search: 709/226, 709/227, 709/246, 709/206, 709/106, 709/102, 709/207, 709/230, 709/251, 703/22, 705/8, 370/236, 714/724, 717/136, 379/88
• US Class Current: 709/206
• CPC Class Codes: H04L 41/0233 Object-oriented techniques, for representation of network management data, e.g. common object request broker architecture [CORBA]
• CPC Class Codes: H04L 41/064 involving time analysis
• CPC Class Codes: H04L 41/22 comprising specially adapted graphical user interfaces [GUI]
• CPC Class Codes: H04L 67/56 Provisioning of proxy services store-and-forward switching systems in data switching networks H04L12/54
• CPC Class Codes: H04L 67/565 Conversion or adaptation of application format or content adding application control or application functional data H04L67/561

Abstract

Systems and methods consistent with the present invention perform message parsing in a distributed component-based network management system using a parsing knowledge structure called a Message Class Grammar (MCG) containing the set of all potential pre-calculated parsing sequences for an active network element. The MCG may be customized to the messages of different active network elements. A universal parsing procedure (UPP) may be used to traverse the hierarchy structure of the MCG. Tracing the MCG hierarchy from the root node along class-subclass arcs until a terminal node is reached determines the parsing sequence for a particular message. The MCG may be developed with a text editor or with a graphical user interface that enables a non-programmer to edit the parser structure.

Claims

1. A system for parsing network messages, comprising:

a parser knowledge structure on a computer readable medium comprising a hierarchal graph of message classes, wherein each message class parses a portion of the message; and

a universal parsing procedure means for driving the parser knowledge structure including means for receiving a remaining portion of the message being parsed from a higher level message class if message class parsing the portion of the message is not the root node, or retrieving and the message from the notification service if the message class performing the method is the root node.

2. A system according to claim 1, wherein the hierarchal graph of message classes further includes at least one terminal node, and the universal parsing procedure means comprises instructions on how to traverse the hierarchy of message classes from the root node to the terminal node, wherein the message is completely parsed after reaching the terminal node.

3. A system according to claim 1, further comprising:

a developer for building the parser knowledge structure;

a message validating component for validating the accuracy of the built parser knowledge structure; and

a repository for storing at least one validated parser knowledge structure.

4. A system according to claim 3, wherein the developer is a graphical user interface structured to enable a non-programmer to develop the parser knowledge structure.

5. A system according to claim 4, wherein the graphical user interface comprises multiple, linked screens.

6. A system according to claim 3, wherein the developer is a text editor.

7. A system according to claim 1, wherein each message class of the parser knowledge structure comprises:

a pattern string to compare to the message;

an instruction on how to parse a portion of the message corresponding to the pattern string if the pattern string matches the message; and

a means for specifying a location for storing a portion of the message remaining to be parsed.

8. A method for parsing messages in a distributed component network management system with a parser knowledge structure comprising a hierarchal graph of message classes having a root node and at least one terminal node, wherein each message class parses a portion of the message, the method performed by each message class, comprising:

retrieving a message;

determining whether a pattern string of a message class matches the message;

parsing a portion of the message corresponding to the pattern string if the pattern string matches the message; and

saving a remaining portion of the message to be parsed in a predetermined location;

wherein the step of retrieving a message comprises retrieving a remaining portion of the message to be parsed from a higher level message class if the message class performing the method is not the root node, or retrieving the message from the distributed-component network management system if the message class performing the method is the root node.

9. A method as recited in claim 8 wherein the parsing comprises:

traversing the parser knowledge structure comprising the hierarchal graph of message classes from the root node to the terminal node, wherein each message class parses a portion of the message and the message is completely parsed when the terminal node is reached; and

providing the parsed message to the distributed-component network management system.

10. A method according to claim 9, further comprising:

accessing a parser structure from a repository.