Abstract | ||
---|---|---|
Abstract Syntax Notation One (ASN.1) plays an important role in many network protocol stacks. Some institutes use compiler-based approach to develop their ASN.1 module. However, this approach has some disadvantages, such as low efficiency, redundant codes, etc, and the module may become one of the performance bottlenecks in high-speed network communication. This paper discusses the requirements of ASN.1 module in network protocols, and analyses the compiler-based approach. Later a novel approach is proposed. It does not contain numerous encoding and decoding routines, but use a tree-like structure called "database definition" to store the necessary ASN.1 syntax information, and uniform functions to perform the encoding and decoding procedure. Using this method, a substantial reduction in code size was demonstrated (up to 90% reduction in the code size taken up by marshalling routines), and the improved efficiency also tested its superiority. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1109/ITCC.2003.1197602 | ITCC |
Keywords | Field | DocType |
decoding,encoding,program compilers,protocols,tree data structures,asn.1,abstract syntax notation one,compiler-based approach,database definition,marshalling routines,network protocol stacks,tree-like structure,bit error rate,testing,abstract syntax,intelligent networks,network protocol | Programming language,Abstract Syntax Notation One,Computer science,Marshalling,Compiler,Runtime library,Decoding methods,Intelligent Network,Communications protocol,Encoding (memory) | Conference |
ISBN | Citations | PageRank |
0-7695-1916-4 | 3 | 0.92 |
References | Authors | |
1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lv Qian | 1 | 3 | 0.92 |
Benxiong Huang | 2 | 168 | 19.36 |
Fu-rong Wang | 3 | 3 | 1.26 |