Communications interface employing unique tags which enable a destination to decode a received message structure

• US 5,434,978 A
• Filed: 02/18/1994
• Issued: 07/18/1995
• Est. Priority Date: 02/18/1994
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Kleewein, James C., Farber, Joel F., Dockter, Michael J., Seppi, Kevin D., Tolleson, David W.
• Primary Examiner(s): Harrell, Robert B.
• Application Number:
  US08/198,843
• Time in Patent Office: 515 Days
• Field of Search: 395/200, 395/500, 364/514, 364/DIG. 1, 364/DIG. 2, 370/85.13
• US Class Current: 709/230
• CPC Class Codes: G06F 13/4022 using switching circuits, e.g. switching matrix, connection or expansion network G06F13/4009 takes precedence

Abstract

A system employs communication messages in accordance with a determined protocol and includes a source node for producing messages in accordance with the protocol. Each message comprises at least a first level message structure with a unique tag value that identifies a class of message structures to which the first level message structure belongs. The unique tag value enables identification of a grammar template procedure that allows analysis of the first level message structure. A destination node receives the first level message structure and includes circuitry for determining the unique tag value. A memory in the destination node stores at addresses indicated by unique tag values, grammar template procedures for each class of first level message structures. A processor at the destination node is responsive to a detected unique tag value to access a grammar template procedure at an address in the memory determined from a received unique tag value and to analyze the first level message structure in accordance with the accessed grammar template procedure. The system also employs a second level message structure which includes a further unique tag value and comprises an assembly of groups of first level message structures.

Claims

1. A system employing communication messages in accord with a determined protocol that includes plural classes of first level message structures, each class having a unique syntax, all first level message structures of a class evidencing an identical syntax, each class identified by a unique tag value, said protocol further including a second level message structure comprising a group of said first level message structures, said second level message structure including a further unique tag value, said system comprising:

plural source means for producing messages in accord with said protocol, each message comprising at least a first level message structure with a unique tag value that identifies a class of first level message structures to which said first level message structure belongs and further enables identification of one of a plurality of grammar template procedures that uniquely will allow analysis of a class of first level message structures to which said first level message structure belongs; and

plural destination means for receiving first and second level message structures from said plural source means, each destination means including means for detecting unique tag values received with said first and second level message structures, memory means for storing at addresses indicated by unique tag values and further unique tag values, plural grammar template procedures for said classes of first level message structures and second level message structures, and processor means, a processor means receiving a first level message structure with a unique tag value or a second level message structure with a further unique tag value responsive to said unique tag value to access a grammar template procedure at an address in said memory determined therefrom, and to analyze said received message structure bearing said unique tag value in accord with said grammar template procedure.

2. The system as recited in claim 1 wherein said first level message structure is a "sentence" having a predefined number of fields, each field having a variable length so as to enable storage of data of variable value magnitudes, a first field in a sentence including a said unique tag value, and a last field in a sentence including a sentence termination indication.

3. A system as recited in claim 2 wherein said second level message structure is a "paragraph", a paragraph commencing with a first sentence with a unique tag value which defines a class for said paragraph and enables said destination memory to access a grammar template therefrom.

4. A system as recited in claim 3 wherein said first sentence includes a unique tag value which identifies said sentence as "begin list" sentence, said paragraph including plural additional sentences which comprise said list, a last sentence of a said paragraph including a unique tag value which identifies said sentence as an "end list" sentence.

5. The system as recited in claim 1, wherein each unique tag value includes a unique numerical value that is never encountered by said system except for identical class message structures, each class message structure requiring use by said processor means of an identical grammar template procedure to enable analysis of said class of message structure.

6. The system as recited in claim 1 wherein any modification to a class of message structure which requires a modified grammar template procedure is assigned a new unique tag value, said memory means in said destination means storing said modified grammar template procedure at an address corresponding to said new unique tag value.