Routers must perform packet classification at high speeds to support advanced functions such as firewalls and QoS routing.While several efficient solutions are known for the one-dimensional IP lookup problem

the mult-dimensional packet classification has proved to be far more difficult.Existing filter schemes with fast lookup time do not scale to large filter database.Based on tuple space search

a packet classification algorithm called bitmap vector of tuple space for multi-dimensional conflict-free filters is presented in this paper.The result of the performance analysis in two-dimension and multi-dimension shows that the scheme provides better worse case bounds about time and space complexity than what have existed

so the algorithm is more scalable and faster.The novel approach can be easily implemented both from software and hardware which made this algorithm more practical to application.