Performance Improvement of Hardware-Based Packet Classification Algorithm
|
|
- Oswald Atkins
- 5 years ago
- Views:
Transcription
1 Performance Improvement of Hardware-Based Packet Classification Algorithm Yaw-Chung Chen 1, Pi-Chung Wang 2, Chun-Liang Lee 2, and Chia-Tai Chan 2 1 Department of Computer Science and Information Engineering, National Chiao Tung University, HsinChu, 3 Taiwan, R.O.C. ycchen@csie.nctu.edu.tw 2 Telecommunication Laboratories, Chunghwa Telecom Co., Ltd., 7F, No. 9 Lane 74 Hsin-Yi Rd. Sec. 4, Taipei, 16 Taiwan, R.O.C. {abu, chlilee, ctchan}@cht.com.tw Abstract. Packet classification is important in fulfilling the requirements of differentiated services in next generation networks. In the previous work, we presented an efficient hardware scheme, Condensate Bit Vector, based on bit vectors. The scheme significantly improves the scalability of packet classification. In this work, the characteristics of Condensate Bit Vector are further illustrated, and two drawbacks that may negatively affect the performance of Condensate Bit Vector are revealed. We show the solution to resolve the weaknesses and introduce the new schemes, Condensate Ordered Bit Vector and Condensate and Aggregate Ordered Bit Vector. Experiments show that our new algorithms drastically improve the search speed as compared to the original algorithm. 1 Introduction Packet classification has been extensively employed in the Internet for secure filtering and service differentiation by administrators to reflect policies of network operations and resource allocation. Using the pre-defined policies, the packets can be assigned to various classes. However, packet classification with a potentially large number of policies is difficult and exhibits poor worst-case performance. In the previous work [1], we presented an efficient hardware scheme, Condensate Bit Vector, based on bit vectors. The scheme significantly improves the scalability of packet classification. In this work, the characteristics of Condensate Bit Vector are further illustrated, and two drawbacks that may negatively affect the performance of Condensate Bit Vector are revealed. In the following, we present how to resolve the weaknesses and introduce the new Condensate Ordered Bit Vector (CoBV) and Condensate and Aggregate Ordered Bit Vector (CAoBV) schemes. Experiments demonstrate that the new schemes drastically improve the search speed as compared to the original algorithm. This work is supported in part by the National Science Council under Grant No. NSC E-9-6-PAE. P. Lorenz and P. Dini (Eds.): ICN 25, LNCS 3421, pp , 25. c Springer-Verlag Berlin Heidelberg 25
2 Performance Improvement of Hardware-Based Packet 729 The rest of this paper is organized as follows. Section 2 introduces related works on packet classification and describes the ideas of Lucent BV, Aggregate Bit Vector (ABV) and Condensate Bit Vector (CBV) in details. Section 3 describes the main drawbacks of the CBV algorithm and presents CoBV and s. Section 4 evaluates the performance of the proposed scheme. Finally, Section 5 concludes the work. 2 Related Works Recently, researchers got more interested in the packet classification and had proposed several algorithms to solve the issue [2]. The related studies can be categorized into two classes: software-based and hardware-based. Several softwarebased schemes have been proposed in the literature such as grid of tries/crossproducting, tuple space search, recursive-flow classification, fat inverted segment trees, and hierarchical intelligent cuttings solutions [3 8]. The software-based solutions do not scale well in either time or storage, thus we focus on the hardwarebased solutions. In [9], Lakshman and Stiliadis proposed a scheme called. By constructing k one-dimensional tries, each prefix node in every one-dimensional trie is associated with a bit vector (bv). Each bit position maps to a corresponding policy in the database. The policy database is sorted by an descendent order of priority. By performing AND operation on all matched bv, the first matched result is the best matching policy. Since the length of bv increases proportional to the number of policies, the is only suitable for small-size policy databases. Baboescu et al. [1] proposed a bit-vector aggregation method to enhance the BV scheme. By adding aggregate bit vector (abv), the number of memory accesses is decreased significantly. While the improves the average speed of the BV scheme, it increases the required storage by appending extra abv for each bv as well. The CBV scheme [1] further improves the performance of ABV by merging multiple policies into one. Thus, both the speed and storage performance can be improved. The CBV scheme consists of three steps. In the first step, the prefixes extracted from the policies are used to construct the binary trie. For each onedimensional binary trie, the following procedure is executed to mark the subtrie root according to the pre-defined threshold. It checks whether the number of prefixes under the current node is equal to the threshold by traversing the binary trie with the depth first order. If yes, a subtrie root is marked. Otherwise, its left and right child nodes will be traversed recursively. Second, the prefixes in each policy are replaced by the bit-streams corresponding to the nearest ascending subtrie roots. Since new policies might be redundant, the duplicate copies are merged and the indices of the original policies are appended to the new policy. In the third step, the bvs are generated based on the new policies, namely cbv. Because the number of policies in the new database is reduced, the required bits
3 73 Y.-C. Chen et al. Table 1. Two-dimensional policy database with 16 rules Source Dest. Source Dest. Source Dest. Source Dest. Index Prefix Prefix Index Prefix Prefix Index Prefix Prefix Index Prefix Prefix F * 11* F 4 111* * F 8 1* 11* F 12 * 1* F 1 * * F 5 * 11* F 9 11* 1* F 13 11* 1* F 2 1* 1111* F 6 * 1111* F 1 * 11* F 14 1* * F 3 1* 1* F 7 1* 111* F 11 11* * F 15 * * Source Prefixes P * P 4 111* P 5 1* P 1 * P 6 11* P 2 1* 1 P 7 P 3 1* P 7 * P 1 P P 3 P P P 6 P Destination Prefixes P 11* P 5 11* P 6 111* P 1 * P 7 1* P * P 8 11* P 3 1* 11 P 4 * P 9 * P P 4 P 7 P P 3 P P 1 P 8 P 6 P (a) Source trie (b) Destination trie Fig. 1. Bit vectors constructed by BV and in each bit vector is less than that in the Lucent BV. Furthermore, the number of different prefixes in each dimension is reduced to generate fewer vectors. We use a two-dimensional policy (source prefix, destination prefix) database with 16 policies in Table 1 to illustrate the bit-vector construction of the Lucent BV, ABV and CBV schemes. The prefix nodes for the source and destination tries are depicted as the shady nodes in Fig. 1. Each prefix node in both tries is labeled with two bit vectors, bv (16 bits) and abv (4 bits). The bv length is equal to the number of policies in the database and the length of abv is altered by the aggregate size (4). For an incoming address pair (11, 111), uses the source address 11 to walk through the source trie and receives the bv value Similarly, it gets a bv value in the destination trie. Finally, performs an AND operation on these two bvs and obtains a result of 1 showing that the matched policy is F 12. With the, an AND operation on the abvs 1111 and 111 yields result 111. It indicates that the second 4-bit segment will not contain any set bits and could be ignored. Next, the procedures of CBV scheme is presented. Assuming that the number of clustered prefixes is 2. After performing the proposed algorithm to the trie in Fig. 1, the constructed subtrie roots are shown in Fig. 2. Each dark-gray circle represents the position of the subtrie root. Next, the original prefixes in each policy are replaced by the bit-streams corresponding to the nearest ascending subtrie roots. For example, F (, 11 ) in Table 1 is changed to (, 11 ), and F 6 (, 1111 ) is changed to (, 111 ). Some new policies are redundant,
4 Performance Improvement of Hardware-Based Packet 731 Condensed Source Prefixes P ' 1* P ' 1 * P ' 2 1* P ' 3 * P P P 3 P P Condensed Destination Prefixes P ' * P ' 1 1* 11 P ' 2 111* 1 3 P ' 11* P ' 4 * P P 4 11 P 7 P 3 P 5 11 P P P 6 P 4 P 1 P 8 P 6 P 2 (a) Source trie (b) Destination trie Fig. 2. Bit Vector Condensation Table 2. New Policy Database First Second Included First Second Included Index Dimension Dimension Policies Index Dimension Dimension Policies F * 11* F,F 5 F 5 * 111* F 6 F 1 * * F 1 F 6 1* 11* F 8 F 2 1* 111* F 2,F 7 F 7 1* * F 9,F 11 F 3 1* 1* F 3,F 13 F 8 * 1* F 1,F 12 F 4 1* * F 4,F 14 F 9 * * F 15 e.g. the new policies generated by F and F 5. These policies are merged, and their indices are appended to the new policy. Table 2 presents the new policy database. Then, the bv is constructed based on the new policy database. The 16-bit bvs is transformed into new 1-bit bvs, as shown in Fig. 2. In addition, the number of bvs is reduced from 18 to 9 with the proposed scheme. Also in Fig. 2, the condensate bit vector with aggregation is illustrated, namely condensate and aggregate bit vector (cabv). The aggregate size is defined as 4 in these cases. The construction of cabv follows the same procedure as that of abv. 3 Condensate Ordered Bit Vector (CoBV) As described above, the CBV scheme is simple and efficient. By merging policies according to their prefixes, the number of bit vectors and their lengths can be significantly reduced, hence the totally required storage is dramatically decreased. In addition, the CBV scheme combining ABV can further improve the performance of packet classification. Nevertheless, the native CBV scheme has two drawbacks. The first is the way that the CBV scheme clusters the policies. As described in the first step of cbv generation, the common prefixes of the original prefixes in the policies are selected from the binary trie. The threshold for the
5 732 Y.-C. Chen et al. common prefix selection is based on the number of successive prefixes in the binary trie. Nevertheless, each prefix might be referred by multiple filters, and the number of merged policies for each newly generated policies is difficult to manage. This might cause the worst-case search performance degraded since each merged policy of the matching new policies must be retrieved to decide whether it is a matched one. The second is that the policies in CBV do not follow the order of priority. This is because the CBV scheme clusters the policies according to the related position of their prefixes in the binary trie. Therefore, the policies with different priority may be clustered into one new policies and causes the generated policies difficult to sort. Therefore, each matched policies must be retrieved to decide the one with least cost. Consequently, the average search performance is decreased. However, the worst-case search performance is not affected since the whole cbv is traversed in the worst situation. The same phenomenon also occurs in ABV, where the policies are reordered in order to improve the performance of aggregation. Aiming to the two drawbacks described above, we propose two new ideas, clustering based on the number of filters and bit vector ordering, to improve the CBV scheme. Next, the detailed procedures of these two ideas are described. The first drawback is resolved by introducing a different threshold for prefix generating. The original CBV scheme generates prefixes according to the number of successive prefixes. However, the number of successive prefixes is less meaningful for packet classification since it only reflects one-dimensional information. To correct this, the number of filters, which refer to the successive prefixes, is used to decide whether the successive prefixes are clustered. The first step of CBV construction procedure is modified as follows. While constructing the binary tries, each prefix node is tagged with the number of referring policies. Next, the prefix generating procedure decides whether the current node is marked as a prefix by summing up the number of referring policies in every successive prefix. If the resulted value is larger than the predefined threshold, the current node is marked as a prefix node. The path from root to the prefix node is then extracted as a new prefix. To resolve the second drawback, we cluster only the policies with identical priority. The first step of CBV construction procedure is the same. After generating the prefixes according to the predefined threshold, the original prefixes in the policies are replaced by the newly generated prefixes. In the CBV scheme, the policies with identical prefixes are merged. The step is modified by only merging the policies with identical prefixes and priority. The resulted bit vector is called condensate ordered bit vector (cobv). Consequently, the search procedure can be terminated by retrieving the first matching policies. Hence the average search performance can be improved. However, the effect of policies clustering is reduced and might increase the required storage. To alleviate the storage expansion caused by cobv, a larger threshold for prefix generating is necessary. By combined the new procedures with bit aggregation, the condensate and aggregated ordered bit vector (caobv) is generated. In the next section, we demonstrate that CoBV and CAoBV outperform the existing schemes.
6 4 Performance Evaluation Performance Improvement of Hardware-Based Packet 733 In this section, we evaluate the performance of the CoBV and s and compare it with Lucent BV, ABV and CBV schemes. To test the scalability of our CBV scheme, the synthetic databases are used to evaluate whether CBV scheme could accommodate the future network service configurations. The synthetic databases are generated by randomly selecting the source and destination addresses in these 22 classifiers. The size of our synthetic databases varies from 1K to 1K. Assume that the memory word size and the aggregate size of ABV are both 32 bits, identical to the settings used in [1]. Two performance metrics are measured in our experiments: the storage requirement and the classification speed. The required storage mainly ties to the number of bit vectors and their length. The number of bit vectors is equal to the number of prefix nodes, while their lengths is identical to the number of policies. The speed of each packet classification is measured in terms of the number of memory accesses. In our experiments, the numbers of clustered filters are set to 32, 64, 128, 256. Since the numbers of clustered filters do not affect the Lucent BV and s, their storage requirement and speed will remain constant. In the 6, 6, 5, 5, 4, 3, 2, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, (a) Clustered filters = 32 (b) Clustered filters = 64 6, 6, 5, 5, 4, 3, 2, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, (c) Clustered filters = 128 (d) Clustered filters = 256 Fig. 3. Storage requirement in synthetic databases (lower is better)
7 734 Y.-C. Chen et al. 7, 7, 6, 5, 4, 3, 2, 6, 5, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, (a) Clustered filters = 32 (b) Clustered filters = 64 7, 7, 6, 5, 4, 3, 2, 6, 5, 4, 3, 2, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, (c) Clustered filters = 128 (d) Clustered filteres = 256 Fig. 4. Worst case memory access in synthetic databases (lower is better) following, the performance of CoBV and s are evaluated first. Then, a comparison with CBV/CABV is presented. First, the required storage of the proposed scheme for synthetic databases is presented. The characteristics of the synthetic databases are similar to that of the large real-world classifiers. Figure 3 shows the results for various settings. Since the prefixes in the synthetic databases are sampled uniformly, the slopes are quite smooth. Drastic increases in storage reduction can be seen as the number of clustered filters increases. In Fig. 4, we demonstrate the search performance of our schemes with synthetic classifiers. The number of memory accesses increases linearly as the size of classifier increases. Figure 4(a) and 4(b) show that the performance of the is similar to that of the. For the 8K-entry classifier, the effect of false match degrades the performance of the proposed schemes, as seen in Fig. 4(b). However, the superiority of the proposed schemes is demonstrated as the number of the clustered filters increases. In Fig. 4(c) and 4(d), the outperforms the. The performance of CBV and CABV is further compared with the proposed scheme based on synthetic databases. The various settings for CBV/CABV (p=2 or 4) and CoBV/CAoBV (f=128 or 256) are adopted since their properties are
8 Performance Improvement of Hardware-Based Packet , 6, 2, 15, 1, CBV scheme (p=2) C (p=2) CBV scheme (p=4) C (p=4) (f=128) (f=128) (f=256) (f=256) 5, 4, 3, 2, CBV scheme (p=2) C (p=2) CBV scheme (p=4) C (p=4) (f=128) (f=128) (f=256) (f=256) 5, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, (a) Storage Comparison (b) Speed Comparison Fig. 5. Comparisons with CBV and CABV quite different. As the number of clustered filter is large enough, the required storage of CoBV/CAoBV can be less than that of CBV/CABV. In the mean time, CoBV/s can also achieve better search performance. Therefore, CoBV/s can feature better scalability as compared with existing bit-vector algorithms. 5 Conclusions In this work, we proposed the condensate ordered bit vector to improve the classification performance of bit-vector algorithms. The ideas of CoBV include clustering based on the number of filters and bit vector ordering. While the first improves the worst-case search performance, and the second promotes the average performance. By demonstrating the performance based on real and synthetic policies databases, the CoBV and s can outperform CBV/CABV schemes and other existing bit-vector algorithms. In conclusion, the flexibility of CoBV/s can significantly improve the performance of packet classification for large policy databases. References 1. Chang, H., Chan, C., Wang, P., Lee, C.: A scalable hardware solution for packet classification. In: IEEE ICCS 24. (24) Gupta, P., Mckneown, N.: Algorithms for packet classification. In: IEEE Network Magazine. (21) Srinivasan, V., et al.: Fast and scalable level four switching. In: ACM SIGCOMM 98. (1998) Srinivasan, V., Suri, S., Varghese, G.: Packet classification using tuple space search. In: ACM SIGCOMM 99. (1999) Gupta, P., McKeown, N.: Packet classification on multiple fields. In: ACM SIG- COMM 99. (1999)
9 736 Y.-C. Chen et al. 6. Pankaj Gupta and Nick McKeown: Packet Classification using Hierarchical Intelligent Cuttings. IEEE Micro 2 (2) Anja Feldmann and S. Muthukrishnan: Tradeoffs for Packet Classification. In: IEEE INFOCOM. (2) Woo, T.Y.C.: A modular approach to packet classification: Algorithms and results. In: INFOCOM (3). (2) Lakshman, T., Stiliadis, D.: High-speed policy-based packet forwarding using efficient multi-demensional range matching. In: ACM SIGCOMM 98. (1998) Baboescu, F., Varghese, G.: Scalable packet classification. In: ACM SIGCOMM 1. (21)
Packet Classification Using Dynamically Generated Decision Trees
1 Packet Classification Using Dynamically Generated Decision Trees Yu-Chieh Cheng, Pi-Chung Wang Abstract Binary Search on Levels (BSOL) is a decision-tree algorithm for packet classification with superior
More informationScalable Packet Classification for IPv6 by Using Limited TCAMs
Scalable Packet Classification for IPv6 by Using Limited TCAMs Chia-Tai Chan 1, Pi-Chung Wang 1,Shuo-ChengHu 2, Chung-Liang Lee 1,and Rong-Chang Chen 3 1 Telecommunication Laboratories, Chunghwa Telecom
More informationSINCE the ever increasing dependency on the Internet, there
IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 6, DECEMBER 2006 1239 Scalable Packet Classification for Enabling Internet Differentiated Services Pi-Chung Wang, Member, IEEE, Chia-Tai Chan, Chun-Liang Lee,
More informationFast Packet Classification Algorithms
Fast Packet Classification Algorithms Mrudul Dixit, Anuja Kale, Madhavi Narote, Sneha Talwalkar, and B. V. Barbadekar Abstract A packet classifier possesses a set of rules for classifying packets based
More informationTree-Based Minimization of TCAM Entries for Packet Classification
Tree-Based Minimization of TCAM Entries for Packet Classification YanSunandMinSikKim School of Electrical Engineering and Computer Science Washington State University Pullman, Washington 99164-2752, U.S.A.
More informationAN EFFICIENT HYBRID ALGORITHM FOR MULTIDIMENSIONAL PACKET CLASSIFICATION
AN EFFICIENT HYBRID ALGORITHM FOR MULTIDIMENSIONAL PACKET CLASSIFICATION Yaxuan Qi 1 and Jun Li 1,2 1 Research Institute of Information Technology (RIIT), Tsinghua University, Beijing, China, 100084 2
More informationScalable IP Routing Lookup in Next Generation Network
Scalable IP Routing Lookup in Next Generation Network Chia-Tai Chan 1, Pi-Chung Wang 1,Shuo-ChengHu 2, Chung-Liang Lee 1, and Rong-Chang Chen 3 1 Telecommunication Laboratories, Chunghwa Telecom Co., Ltd.
More informationA Scalable Approach for Packet Classification Using Rule-Base Partition
CNIR Journal, Volume (5), Issue (1), Dec., 2005 A Scalable Approach for Packet Classification Using Rule-Base Partition Mr. S J Wagh 1 and Dr. T. R. Sontakke 2 [1] Assistant Professor in Information Technology,
More informationDESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER
International Journal of Computer Engineering and Applications, Volume VI, Issue II, May 14 www.ijcea.com ISSN 2321 3469 DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER Kiran K C 1, Sunil T D
More informationEfficient Packet Classification using Splay Tree Models
28 IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.5B, May 2006 Efficient Packet Classification using Splay Tree Models Srinivasan.T, Nivedita.M, Mahadevan.V Sri Venkateswara
More informationGrid of Segment Trees for Packet Classification
2010 24th IEEE International Conference on Advanced Information Networking and Applications Grid of Segment Trees for Packet Classification Yeim-Kuan Chang, Yung-Chieh Lin, and Chen-Yu Lin Department of
More informationTOWARDS EFFECTIVE PACKET CLASSIFICATION
TOWARDS EFFECTIVE PACKET CLASSIFICATION Yaxuan Qi 1 and Jun Li 1, 2 1 Research Institute of Information Technology (RIIT), Tsinghua University, Beijing, China, 100084 2 Tsinghua National Lab for Information
More informationDesign of a High Speed FPGA-Based Classifier for Efficient Packet Classification
Design of a High Speed FPGA-Based Classifier for Efficient Packet Classification V.S.Pallavi 1, Dr.D.Rukmani Devi 2 PG Scholar 1, Department of ECE, RMK Engineering College, Chennai, Tamil Nadu, India
More informationTowards Effective Packet Classification. J. Li, Y. Qi, and B. Xu Network Security Lab RIIT, Tsinghua University Dec, 2005
Towards Effective Packet Classification J. Li, Y. Qi, and B. Xu Network Security Lab RIIT, Tsinghua University Dec, 2005 Outline Algorithm Study Understanding Packet Classification Worst-case Complexity
More informationImplementation of Boundary Cutting Algorithm Using Packet Classification
Implementation of Boundary Cutting Algorithm Using Packet Classification Dasari Mallesh M.Tech Student Department of CSE Vignana Bharathi Institute of Technology, Hyderabad. ABSTRACT: Decision-tree-based
More informationPacket classification using diagonal-based tuple space search q
Computer Networks 50 (2006) 1406 1423 www.elsevier.com/locate/comnet Packet classification using diagonal-based tuple space search q Fu-Yuan Lee *, Shiuhpyng Shieh Department of Computer Science and Information
More informationPacket Classification using Rule Caching
Packet Classification using Rule Caching Nitesh B. Guinde, Roberto Rojas-Cessa and Sotirios G. Ziavras Electrical and Computer Engineering Department New Jersey Institute Technology Newark, NJ 72, USA
More informationPerformance Evaluation and Improvement of Algorithmic Approaches for Packet Classification
Performance Evaluation and Improvement of Algorithmic Approaches for Packet Classification Yaxuan Qi, Jun Li Research Institute of Information Technology (RIIT) Tsinghua University, Beijing, China, 100084
More informationMulti-core Implementation of Decomposition-based Packet Classification Algorithms 1
Multi-core Implementation of Decomposition-based Packet Classification Algorithms 1 Shijie Zhou, Yun R. Qu, and Viktor K. Prasanna Ming Hsieh Department of Electrical Engineering, University of Southern
More informationProblem Statement. Algorithm MinDPQ (contd.) Algorithm MinDPQ. Summary of Algorithm MinDPQ. Algorithm MinDPQ: Experimental Results.
Algorithms for Routing Lookups and Packet Classification October 3, 2000 High Level Outline Part I. Routing Lookups - Two lookup algorithms Part II. Packet Classification - One classification algorithm
More informationA Multi Gigabit FPGA-based 5-tuple classification system
A Multi Gigabit FPGA-based 5-tuple classification system Antonis Nikitakis Technical University of Crete, Department of Electronic and Computer Engineering Kounoupidiana, Chania, Crete, GR73100, Greece
More informationDesign of a Multi-Dimensional Packet Classifier for Network Processors
Design of a Multi-Dimensional Packet Classifier for Network Processors Stefano Giordano, Gregorio Procissi, Federico Rossi, Fabio Vitucci Dept. of Information Engineering, University of Pisa, ITALY E-mail:
More informationPacket Classification. George Varghese
Packet Classification George Varghese Original Motivation: Firewalls Firewalls use packet filtering to block say ssh and force access to web and mail via proxies. Still part of defense in depth today.
More informationECE697AA Lecture 21. Packet Classification
ECE697AA Lecture 21 Routers: Flow Classification Algorithms Tilman Wolf Department of Electrical and Computer Engineering 11/20/08 Packet Classification What is packet classification? Categorization of
More informationData Structures for Packet Classification
Presenter: Patrick Nicholson Department of Computer Science CS840 Topics in Data Structures Outline 1 The Problem 2 Hardware Solutions 3 Data Structures: 1D 4 Trie-Based Solutions Packet Classification
More informationITTC High-Performance Networking The University of Kansas EECS 881 Packet Switch I/O Processing
High-Performance Networking The University of Kansas EECS 881 Packet Switch I/O Processing James P.G. Sterbenz Department of Electrical Engineering & Computer Science Information Technology & Telecommunications
More informationFast and scalable conflict detection for packet classifiers
Computer Networks 42(2003) 717 735 www.elsevier.com/locate/comnet Fast and scalable conflict detection for packet classifiers F. Baboescu *, G. Varghese Department of Computer Science and Engineering,
More informationECE697AA Lecture 20. Forwarding Tables
ECE697AA Lecture 20 Routers: Prefix Lookup Algorithms Tilman Wolf Department of Electrical and Computer Engineering 11/14/08 Forwarding Tables Routing protocols involve a lot of information Path choices,
More informationThree Different Designs for Packet Classification
Three Different Designs for Packet Classification HATAM ABDOLI Computer Department Bu-Ali Sina University Shahid Fahmideh street, Hamadan IRAN abdoli@basu.ac.ir http://www.profs.basu.ac.ir/abdoli Abstract:
More informationAn Efficient IP Routing Lookup by Using Routing Interval
374 JOURNA OF COMMUNICATIONS AND NETWORKS, VO.3, NO.4, DECEMBER 21 An Efficient IP Routing ookup by Using Routing Interval Pi-Chung Wang, Chia-Tai Chan, and Yaw-Chung Chen Abstract: Nowadays, the commonly
More informationPerformance Evaluation of Cutting Algorithms for the Packet Classification in Next Generation Networks
Performance Evaluation of Cutting Algorithms for the Packet Classification in Next Generation Networks Abstract---Packet classification plays an important role in both edge and core routers to provide
More informationScalable Packet Classification on FPGA
Scalable Packet Classification on FPGA 1 Deepak K. Thakkar, 2 Dr. B. S. Agarkar 1 Student, 2 Professor 1 Electronics and Telecommunication Engineering, 1 Sanjivani college of Engineering, Kopargaon, India.
More informationRecursive Flow Classification: An Algorithm for Packet Classification on Multiple Fields
5 CHAPTER 4 Recursive Flow Classification: An Algorithm for Packet Classification on Multiple Fields Introduction Chapters 2 and 3 described algorithms for routing lookups. In this chapter and the next
More informationEVERY Internet router today can forward entering Internet
2 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 1, FEBRUARY 2005 Scalable Packet Classification Florin Baboescu and George Varghese, Member, IEEE Abstract Packet classification is important for applications
More informationForwarding and Routers : Computer Networking. Original IP Route Lookup. Outline
Forwarding and Routers 15-744: Computer Networking L-9 Router Algorithms IP lookup Longest prefix matching Classification Flow monitoring Readings [EVF3] Bitmap Algorithms for Active Flows on High Speed
More informationPacket Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut)
Research Journal of Recent Sciences ISSN 2277-2502 Res.J.Recent Sci. Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut) Abstract Hediyeh Amir Jahanshahi
More informationSelective Boundary Cutting For Packet Classification SOUMYA. K 1, CHANDRA SEKHAR. M 2
ISSN 2319-8885 Vol.04,Issue.34, August-2015, Pages:6786-6790 www.ijsetr.com SOUMYA. K 1, CHANDRA SEKHAR. M 2 1 Navodaya Institute of Technology, Raichur, Karnataka, India, E-mail: Keerthisree1112@gmail.com.
More informationHardware Assisted Recursive Packet Classification Module for IPv6 etworks ABSTRACT
Hardware Assisted Recursive Packet Classification Module for IPv6 etworks Shivvasangari Subramani [shivva1@umbc.edu] Department of Computer Science and Electrical Engineering University of Maryland Baltimore
More informationPacket Classification via Improved Space Decomposition Techniques
1 Packet Classification via Improved Space Decomposition Techniques Filippo Geraci, Marco Pellegrini, Paolo Pisati IIT-CNR, Pisa, filippo.geraci,marco.pellegrini,paolo.pisati @iit.cnr.it Luigi Rizzo Dip.Ing.Informazione,
More informationHierarchical Intelligent Cuttings: A Dynamic Multi-dimensional Packet Classification Algorithm
161 CHAPTER 5 Hierarchical Intelligent Cuttings: A Dynamic Multi-dimensional Packet Classification Algorithm 1 Introduction We saw in the previous chapter that real-life classifiers exhibit structure and
More informationDisjoint Superposition for Reduction of Conjoined Prefixes in IP Lookup for Actual IPv6 Forwarding Tables
Disjoint Superposition for Reduction of Conjoined Prefixes in IP Lookup for Actual IPv6 Forwarding Tables Roberto Rojas-Cessa, Taweesak Kijkanjanarat, Wara Wangchai, Krutika Patil, Narathip Thirapittayatakul
More informationPacket Classification Using Standard Access Control List
Packet Classification Using Standard Access Control List S.Mythrei 1, R.Dharmaraj 2 PG Student, Dept of CSE, Sri Vidya College of engineering and technology, Virudhunagar, Tamilnadu, India 1 Research Scholar,
More informationHybridCuts: A Scheme Combining Decomposition and Cutting for Packet Classification
2013 IEEE 21st Annual Symposium on High-Performance Interconnects HybridCuts: A Scheme Combining Decomposition and Cutting for Packet Classification Wenjun Li (liwenjun@sz.pku.edu.cn), Xianfeng Li (lixianfeng@pkusz.edu.cn)
More informationAll-Match Based Complete Redundancy Removal for Packet Classifiers in TCAMs
All-Match Based Complete for Packet Classifiers in TCAMs Alex X Liu Chad R Meiners Yun Zhou Department of Computer Science and Engineering Michigan State University East Lansing, MI 48823, USA {alexliu,
More informationComputer Networks 56 (2012) Contents lists available at SciVerse ScienceDirect. Computer Networks
Computer Networks 56 (2012) 3010 3022 Contents lists available at SciVerse ScienceDirect Computer Networks journal homepage: www.elsevier.com/locate/comnet A new hierarchical packet classification algorithm
More informationPacket Classification: From Theory to Practice
Packet Classification: From Theory to Practice Jun Li Most contributions from Yaxuan Qi and many other students of mine Tsinghua Univ., Beijing, China Outline Packet Classification Introduction Review
More informationPriority Area-based Quad-Tree Packet Classification Algorithm and Its Mathematical Framework
Appl. Math. Inf. Sci. 7, No. 1, 9-20 (2013) 9 Applied Mathematics & Information Sciences An International Journal Priority Area-based Quad-Tree Packet Classification Algorithm and Its Mathematical Framework
More informationA New Approach to Determining the Time-Stamping Counter's Overhead on the Pentium Pro Processors *
A New Approach to Determining the Time-Stamping Counter's Overhead on the Pentium Pro Processors * Hsin-Ta Chiao and Shyan-Ming Yuan Department of Computer and Information Science National Chiao Tung University
More informationReview on Tries for IPv6 Lookups
Available online www.ejaet.com European Journal of Advances in Engineering and Technology, 2016, 3(7): 28-33 Review Article ISSN: 2394-658X Review on Tries for IPv6 Lookups Rohit G Bal Department of Computer
More informationFast Packet Classification Using Bloom filters
Fast Packet Classification Using Bloom filters Sarang Dharmapurikar Haoyu Song Jonathan Turner John Lockwood sarang@arl.wustl.edu hs@arl.wustl.edu jst@arl.wustl.edu lockwood@arl.wustl.edu Washington University
More informationincrementally update the data structure on insertion or deletion of classification rules. An algorithm that supports incremental updates is said to be
Dynamic Algorithms with Worst-case Performance for Packet Classification Pankaj Gupta 1 and Nick McKeown 1 Computer Systems Laboratory, Stanford University Stanford, CA 94305-9030 fpankaj, nickmg@stanford.edu
More informationToward Predictable Performance in Decision Tree based Packet Classification Algorithms
Toward Predictable Performance in Decision Tree based Packet Classification Algorithms Peng He, Hongtao Guan, Laurent Mathy, Kavé Salamatian Gaogang Xie Institute of Computing Technology, Chinese Academy
More informationDynamic Routing Tables Using Simple Balanced. Search Trees
Dynamic Routing Tables Using Simple Balanced Search Trees Y.-K. Chang and Y.-C. Lin Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan R.O.C. ykchang@mail.ncku.edu.tw
More informationFast Firewall Implementations for Software and Hardware-based Routers
Fast Firewall Implementations for Software and Hardware-based Routers Lili Qiu George Varghese Subhash Suri liliq@microsoft.com varghese@cs.ucsd.edu suri@cs.ucsb.edu Microsoft Research University of California,
More informationHierarchical Addressing and Routing Mechanisms for Distributed Applications over Heterogeneous Networks
Hierarchical Addressing and Routing Mechanisms for Distributed Applications over Heterogeneous Networks Damien Magoni Université Louis Pasteur LSIIT magoni@dpt-info.u-strasbg.fr Abstract. Although distributed
More informationImproved Classification of Known and Unknown Network Traffic Flows using Semi-Supervised Machine Learning
Improved Classification of Known and Unknown Network Traffic Flows using Semi-Supervised Machine Learning Timothy Glennan, Christopher Leckie, Sarah M. Erfani Department of Computing and Information Systems,
More informationEfficient TCAM Encoding Schemes for Packet Classification using Gray Code
Efficient TCAM Encoding Schemes for Packet Classification using Gray Code Yeim-Kuan Chang and Cheng-Chien Su Department of Computer Science and Information Engineering National Cheng Kung University Tainan,
More informationQuadrant-Based MBR-Tree Indexing Technique for Range Query Over HBase
Quadrant-Based MBR-Tree Indexing Technique for Range Query Over HBase Bumjoon Jo and Sungwon Jung (&) Department of Computer Science and Engineering, Sogang University, 35 Baekbeom-ro, Mapo-gu, Seoul 04107,
More informationA Tree-based Inverted File for Fast Ranked-Document Retrieval
A Tree-based Inverted File for Fast Ranked-Document Retrieval Wann-Yun Shieh Tien-Fu Chen Chung-Ping Chung Department of Computer Science and Information Engineering National Chiao Tung University Hsinchu,
More informationMemory-Efficient 5D Packet Classification At 40 Gbps
Memory-Efficient 5D Packet Classification At 40 Gbps Ioannis Papaefstathiou ECE Department, Technical University of Crete, Kounoupidiana, Chania, Crete, GR73100, Greece ygp@ece.tuc.gr Vassilis Papaefstathiou
More informationImproving Suffix Tree Clustering Algorithm for Web Documents
International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2015) Improving Suffix Tree Clustering Algorithm for Web Documents Yan Zhuang Computer Center East China Normal
More informationRouting Lookup Algorithm for IPv6 using Hash Tables
Routing Lookup Algorithm for IPv6 using Hash Tables Peter Korppoey, John Smith, Department of Electronics Engineering, New Mexico State University-Main Campus Abstract: After analyzing of existing routing
More informationRule Caching for Packet Classification Support
Rule Caching for Packet Classification Support Joji Philip, Manish Taneja, and Roberto Rojas-Cessa Abstract The growth of the Internet and requirements for enhanced flexibility and versatility have resulted
More informationSplitter Placement in All-Optical WDM Networks
plitter Placement in All-Optical WDM Networks Hwa-Chun Lin Department of Computer cience National Tsing Hua University Hsinchu 3003, TAIWAN heng-wei Wang Institute of Communications Engineering National
More informationTrie-Based Policy Representations for Network Firewalls
Trie-Based Policy Representations for Network Firewalls Errin W. Fulp and Stephen J. Tarsa Wake Forest University Department of Computer Science Winston-Salem, NC, USA nsg.cs.wfu.edu {fulp tarssj2}@wfu.edu
More informationPacket Classification Algorithms: A Survey
Packet Classification Algorithms: A Survey Evangeline Asha B 1, Kavitha S 2 1 PG Scholar, Hindusthan Institute of Technology, Coimbatore, Tamil Nadu, India 2 Professor, Hindusthan Institute of Technology,
More informationFast Update of Forwarding Tables in Internet Router Using AS Numbers Λ
Fast Update of Forwarding Tables in Internet Router Using AS Numbers Λ Heonsoo Lee, Seokjae Ha, and Yanghee Choi School of Computer Science and Engineering Seoul National University San 56-1, Shilim-dong,
More informationAchieving Distributed Buffering in Multi-path Routing using Fair Allocation
Achieving Distributed Buffering in Multi-path Routing using Fair Allocation Ali Al-Dhaher, Tricha Anjali Department of Electrical and Computer Engineering Illinois Institute of Technology Chicago, Illinois
More informationAn Efficient Parallel IP Lookup Technique for IPv6 Routers Using Multiple Hashing with Ternary marker storage
An Efficient Parallel IP Lookup Technique for IPv Routers Using Multiple Hashing with Ternary marker storage P. Kiran Sree Dr. Inampudi Ramesh Babu Mr. P.Kiran Sree,Associate Professor, Department of Computer
More informationK-Means Based Matching Algorithm for Multi-Resolution Feature Descriptors
K-Means Based Matching Algorithm for Multi-Resolution Feature Descriptors Shao-Tzu Huang, Chen-Chien Hsu, Wei-Yen Wang International Science Index, Electrical and Computer Engineering waset.org/publication/0007607
More informationAlgorithms for Packet Classification
Algorithms for Packet Classification Pankaj Gupta and Nick McKeown, Stanford University Abstract The process of categorizing packets into flows in an Internet router is called packet classification. All
More informationNew Optimal Load Allocation for Scheduling Divisible Data Grid Applications
New Optimal Load Allocation for Scheduling Divisible Data Grid Applications M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam Department of Communication Technology and Network, University Putra Malaysia,
More informationTRIE BASED METHODS FOR STRING SIMILARTIY JOINS
TRIE BASED METHODS FOR STRING SIMILARTIY JOINS Venkat Charan Varma Buddharaju #10498995 Department of Computer and Information Science University of MIssissippi ENGR-654 INFORMATION SYSTEM PRINCIPLES RESEARCH
More informationMulti-Field Range Encoding for Packet Classification in TCAM
This paper was presented as part of the Mini-Conference at IEEE INFOCOM 2011 Multi-Field Range Encoding for Packet Classification in TCAM Yeim-Kuan Chang, Chun-I Lee and Cheng-Chien Su Department of Computer
More informationImproving Packing Algorithms for Server Consolidation
Improving Packing Algorithms for Server Consolidation YASUHIRO A JIRO, ATSUHIRO TANAKA SYSTEM PLATFORMS RESEARCH LABORATORIES, NEC CORPORATION PRESENTED BY : BASIL ALHAKAMI Content Introduction. Background
More informationTexture classification using fuzzy uncertainty texture spectrum
Neurocomputing 20 (1998) 115 122 Texture classification using fuzzy uncertainty texture spectrum Yih-Gong Lee*, Jia-Hong Lee, Yuang-Cheh Hsueh Department of Computer and Information Science, National Chiao
More informationDynamic Load-balanced Path Optimization in SDN-based Data Center Networks
Dynamic Load-balanced Path Optimization in SDN-based Data Center Networks Yuan-Liang Lan Department of Computer Science National Chiao Tung University Hsinchu, Taiwan kmntree@gmail.com Kuochen Wang and
More informationRD-TCP: Reorder Detecting TCP
RD-TCP: Reorder Detecting TCP Arjuna Sathiaseelan and Tomasz Radzik Department of Computer Science, King s College London, Strand, London WC2R 2LS {arjuna,radzik}@dcs.kcl.ac.uk Abstract. Numerous studies
More informationEfficient Construction Of Variable-Stride Multibit Tries For IP Lookup
" Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup Sartaj Sahni & Kun Suk Kim sahni, kskim @ciseufledu Department of Computer and Information Science and Engineering University of
More informationOVSF Code Tree Management for UMTS with Dynamic Resource Allocation and Class-Based QoS Provision
OVSF Code Tree Management for UMTS with Dynamic Resource Allocation and Class-Based QoS Provision Huei-Wen Ferng, Jin-Hui Lin, Yuan-Cheng Lai, and Yung-Ching Chen Department of Computer Science and Information
More information12 Abstract Data Types
12 Abstract Data Types 12.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT). Define
More informationCS 268: Route Lookup and Packet Classification
Overview CS 268: Route Lookup and Packet Classification Packet Lookup Packet Classification Ion Stoica March 3, 24 istoica@cs.berkeley.edu 2 Lookup Problem Identify the output interface to forward an incoming
More informationGeneric Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture
Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,
More informationHomework 1 Solutions:
Homework 1 Solutions: If we expand the square in the statistic, we get three terms that have to be summed for each i: (ExpectedFrequency[i]), (2ObservedFrequency[i]) and (ObservedFrequency[i])2 / Expected
More informationA Firewall Application Using Binary Decision Diagram
2017 2nd International Conference on Computer, Network Security and Communication Engineering (CNSCE 2017) ISBN: 978-1-60595-439-4 A Firewall Application Using Binary Decision Diagram Jun-feng ZHAO 1,
More informationPC-DUOS: Fast TCAM Lookup and Update for Packet Classifiers
PC-DUOS: Fast TCAM Lookup and Update for Packet Classifiers Tania Mishra and Sartaj Sahni Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL 326 {tmishra,
More informationSurvey and Taxonomy of Packet Classification Techniques
Survey and Taxonomy of Packet Classification Techniques DAVID E. TAYLOR Applied Research Laboratory Washington University in Saint Louis Packet classification is an enabling function for a variety of Internet
More informationAnalysis of Algorithms
Algorithm An algorithm is a procedure or formula for solving a problem, based on conducting a sequence of specified actions. A computer program can be viewed as an elaborate algorithm. In mathematics and
More informationAuto Finding and Resolving Distributed Firewall Policy
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 10, Issue 5 (Mar. - Apr. 2013), PP 56-60 Auto Finding and Resolving Distributed Firewall Policy Arunkumar.k 1,
More informationRobustness of Selective Desensitization Perceptron Against Irrelevant and Partially Relevant Features in Pattern Classification
Robustness of Selective Desensitization Perceptron Against Irrelevant and Partially Relevant Features in Pattern Classification Tomohiro Tanno, Kazumasa Horie, Jun Izawa, and Masahiko Morita University
More informationCHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION
CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION 6.1 INTRODUCTION Fuzzy logic based computational techniques are becoming increasingly important in the medical image analysis arena. The significant
More informationADAPTIVE LINK WEIGHT ASSIGNMENT AND RANDOM EARLY BLOCKING ALGORITHM FOR DYNAMIC ROUTING IN WDM NETWORKS
ADAPTIVE LINK WEIGHT ASSIGNMENT AND RANDOM EARLY BLOCKING ALGORITHM FOR DYNAMIC ROUTING IN WDM NETWORKS Ching-Lung Chang, Yan-Ying, Lee, and Steven S. W. Lee* Department of Electronic Engineering, National
More informationAn Admission Control and Deployment Optimization Algorithm for an Implemented Distributed Bandwidth Broker in a Simulation Environment
An Admission Control and Deployment Optimization Algorithm for an Implemented Distributed Bandwidth Broker in a Simulation Environment Christos Bouras and Dimitris Primpas Research Academic Computer Technology
More informationQuestion Bank Subject: Advanced Data Structures Class: SE Computer
Question Bank Subject: Advanced Data Structures Class: SE Computer Question1: Write a non recursive pseudo code for post order traversal of binary tree Answer: Pseudo Code: 1. Push root into Stack_One.
More informationParallel-Search Trie-based Scheme for Fast IP Lookup
Parallel-Search Trie-based Scheme for Fast IP Lookup Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, Lin Cai, and Nirwan Ansari Department of Electrical and Computer Engineering, New Jersey Institute
More informationRouter Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13
Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13 Department of Electrical Engineering and Computer Sciences University of California Berkeley Review: Switch Architectures Input Queued
More informationMining Top-K Path Traversal Patterns over Streaming Web Click-Sequences *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 25, 1121-1133 (2009) Mining Top-K Path Traversal Patterns over Streaming Web Click-Sequences * HUA-FU LI 1,2 AND SUH-YIN LEE 2 1 Department of Computer Science
More informationClassBench: A Packet Classification Benchmark. By: Mehdi Sabzevari
ClassBench: A Packet Classification Benchmark By: Mehdi Sabzevari 1 Outline INTRODUCTION ANALYSIS OF REAL FILTER SETS - Understanding Filter Composition - Application Specifications - Address Prefix Pairs
More informationQoS Multicasting over Mobile Networks
As the number of mobile devices and the kinds of mobile applications explosively increases, the device types become diverse, and mobile networks are prone to be Heterogeneous. Broadcast/Multicast users
More informationEECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
More information