EP0327058A2 - Kodier/Dekodier-System für einen Protokolldatenblock - Google Patents

Kodier/Dekodier-System für einen Protokolldatenblock Download PDF

Info

Publication number
EP0327058A2
EP0327058A2 EP89101718A EP89101718A EP0327058A2 EP 0327058 A2 EP0327058 A2 EP 0327058A2 EP 89101718 A EP89101718 A EP 89101718A EP 89101718 A EP89101718 A EP 89101718A EP 0327058 A2 EP0327058 A2 EP 0327058A2
Authority
EP
European Patent Office
Prior art keywords
protocol data
data unit
ast
node
traversing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP89101718A
Other languages
English (en)
French (fr)
Other versions
EP0327058A3 (de
Inventor
Akihiro Anezaki
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Publication of EP0327058A2 publication Critical patent/EP0327058A2/de
Publication of EP0327058A3 publication Critical patent/EP0327058A3/de
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/06—Notations for structuring of protocol data, e.g. abstract syntax notation one [ASN.1]

Definitions

  • the present invention relates to an encoding/decoding system for a protocol data unit having a structure defined in accordance with the ISO (International Organization for Standardization) 8824 "Specification of Abstract Syntax Notation One (ASN.1)" and, more particularly, to an encoding/decoding system for a presentation protocol data unit and an application protocol data unit in the OSI (Open Systems Interconnection).
  • ISO International Organization for Standardization
  • ASN.1 Specification of Abstract Syntax Notation One
  • the presentation layer in order to encode and decode all the protocol data units in the presentation layer in accordance with the ISO 7498 "Basic Reference Model", the presentation layer must consider the structures of all the protocol data units in the application layer.
  • the present invention has been made in consideration of the above situation and has as its object to provide a protocol data unit encoding/decoding system capable of systematically encoding and decoding, in place of programs for realizing various functions on the basis of the ISO 8825, a protocol data unit having a structure defined in accordance with the ISO 8824, thereby simplifying the programs and correctly dividing the functions.
  • a protocol data unit encoding/decoding system for encoding and decoding, on the basis of the ISO 8825, a protocol data unit having a structure defined in accordance with the ISO 8824, comprising an AST traversing means for traversing an ASN.1 syntax tree comprising a tree structure representing the structure of the protocol data unit, a VTL searching means for searching, when a table-type value tree list for storing decoded values of the protocol data unit is supplied, the value tree list while traversing the ASN.1 syntax tree via the AST traversing means, thereby encoding the protocol data unit, and a DUB searching means for searching, when the protocol data unit is supplied, the protocol data unit while traversing the ASN.1 syntax tree via the AST traversing means, thereby decoding the protocol data unit into decoded values on the value tree list.
  • Fig. 1 is a block diagram showing an arrangement of a protocol data unit encoding/decoding mechanism 10 to which a protocol data unit encoding/decoding system according to an embodiment of the present invention is applied.
  • the protocol data unit encoding/decoding mechanism 10 comprises an AST traversing means 1 for traversing an ASN.1 Syntax Tree (to be referred to an an AST hereinafter) 4 which defines structures of protocol data units, a VTL searching means 2 for searching a table-type Value Tree List (to be referred to as a VTL hereinafter) 5 which stores decoded values of protocol data units and encoding protocol date units on a data unit buffer (to be referred to as a DUB hereinafter) 6, and a DUB searching means 3 for searching the DUB 6 which stores protocol data units and decoding protocol data units on the VTL 5.
  • AST traversing means 1 for traversing an ASN.1 Syntax Tree (to be referred to an an AST hereinafter) 4 which defines structures of protocol data units
  • processing performed by the AST traversing means 1 consists of "ROOT PROCESSING” in step 11, "LEFT SUBTREE TRAVERSING” in step 12 and "RIGHT SUBTREE TRAVERSING” in step 13.
  • each cell consists of three items of an id item 51, an lng item 52 and a ptr item 53, and a plurality of items are aligned.
  • the id item 51 stores an identifier for representing a selected element (see the ISO 8824)
  • the lng item 52 stores a data length with respect to the selected element or an opening parenthesis and a corresponding closing parenthesis if the element is a structure
  • the ptr item 53 stores a pointer to data with respect to the selected element.
  • the definition of the structure is developed as the AST 4 as shown Fig. 6.
  • the structure definition of the protocol data unit according to the ASN.1 notation is decoded into nodes, and each node is linked to another in a parent-child relationship as the left subtree and to another in a brother relationship as the right subtree, thereby forming a binary tree structure.
  • Lines 21 to 25 in the ASN.1 notation shown in Fig. 5 correspond to nodes TN1, TN2, TN4, TN6 and TN8 shown in Fig. 6, respectively.
  • the programs supply the AST 4 and VTL 5 to the protocol data unit encoding/decoding mechanism 10, thereby activating the mechanism.
  • the binary tree structure as shown in Fig. 6 is supplied to the AST 4 and an ASN.1 notation as shown in Fig. 7A is stored in the VTL 5 in the manner as shown in Fig. 7B.
  • the AST traversing means 1 traverses the AST 4 and performs the root processing to the node TN1 as a root (step 11).
  • step 14 In the root processing to the node TN1, whether encoding or decoding is to be performed is checked (step 14). In this case, since encoding is to be performed, the VTL searching means 2 is called (step 15).
  • the VTL searching means 2 searches an identifier "f" from the id item 51 of a first cell 61 in the VTL 5.
  • the AST traversing means 1 selects the node TN4 having the identifier "f" searched by the VTL searching means 2 from the nodes TN2, TN4 and TN10 which are the children of the node TN1 and are brothers.
  • the VTL searching means 2 encodes a value '61'H (H represents hexadecimal notation. This will be the same hereinafter) of the [APPLICATION 1] type defined by the ISO 8825 on the DUB 6, obtains a length of as a content of the value from the lng item 52 in the VTL 5 and encodes '08'H on the DUB 6 (see reference numeral 65 in Fig. 7C).
  • the AST traversing means 1 traverses the node TN5 as the left subtree of the node TN4 of the AST 4 (step 12) and recursively performs the root processing to the node TN5 (step 11).
  • the VTL searching means 2 encodes a value '30'H of the SEQUENCE type defined by the ISO 8825 on the DUB 6, obtains a length '06'H as a content of the value from the lng item 52 in the VTL 5 and encodes the length on the DUB 6 (see reference numeral 66 in Fig. 7C).
  • the AST traversing means 1 traverses the node TN6 as the left subtree of the node TN5 of the AST 4 (step 12) and recursively performs the "ROOT PROCESSING" to the node TN6 (step 11).
  • the VTL searching means 2 checks, in accordance with whether the id item 51 of a second cell 62 in the VTL 5 shown in Fig. 7B is "f0", whether the element is omitted. Since the id item is "f0", the VTL searching means 2 encodes a value '80'H of a [0] type defined by the ISO 8825 on the DUB 6.
  • the VTL searching means 2 performs processing of an INTEGER type represented by the node TN7 to date '00000000'H represented by the ptr item 53 of the second cell 62 in the VTL 5. Since the INTEGER type uses a minimum octet capable of representing its value as data, only '00'H is required.
  • the VTL searching means 2 encodes '01'H representing a length and data '00'H on the DUB 6 (see reference numeral 67 in Fig. 7C),
  • the AST traversing means 1 then traverses the left and right subtrees of the node TN7 of the AST 4 (steps 12 and 13). Since the node TN7 has no subtree, however, the AST traversing means 1 recurrently performs the root processing to the node TN8 as the right subtree of the node TN6 (step 11).
  • the VTL searching means 2 Since the node TN8 is of a [1] type, the VTL searching means 2 encodes a value '81'H of the[1] type defined by the ISO 8825 on the DUB 6. In this case, since the node TN9 as the left subtree of the node TN8 is of an IMPLICIT attribute, the VTL searching means 2 performs processing of an INTEGER type to data 'ffff'H represented by the ptr item 53 of a third cell 63 in the VTL 5. This data represents an integer of -1.
  • the VTL searching means 2 encodes '01'H representing a length on the DUB 6 and then encodes data 'ff'H thereon (see reference numeral 68 in Fig. 7C).
  • the AST traversing means 1 traverses the left and right subtrees of the node TN9 of the AST 4 (steps 12 and 13). Since the node TN9 has no subtree, however, the AST traversing means 1 traverses the right subtree of the node TN8. Since the node TN8 has no subtree, however, the AST traversing means 1 traverses the right subtree of the node TN5. Since the node TN5 has no subtree, however, the AST traversing means 1 determines the end of the SEQUENCE type of the node TN5.
  • the AST traversing means 1 then traverses the right subtree of the node TN1. Since the node TN1 has no subtree, however, the AST traversing means 1 ends the processing. As a result, a protocol data unit as shown in Fig. 7C is formed on the DUB 6.
  • the programs supply the AST 4 and the DUB 6 to the protocol data unit encoding/decoding mechanism 10, thereby activating the mechanism.
  • the binary tree structure as shown in Fig. 6 is supplied to the AST 4 and the protocol data unit as shown in Fig. 7C is supplied on the DUB 6.
  • the AST traversing means 1 traverses the AST 4 and performs the root processing to the node TN1 as a root (step 11).
  • step 14 whether encoding or decoding is to be performed is determined (step 14). In this case, since decoding is to be performed, the DUB searching means 3 is called (step 16).
  • the DUB searching means 3 searches '61'H from the first octet of the protocol data unit on the DUB 6.
  • the AST traversing means 1 selects the node TN4 from the nodes TN2, TN4 and TN10 which are the children of the node TN1 and are brothers '61'H searched by the DUB searching means 3 represents the [APPLICATION 1].
  • the DUB searching means 3 decodes the identifier "f" of the node TN4 in the id item 51 of the first cell 61 in the VTL 5 and decodes '08'H representing the length of the content in the second octet of the protocol data unit on the DUB 6 in the lng item 52 of the first cell 61 of the VTL 5.
  • the AST traversing means 1 then traverses the node TN5 as the left subtree of the node TN4 of the AST 4 (step 12) and recursively performs the root processing to the node TN5 (step 11).
  • the DUB searching means 3 checks whether the third octet of the protocol data unit on the DUB 6 is '30'H representing the SEQUENCE type. Since the third octet is '30'H, the DUB searching means 3 decodes " ⁇ "representing the start of the SEQUENCE type in the lng item 52 of the first cell 61 in the VTL 5 (see Fig. 7D). Although the fourth octet of the protocol data unit on the DUB 6 represents the length of the content of the SEQUENCE type, it is not decoded.
  • the AST traversing means 1 traverses the node TN6 as the left subtree of the node TN5 of the AST 4 (step 12) and recursively performs the root processing to the node TN6 (step 11).
  • the DUB searching means 3 checks in accordance with the fifth octet of the protocol data unit on the DUB 6 whether the element is omitted. Since the fifth octet of the protocol data unit is '08'H representing the [0 ⁇ type, the DUB searching means 3 determines that the element is not omitted and decodes the identifier "f0" of the node TN6 in the id item 52 of the second cell 62 in the VTL 5. In this case, the node TN7 as the left subtree of the node TN6n is of the IMPLICIT attribute.
  • the DUB searching means 3 decodes '01'H representing the length at the sixth octet of the protocol data unit in the lng item 52 of the second cell 62 in the VTL 5 and decodes an address of '00'H representing an integer at the seventh octet of the protocol data unit in the ptr item 53 of the second cell 62 in the VTL 5.
  • the AST traversing means 1 traverses the left and right subtrees of the node TN7 of the AST 4. Since the node TN7 has no subtree, however, the AST traversing means 1 traverses the node TN8 as the right subtree of the node TN6 (step 13) and recursively performs the root processing to the node TN8 (step 11).
  • the DUB searching means 3 checks whether the eighth octet of the protocol data unit on the DUB 6 is '81'H representing the [1] type. Since the eighth octet is '81'H, the DUB searching means 3 decodes the identifier "f1" of the node TN8 in the id item 51 of the third cell 63 in the VTL 5. In this case, the node TN9 as the left subtree of the node TN8 is of the IMPLICIT attribute.
  • the DUB searching means 3 decodes '01'H representing the length at the ninth octet of the protocol data unit on the DUB 6 directly in the lng item 52 of the third cell 62 in the VTL 5 and decodes an address of 'ff'H representing an integer of -1 at the tenth octet of the protocol data unit on the DUB 6 in the ptr item 53 of the third cell 63 in the VTL.
  • the AST traversing means 1 traverses the left and right subtrees of the node TN9 of the AST 4 (steps 12 and 13). Since the node TN9 has no subtree, however, the AST traversing means 1 traverses the right subtree of the node TN8. Since the node TN8 has no subtree tree, however, the AST traversing means 1 traverses the right subtree of the node TN5. Since the node TN5 has no subtree, however, the AST traversing means 1 determines the end of the SEQUENCE type processing and decodes " ⁇ " representing the end of the SEQUENCE type in the lng item 52 of the fourth cell 64 in the VTL 5 (see Fig. 7D)>
  • the ASD traversing means 1 then traverses the right subtree of the node TN1. Since the node TN1 has no subtree, however, the AST traversing means 1 ends the processing. As a result, the VTL 5 shown in Fig. 7D having the lng and ptr items 52 and 53 different from those of the VTL 5 shown in Fig. 7B is formed.
  • a protocol data unit having a structure defined in accordance with the ISO 8824 can be systematically encoded and decoded in place of a plurality of programs on the basis of the ISO 8825.
  • labors required for programming complicated encoding an decoding processing in a plurality of programs for handling protocol data units can be omitted, thereby simplifying the programs and correctly dividing functions.
  • each protocol can be processed by only referring to decoded values on a VTL corresponding to an ASN.1 value notation.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Communication Control (AREA)
  • Computer And Data Communications (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
EP19890101718 1988-02-02 1989-02-01 Kodier/Dekodier-System für einen Protokolldatenblock Withdrawn EP0327058A3 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP63023340A JPH0650884B2 (ja) 1988-02-02 1988-02-02 プロトコルデータ単位組立／分解方式
JP23340/88 1988-02-02

Publications (2)

Publication Number Publication Date
EP0327058A2 true EP0327058A2 (de) 1989-08-09
EP0327058A3 EP0327058A3 (de) 1992-01-22

Family

ID=12107863

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19890101718 Withdrawn EP0327058A3 (de) 1988-02-02 1989-02-01 Kodier/Dekodier-System für einen Protokolldatenblock

Country Status (2)

Country Link
EP (1) EP0327058A3 (de)
JP (1) JPH0650884B2 (de)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0515907A2 (de) * 1991-05-14 1992-12-02 Nec Corporation Data-Protokol-Generator-Analysator
EP0567137A1 (de) * 1992-04-23 1993-10-27 Nec Corporation Kodier-/Dekodier-Anordnung für einen Protokolldatenblock
GB2287814A (en) * 1994-03-24 1995-09-27 Fujitsu Ltd Converting data between abstract syntax format and transfer syntax format
EP0862302A2 (de) * 1997-02-26 1998-09-02 Nec Corporation Hochgeschwindigkeitskodierer und Dekodierschaltung mit endlichem Automat für Dekodierung einer Abstraktsyntaxnotationsnachricht
CN100421076C (zh) * 2004-03-23 2008-09-24 资通电脑股份有限公司 用于抽象语法记述编/译码***的引用查表方法
CN101908006A (zh) * 2010-07-30 2010-12-08 北京理工大学 一种基于gcc抽象语法树的缓冲区溢出漏洞检测方法
CN109255209A (zh) * 2017-07-13 2019-01-22 阿里巴巴集团控股有限公司 一种数据处理方法、装置、设备和存储介质

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11249987A (ja) * 1998-03-05 1999-09-17 Nec Corp メッセージ処理装置およびその方法ならびにメッセージ処理制御プログラムを格納した記憶媒体

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
BRITISH TELECOM TECHNOL. JOURNAL vol. 5, no. 4, October 1987, pages 70 - 75; J.A. ZAJACZKOWSKI: 'AN INTRODUCTION TO THE CCITT/ISO STANDARD ON TRANSFER SYNTAX AND NOTATION' *
COMPUTER NETWORKS AND ISDN SYSTEMS. vol. 14, no. 2-5, 1987, AMSTERDAM, NL pages 297 - 303; F. CANESCHI ET AL.: 'AN ARCHITECTURE FOR AN ASN.1 ENCODER/DECODER' *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0515907A2 (de) * 1991-05-14 1992-12-02 Nec Corporation Data-Protokol-Generator-Analysator
EP0515907A3 (en) * 1991-05-14 1995-02-01 Nippon Electric Co Protocol data generator-analyzer
EP0567137A1 (de) * 1992-04-23 1993-10-27 Nec Corporation Kodier-/Dekodier-Anordnung für einen Protokolldatenblock
GB2287814A (en) * 1994-03-24 1995-09-27 Fujitsu Ltd Converting data between abstract syntax format and transfer syntax format
GB2287814B (en) * 1994-03-24 1998-03-11 Fujitsu Ltd Method and apparatus for converting data between abstract syntax format and transfer syntax format
US5778360A (en) * 1994-03-24 1998-07-07 Fujitsu Limited Method and apparatus for encoding and decoding a data unit whose structure is defined by a description conforming to abstract syntax according to a prescribed encoding rule
EP0862302A2 (de) * 1997-02-26 1998-09-02 Nec Corporation Hochgeschwindigkeitskodierer und Dekodierschaltung mit endlichem Automat für Dekodierung einer Abstraktsyntaxnotationsnachricht
EP0862302A3 (de) * 1997-02-26 2002-10-09 Nec Corporation Hochgeschwindigkeitskodierer und Dekodierschaltung mit endlichem Automat für Dekodierung einer Abstraktsyntaxnotationsnachricht
CN100421076C (zh) * 2004-03-23 2008-09-24 资通电脑股份有限公司 用于抽象语法记述编/译码***的引用查表方法
CN101908006A (zh) * 2010-07-30 2010-12-08 北京理工大学 一种基于gcc抽象语法树的缓冲区溢出漏洞检测方法
CN109255209A (zh) * 2017-07-13 2019-01-22 阿里巴巴集团控股有限公司 一种数据处理方法、装置、设备和存储介质
CN109255209B (zh) * 2017-07-13 2022-05-17 阿里巴巴集团控股有限公司 一种数据处理方法、装置、设备和存储介质

Also Published As

Publication number Publication date
JPH0650884B2 (ja) 1994-06-29
JPH01198145A (ja) 1989-08-09
EP0327058A3 (de) 1992-01-22

Similar Documents

Publication Publication Date Title
US6154156A (en) Message processing device and method thereof and storage medium storing message processing control program
US5483556A (en) Data compression-decompression method and apparatus for synchronous terminal means
US5418963A (en) Protocol encoding/decoding device capable of easily inputting/referring to a desired data value
US6825781B2 (en) Method and system for compressing structured descriptions of documents
JP3272014B2 (ja) 階層構造データ処理情報を含むデータ処理辞書を作成する方法及び装置
US6052526A (en) Data structure and method for dynamic type resolution using object-oriented programming language representation of information object sets
US5418972A (en) Protocol data generator-analyzer
US20050097566A1 (en) Message translation and parsing of data structures in a distributed component architecture
US20090080461A1 (en) Frame alteration logic for network processors
US4949302A (en) Message file formation for computer programs
US4937573A (en) Variable length code and devices for high frequency transmission
EP0327058A2 (de) Kodier/Dekodier-System für einen Protokolldatenblock
US20100211867A1 (en) Processing module, a device, and a method for processing of xml data
US6081212A (en) Decoder using a finite state machine in decoding an abstract syntax notation-message and an encoder for carrying out encoding operation at a high speed
EP0079442B1 (de) Datenübersetzungsgerät zur Übersetzung zwischen rohen und kompressionskodierten Datenformen
JP2996296B2 (ja) メッセージ復号化装置及び有限状態機械生成装置
US7447787B2 (en) Protocol executing system and protocol PDU common data structure converting method for processing protocol PDUS
KR0126590B1 (ko) 멀티미디어 정보처리 시스팀을 이용한 멀티미디어 정보 프리젠테이션용 엔진 및 그 운용방법
JPH0646099A (ja) プロトコル符号化／復号化装置
US20030095310A1 (en) Optical communication apparatus and method
Ahlswede et al. Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory
JP2833612B2 (ja) サービスプリミティブ生成システム
Helfgott et al. Linear-time construction of optimal context trees
EP0525874A2 (de) FIFO-Bufferspeicher mit asynchronem Zugriff und mit Speicherzustandskennzeichen
EP0349465A2 (de) Echtzeitkompilierung von dynamisch berechneten variablen Daten zur Benutzung in strukturierten Datenströmen

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19890201

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 19940303

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 19940714