Filter conflicts resolving is an important issue for packet classification and network management.On the one hand

to reduce the time spent on packet classification

a certain algorithm for resolving filter conflicts should be applied to eliminate all filter conflicts during the preprocessing phase.On the other hand

because of the complexity of firewall filters

when firewall administrators add a filter

the newly added filter may conflict with existing ones.This not only makes filter databases difficult to manage

but also may lead to security vulnerabilities.Thus a certain algorithm for resolving filter conflicts should also be applied to eliminate all filter conflicts.Several algorithms for resolving filter conflicts have already been proposed but most of them cannot eliminate filter conflicts completely and set restrictions on filters.This paper analyses filter conflicts from the perspective of computational geometry and presents a filter conflicts resolving algorithm based on cutting mapping.The algorithm resolves filter conflicts according to the classification of conflicts.It treats two filters as the basic processed object and sequentially cuts every dimension of the filters that have lower priority.This paper proves the algorithm and experiments verify its good performance.