Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and diffserv. Classification can be based on an arbitrary number of fields in the packet header. Performing classification quickly on an arbitrary number of fields is known to be difficult, and has poor worst-case complexity.,  re-examine two basic mechanisms that have been dismissed in the literature as being too inefficient: backtracking search and set pruning tries.  find using real databases that the time for backtracking search is much better than the worst-case bound; instead of O(( logN )  k -1 ), the search time is only roughly twice the optimal search time 1 . Similarly,  find that set pruning tries (using a DAG optimization) have much better storage costs than the worstcase bound.  also propose several new techniques to further improve the two basic mechanisms. Our major ideas are (i) backtracking search on a small memory budget, (ii) a novel compression algorithm, (iii) pipelining the search, (iv) the ability to trade-off smoothly beten backtracking and set pruning, and (v) algorithms to effectively make use of hardware if hardware is available.  quantify the performance gain of each technique using real databases.  show that on real firewall databases our schemes, with the accompanying optimizations, are close to optimal in time and storage.
['Lili Qiu', 'George Varghese', 'Subhash Suri']
I am writing a research paper on a idea Fast firewall implementations for software-based and hardware-based routers
[{"from": "human", "value": "I am writing a research paper on a idea Fast firewall implementations for software-based and hardware-based routers"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and diffserv. Classification can be based on an arbitrary number of fields in the packet header. Performing classification quickly on an arbitrary number of fields is known to be difficult, and has poor worst-case complexity.,  re-examine two basic mechanisms that have been dismissed in the literature as being too inefficient: backtracking search and set pruning tries.  find using real databases that the time for backtracking search is much better than the worst-case bound; instead of O(( logN )  k -1 ), the search time is only roughly twice the optimal search time 1 . Similarly,  find that set pruning tries (using a DAG optimization) have much better storage costs than the worstcase bound.  also propose several new techniques to further improve the two basic mechanisms. Our major ideas are (i) backtracking search on a small memory budget, (ii) a novel compression algorithm, (iii) pipelining the search, (iv) the ability to trade-off smoothly beten backtracking and set pruning, and (v) algorithms to effectively make use of hardware if hardware is available.  quantify the performance gain of each technique using real databases.  show that on real firewall databases our schemes, with the accompanying optimizations, are close to optimal in time and storage."}]