一种应用层协议解析加速算法

A General Acceleration Algorithm for Application Protocol Parsing

为解决WEB应用服务端高并发压力时应用层协议解析带来的性能和稳定性问题,通过统计分析发现一些应用层协议(如RTSP、HTTP、SSDP等)结构具有字段数量有限、字段名称固定、名称与分割符之间内容为该字段值以及结构非固定等特征,提出一种协议字段树结构,基于该结构提出一种应用层协议内容解析加速算法,在解析过程中不会出现匹配失败及回溯情况。针对具有上述特征的应用层协议,通过与传统的协议解析方法及多模字符串匹配算法实验对比,结果显示,提出的基于协议字段树结构的解析加速算法解析性能比传统的解析方法平均提升16.5%以上,算法适用于高并发压力下ASCII及二进制形式的协议内容解析,具有良好的扩展性。

The performance and stability related issues in WEB applications were studied and the results showed that some application layer protocol(such as HTTP,SSDP,etc.) structures have attributes like limited field,fixed number of field name,obvious position for field values and unstructured.A general application protocol parsing acceleration algorithm was proposed to prompt signaling handle efficiency.The key idea is the protocol field extended tree.The proposed algorithm was demonstrated and analyzed,and its time complexity only grows with not protocol content length but the sum of each field length in protocol format.The comparion with the algorithms used for existed protocol parsing methods in well-known WEB applications proved this algorithm outperformance 16.5% in throughput than compared methods under the same test conditions.Besides,the proposed algorithm could be applied to both ASCII and binary application protocols with good scalability.