V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search." in Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 1999, pp. 135--146.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....classifiers, but the storage requirements are still high (up to 3MB) Also, we have as yet been unable to provide a mechanism for doing incremental updates to the data structure. Another algorithm called Tuple Space Search has been recently proposed for packet classification on multiple fields [2]. The scheme partitions the rules of a classifier into different tuple categories based upon the number of specified bits in the rules (a bit is specified in a rule if it is not a don t care bit) The scheme then uses hashing among rules within the same category. The main advantages of this ....

V. Srinivasan, S. Suri and G. Varghese, "Packet Classification using Tuple Space Search", Proc. ACM SIGCOMM 1999, pp 135-146.

....uses a version trie of tries designed for 2 tuple prefix matches. The Area BasedQuadtree proposed in [4] improves upon the Grid of Tries and exports to designers the tradeoff between lookup efficiency and insert efficiency by means of a configuration parameter. The tuple space search proposed in [25] decomposes a 5 tuple prefix matching problem into a series of exact match lookups performed using hashing. All the above algorithms can be implemented either in software or in hardware. The literature also contains several other algorithms specifically designed for hardware implementation ....

V. Srinivasan, Subhash Suri, and George Varghese. Packet classification using tuple space search. In Proceedings of ACM SIGCOMM, pages 135--146, 1999.

....of the real time and the non real time packet handling. Typically, the determination of the application set (Network Application Profile, NAP) would be done o# line whereas the determined NAP would be used in conjunction with the flow and packet classification systems [10] 7] 11] 12] 13] [14] in real time fashion. The first explicit information on the sending application in the Internet appear at the TCP UDP source and destination numbers. An IP application is, in this work, defined to be a group of packets originating from an identical source (TCP UDP) port. Many of the new ....

V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in Proceedings of SIGCOMM 99. 1999, IEEE/ACM.

No context found.

V.Srinivasan, S.Suri, and G.Varghese. Packet classification using tuple space search. In Proc of ACM Sigcomm'99, september 1999.

No context found.

V.Srinivasan, S.Suri, and G.Varghese, "Packet classification using tuple space search," in SIGCOMM, 1999.

....prefix of the packet header field this is useful for blocking access from a specified subnetwork. In a range match, the header values should lie in the range specified by the rule this is useful for specifying port number ranges. Ranges, however, can be converted into prefixes as shown in [1] [2]. Each rule ### has an associated action , which specifies how to forward the packet matching this rule. The action may specify if the packet should be blocked or if it is to be forwarded, it specifies the outgoing link on which the packet is to be sent, and perhaps also a queue within that ....

....of memory accesses 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 ....

[Article contains additional citation context not shown here]

V.Srinivasan S.Suri G.Varghese, "Packet classification using tuple space search," in Proceedings of ACM Sigcomm'99, september 1999.

....prefix of the packet header field this is useful for blocking access from a specified subnetwork. In a range match, the header values should lie in the range specified by the rule this is useful for specifying port number ranges. Ranges, however, can be converted into prefixes as shown in [1] [2]. Each rule R i has an associated action act , which specifies how to forward the packet matching this rule. The action may specify if the packet should be blocked or if it is to be forwarded, it specifies the outgoing link on which the packet is to be sent, and perhaps also a queue within ....

....of memory accesses 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 ....

[Article contains additional citation context not shown here]

V.Srinivasan S.Suri G.Varghese, "Packet classification using tuple space search," in Proceedings of ACM Sigcomm'99, september 1999.

....references. By making multiple classification algorithms publicly available we hope to encourage experimentation and improvements that can then be incorporated into revisions on the same web site. III. PRIOR WORK AND SUMMARY OF RESULTS The packet classification problem is inherently hard( 8] [9], 3] 7] 4] 10] from a theoretical standpoint. It has been shown [8] that in its fullest generality, packet classification requires either O(log N) time and linear space, or log N time and O(N ) space, where N is the number of rules, and k is the number of header fields used in ....

V.Srinivasan, S.Suri, and G.Varghese, "Packet classification using tuple space search," in Proc of ACM Sigcomm'99, september 1999.

....filter database or to use hardware, such as ternary CAMs (content addressable memory) or other ASICs that perform parallel linear search (e.g. 4] Such hardware solutions do not scale to large filter databases. Other solutions reported in literature that can be implemented in software (e.g. [9, 5]) are either slow or take too much storage. With the advent of software based routers (e.g. 7] which are typically aimed at the edge router space where classification is particularly important, it is necessary to find software techniques for fast firewall implementations. There is evidence ....

....it is necessary to find software techniques for fast firewall implementations. There is evidence that the general filter problem is a hard problem, and requires either O(N ) memory or #( log N) search time, where N is the number of filters and K is the number of classified fields [4, 9]. However recent research [5, 6, 10] indicates that such worst case behavior does not arise in real databases. Based on this observation, these papers introduce clever new techniques like pruned tuple search [10] and Recursive Flow Classification [5] that exploit the structure of existing ....

[Article contains additional citation context not shown here]

V. Srinivasan, S. Suri, and G. Varghese. Packet Classification using Tuple Space Search. In Proc. of SIGCOMM'99, Sept. 1999.

....can be thought of as one dimensional packet classification. While several efficient solutions are known for the onedimensional IP lookup problem, the multi dimensional packet classification has proved to be far more difficult. While an time scheme is known for the IP lookup, Srinivisan et al. [1] show a lower bound of ### # for # dimensional filter lookup, where is the number of bits in a header field. In particular, this lower bound precludes the possibility of a binary search like scheme even for 2dimensional filters (say, IP source and destination pairs) In this paper, we ....

....Packet classification using ad hoc mechanisms like linear search through all filtering rules is too slow in practice and a significant source of bottleneck. Hence the problem has received some attention in last # years. In particular, the tuple space framework proposed by Srinivasan et.al. [1] and associated simulation results suggest significant reduction in search space, while keeping memory requirement almost linear. The tuple space is formed by distinct combinations of prefix lengths (#) in the filter set. For filters containing IP prefixes, maximum prefix length for fields is # # ....

[Article contains additional citation context not shown here]

V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in Proceedings of SIGCOMM'99, 1999.

....connection between two different sites of a company. Such refined forwarding is part of the next generation Internet design, and falls within the broader scope of layer four packet classification, where packets are routed using arbitrary fields of the packet header [1] 9] 10] 12] 15] [16], 17] Routers capable of packet classification can implement many advanced services, such as firewall access control, Virtual Private Networks, and quality of service routing. In this paper we focus on a particular problem that arises in the context of using twodimensional routing tables many ....

V. Srinivasan, S. Suri, and G. Varghese. Packet Classification Using Tuple Space Search. Proc. of ACM SIGCOMM, 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search." in Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 1999, pp. 135--146.

No context found.

V. Srinivasan, Subhash Suri, and George Varghese. Packet classification using tuple space search. In Computer ACM SIGCOMM Communication Review, pages 135--146, October 1999.

No context found.

V. Srinivasan, Subhash Suri, and George Varghese. Packet classification using tuple space search. In Computer ACM SIGCOMM Communication Review, pages 135--146, October 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese. Packet classificationusing tuple space search. In Proc. ACM SIGCOMM, pages 135--146, 1999. http://citeseer.ist.psu.edu/srinivasan99packet.html.

No context found.

V. Srinivasan, S. Suri, and G. Varghese. Packet classification using tuple space search. In Proceedings of SIGCOMM 99. IEEE/ACM, 1999.

No context found.

V. Srinivasan et al., "Packet Classification Using Tuple Space Search," Proc. ACM SIGCOMM, Sept. 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in SIGCOMM 99, pp. 135--146, 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in SIGCOMM 99, pp. 135--146, 1999.

No context found.

V. Srinivasan, S. Suri, M. Waldvogel, "Packet classification using tuple space search", In Proceedings of ACM Sigcomm'99, September 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in SIGCOMM 99, pp. 135--146, 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese. Packet classification using tuple space search. In Proceedings of ACM SIGCOMM '99, pages 135--146, Boston, MA, August 2001.

No context found.

V. Srinivasan, S. Suri, and G. Varghese. Packet classification using tuple space search. In Proceedings of ACM SIGCOMM'99, pages 135--146, Cambridge, MA, September 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese. Packet classification using tuple space search. In Proc. ACM Sigcomm, pages 135--146, Sept. 1999.

No context found.

V. Srinivasan, S. Suri, and G. Varghese. Packet Classification using Tuple Space Search. Computer Communication Review, 29(4):135--146, October 1999.

First 50 documents  Next 50

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