| T. Blackwell. In Proceedings of IEEE/ACM INFOCOM '96 Many important protocols, such as Q.93B or any protocol based on the ASN.1 Basic Encoding Rules, are transmitted using tagged message formats, in which a message can be considered as a sequence of interleaved tag and data fields, where tag fields define the meaning of subsequent fields. These messages are expensive to decode, partly because decoding each data field requires testing one or more tag fields. Evidence suggests that in some applications, although the potential space of message encodings may be very large, only a small number of message layouts are seen frequently, and thus remembered information can be used to optimize the decoding of messages. This paper analyzes the use of run-time code generation to generate optimized decoding instruc tion sequences for received messages matching previously observed layouts, and describes a pro totype system that applies the techniques to Q.93B decoding. In the average case, substantial performance gains are seen. |