L. Qiu, G. Varghese, and S. Suri. Fast firewall implementation for software and hardware based routers. In Proc. of the ICNP 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Packet Classification for Core Routers: Is there an.. - Baboescu, Singh.. (2003) (10 citations) Self-citation (Varghese) (Correct)
No context found.
L. Qiu, G. Varghese, and S. Suri. Fast firewall implementation for software and hardware based routers. In Proc. of the ICNP 2001.
Packet Classification Using Multidimensional Cutting - Singh, Baboescu, Varghese.. (2003) (1 citation) Self-citation (Varghese) (Correct)
No context found.
L. Qiu, G. Varghese, and S. Suri, "Fast firewall implementation for software and hardware based routers," in Proc. ICNP, 2001.
Fast and Scalable Conflict Detection for Packet Classifiers - Baboescu, Varghese (2002) (3 citations) Self-citation (Varghese) (Correct)
....required by an operation (the main limitation in modern computer architectures) and the memory size occupied by data structures (because it is important to fit into high speed memory) II. PREVIOUS WORK Packet filter classification has received broad attention ( 6] 1] 4] 2] 5] 7] [8], 9] 10] from previous work, it appears that the general problem is inherently hard (in a worst case sense) when the filters contain more than 2 fields. While Ternary CAMs [11] offer a good solution in hardware for small classifiers, they use too much power and do not scale well to large ....
L. Qiu, G. Varghese, and S. Suri, "Fast firewall implementation for software and hardware based routers," in Proceedings of the 9th International Conference on Network Protocols ICNP 2001.
Fast and Scalable Conflict Detection for Packet Classifiers - Baboescu, Varghese (2002) (3 citations) Self-citation (Varghese) (Correct)
....required by an operation (the main limitation in modern computer architectures) and the memory size occupied by data structures (because it is important to fit into high speed memory) II. PREVIOUS WORK Packet filter classification has received broad attention( 6] 1] 4] 2] 5] 7] [8], 9] 10] from previous work, it appears that the general problem is inherently hard (in a worst case sense) when the filters contain more than 2 fields. While Ternary CAMs [11] offer a good solution in hardware for small classifiers, they use too much power and do not scale well to large ....
L. Qiu, G. Varghese, and S. Suri, "Fast firewall implementation for software and hardware based routers," in Proceedings of the 9th International Conference on Network Protocols ICNP 2001.
Packet Classification for Core Routers: Is there an.. - Baboescu, Singh.. (2003) (10 citations) Self-citation (Varghese) (Correct)
....for heuristics to exploit the structure of the databases. They observed for the first time that a given packet matches only a few rules even in large classifiers. Baboescu and Varghese [5] also exploit this observation to reduce the search times for the algorithm described in [8] Qiu et al. [17] exploit the observation that any packet matches at most a few distinct values in each field to suggest backtracking trie search as a viable (though fairly slow) alternative. Performance of Existing Schemes: In terms of the current state of the art (see comparisons later) it appears that RFC has ....
....described, we now instantiate this general schema by using grid of tries as the 2D algorithm in Figure 6 A. Extended Grid of Tries(EGT) In a naive generalization of a k dimensional trie we either pay a large price in memory or we may be forced to do backtracking and we pay a large price in time [17]. However, we may eliminate part of the waste of backtracking by using precomputation. This basic technique was introduced in the two dimensional trie implementation using grid of tries [7] However one can immediately see that the approach in grid of tries cannot be generalized in k, k 2 ....
[Article contains additional citation context not shown here]
L. Qiu, G. Varghese, and S. Suri, "Fast firewall implementation for software and hardware based routers," in Proc. of the ICNP 2001.
Fast Firewall Implementations for Software and.. - Qiu, Varghese, Suri (2001) (3 citations) Self-citation (Qiu Varghese Suri) (Correct)
....on Cost: The basic idea behind pruned backtracking is as follows. During the backtracking search, if we encounter a trie node such that the tree beneath the node does not contain any lower cost filter than the current match, then we do not need to search through the trie below that node. Refer to [8] for more details. Pruning based on cost is used in other filter algorithms such as [5, 1] Switch Pointers: We further optimize backtracking search with switch pointers. Switch pointers were introduced in [10] but the technique is limited to 2 dimensional packet classification. We extend ....
....metrics. The total storage is computed as the total number of nodes in the multiplane trie. The worst case lookup time is the total number of memory accesses in the worst case assuming a 1 bit at a time traversal of each trie. Finding worst case backtracking search times is non trivial. Refer to [8] for details. We use a set of 5 industrial firewall databases that we obtained from various sites for performance evaluation throughout the paper. For privacy reasons, we are not allowed to disclose the names of the companies, or the actual databases. Table 1 shows the number of rules in the ....
[Article contains additional citation context not shown here]
L. Qiu, G. Varghese, and S. Suri. Fast Firewall Implementations for Software and Hardware-based Routers. Microsoft Research Technical Report MSR-2001-61. June 2001.
Packet Classification for Core Routers: Is there an.. - Baboescu, Singh.. (2003) (10 citations) Self-citation (Varghese) (Correct)
....for heuristics to exploit the structure of the databases. They observed for the first time that a given packet matches only a few rules even in large classifiers. Baboescu and Varghese [1] also exploit this observation to reduce the search times for the algorithm described in [11] Qiu et al. [15] exploit the observation that any packet matches at most a few distinct values in each field to suggest backtracking trie search as a viable (though fairly slow) alternative. Performance of Existing Schemes: In terms of the current state of the art (see comparisons later) it appears that RFC has ....
....described, we now instantiate this general schema by using grid of tries as the 2D algorithm in Figure 6 A. Extended Grid of Tries(EGT) In a naive generalization of a k dimensional trie we either pay a large price in memory or we may be forced to do backtracking and we pay a large price in time [15]. However, we may eliminate part of the waste of backtracking by using precomputation. This basic technique was introduced in the two dimensional trie implementation using grid of tries [17] However one can immediately see that the approach in grid of tries cannot be generalized in # u# ( ....
[Article contains additional citation context not shown here]
L. Qiu, G. Varghese, and S. Suri. Fast firewall implementation for software and hardware based routers. In Proc. of the ICNP 2001.
Efficient Packet Classification with Digest Caches - Chang, al. (Correct)
No context found.
Qiu, L., Varghese, G., Suri, S. Fast firewall implementations for software and hardware-based routers. In Proceedings of ACM SIGMETRICS 2001.
Approximate Caches for Packet Classification - Chang, al. (Correct)
No context found.
Qiu, L., Varghese, G., Suri, S. Fast firewall implementations for software and hardware-based routers. In Proceedings of ACM SIGMETRICS 2001.
Efficient Packet Classification with Digest Caches - Chang, al. (Correct)
No context found.
Qiu, L., Varghese, G., Suri, S. Fast firewall implementations for software and hardware-based routers. In Proceedings of ACM SIGMETRICS 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC