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.
