Router-based Lawful Interception Implementation And Entire Network-based Monitoring Task Allocation Research

Today, with the explosively growth of Internet information, the best-effort service can not fully meet the needs of various user groups provided by traditional IP network which has been become an important channel for public information transmission. Lawful interception for public IP network is not only a necessary requirement, but also a huge market.This paper aims to achieve lawful interception and research how to improve its performance in IP network. The subject has a very real sense. Contribution of this paper is as follows:This paper involved in the "COMWARE V500R002 lawful interception Development Project". The project had completed successfully and become a product. This paper is mainly responsible for the design and implementation of packets forwarding module. The paper also measures and analyzes the module's performance.In the realization of the process, with the increasing of rules, this paper found that the rate will become linear growth. Thus, the traditional matching method with loop double-linked list can't well meet the requirements of lawful interception with the increase of rules. The paper proposes a more efficient and faster matching method for packet classification-cache. Simulations were presented that showing cache has a better classification performance than double-linked list. In building a cache, different construction methods will have different affects on packet classification. This paper tries to find a balance to make the cache shows a better classification performance.Monitoring is crucial to ensure the correct operation of networks, monitoring of each router as one node on the monitor traffic flowing through it. But with the expansion of network size, traffic dramatic change, will inevitably lead to some of the monitor nodes very busy, while other nodes are idle. In order to better assign the load to each node in the network, this paper presents a new algorithm-means method, the algorithm on a smaller particle size for task scheduling. We present extensive experiments according different networks models results showing that Compared with existing algorithms, means method can better balance the load on all nodes.