DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER
|
|
- Oswald Flynn
- 6 years ago
- Views:
Transcription
1 International Journal of Computer Engineering and Applications, Volume VI, Issue II, May 14 ISSN DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER Kiran K C 1, Sunil T D 2, Dr. M Z Kurian th semester, M.Tech (Digital Electronics), SSIT, Tumkur, Karnataka (kiran) 2 Assistant Professor, Dept. of ECE, SSIT, Tumkur, Karnataka. H. O. D, Dept. of ECE, SSIT, Tumkur, Karnataka ABSTRACT: Packet classification is used by networking equipment to sort packets into flows by comparing their headers to a list of rules, packets are placed in the flow specified by the matched rule. Flow determined is used to decide a packet s priority and the manner in which it is processed. Here the concept of HyperCut algorithm is used to implement the classifier by using the indexing method. Keywords: Hicut, Hypercut, modular packet classification, RFC,BV,Tuple space search, indexing [1] INTRODUCTION There is a huge increase in Internet usage because of its ease of access through a wide range of devices such as desktops, notebooks, tablets, and smartphones, which puts a real strain on the networking equipment needed to inspect and process the resultant traffic. A survey carried out [1] showed how this simple access has allowed Internet penetration to reach 32.7% of the world s population by December 2011, with the number of Internet users growing by 528% between 2000 and This survey also showed that the U.S. had over 108 million internet users in 2000 and now it is 2.2 billion in 2001, which is important when considering that the total amount of energy used in the year 2000 by various networking devices in the U.S. equated to the yearly output of a typical nuclear reactor unit. This means that the current amount of energy used by networking devices worldwide could exceed the yearly output of 21 nuclear reactor units. Power consumption should, therefore, be a key concern when designing any new networking equipment for the purpose of processing the ever-increasing amount of network traffic. Network processors are key components used to process packets as they pass through a network, carrying out tasks such as packet fragmentation and reassembly, encryption, forwarding, and classification. The growing number of tasks that need to be carried out, along with the increase in line rates, have placed the network processor under increased pressure. Relieving this pressure through the addition of extra processing capacity is not easy due to factors such as silicon limitations and tight power budgets. Ramping up clock speeds to gain extra performance is difficult due to physical limitations in the silicon used to create these devices, while increasing the number of processing cores can cause difficulty when it comes to writing the software needed to control the network processors. Both these approaches also lead Kiran K C, Sunil T D and Dr M Z Kurian. 87
2 DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER to large increases in power consumption due to the extra heat generated by increasing the clock speed and the extra transistors needed to increase the number of processing cores. [2] RELATED WORK Packet classification is used by networking equipment to sort packets into flows by comparing their headers to a list of rules.the packets are placed in the way determined by the matched rule. A flow is used to decide a packet s priority and the manner in which it is processed. In order to classify a packet, a router consults a table (or classifier) using one or more fields from the packet header to search for the corresponding flow. Packet classification algorithms can be classified based on the method of classification, as shown in the [Table - 1] below Type Algorithm HiCuts Decision tree based Modular packet classification HyperCuts RFC Decomposition Based Hash Based BV Tuple Space Search Table 1:packet classification algorithms 2.1 Packet Classification using Hierarchical Intelligent Cuttings (HiCuts) The HiCut algorithm[2] works by carefully preprocessing the classifier to build a decision tree data structure. Each time a packet arrives, the decision tree is traversed to find a leaf node, which stores a small number of rules. A linear search among these rules yields the desired matching. The shape and depth of the decision tree as well as the local decisions to be made at each node in the tree are chosen when the search tree is built. The following [Figure 1] illustrates an example of the decision-tree construction for a 2D filter set. On the plane there are five rectangles, each of them representing a filter. At the first step, cut is made along the x-axis to generate 4 sub-regions. At the following steps, select two of these sub-regions to cut along the y-axis and x-axis,. Now each sub-region overlaps 2 rectangles. If it is decided that it is affordable to do a linear search on at most 2 filters, cutting can be stopped. 88
3 International Journal of Computer Engineering and Applications, Volume VI, Issue II, May 14 ISSN Figure 1: Decision-tree construction for a 2D filter set. The number of decision tree nodes and the number of stored filters determine the storage of the algorithm data structure, and the depth of the decision tree and the number of filters in the leaf nodes determine the worst-case lookup throughput. 2.2 Modular Packet Classification This algorithm [3] practically approaches the problem of packet classification. Specifically, algorithm proposes to study a novel approach to packet classification which combines heuristic tree search with the use of filter buckets. It has high performance and economic storage requirement, algorithm is unique in the sense that it can adapt to the input packet distribution by taking into account the relative filter usage. In the first step,algorithm tries to eliminates as many filters as possible by examining specific bit positions.instead of eliminating all, the first step will be terminated when the set of remaining filters is less than some pre-specified maximum. This set of filters is called as filter bucket. This early termination avoids the explosion that is often the result of trying to completely differentiate between a few similar filters. In the second step, the filter bucket is processed to find a match. Due to the the limited size of a filter bucket, a completely different procedure can be used. In essence, algorithm is a modular composition of two procedures: the first to decompose large filter table into small filter buckets of a fixed maximum size, and the second procedure is to process filter buckets of limited size to find a match. 2.3 HyperCuts Similar to the previous best known algorithm, HiCuts, HyperCuts [4] is based on a decision tree structure. In HiCuts, each node in the decision tree represents a hyperplane. But in HyperCut each node in the decision tree represents a k--dimensional hypercube. Using this extra degree of freedom and a new set of heuristics to find optimal hypercubes for a given amount of storage, Hyper-Cuts can provide an order of magnitude improvement over existing classification algorithms. HyperCuts uses less memory than HiCuts optimized for memory, while the worst case search time of HyperCuts is % better than that of HiCuts optimized for speed. An example of a two dimensional classifier is shown in [Figure 2] with 4 rules: R1.R4. Each rule is represented by a rectangle in two dimensional space. The left figure shows the action of HiCuts. HiCuts builds a decision tree using local optimization decisions at each node to choose the next dimension of test, to see how many cuts to make in the chosen dimension. The leaves of the HiCuts tree store a list of rules that may match the search path to the leaf. The left part of [Figure 2] shows how the HiCuts algorithm works on the example rule set. Kiran K C, Sunil T D and Dr M Z Kurian. 89
4 DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER Figure - 2: HiCuts vs. HyperCuts. Assuming the maximum number of rules held in a leaf is 1, no matter how many cuts are going to be executed at a time, the HiCuts algorithm requires at least two levels in the decision tree. The HyperCuts algorithm introduced here eliminates this limitation in HiCuts by introducing one more degree of freedom. Each node in the decision tree represents a decision taken on the most representative dimensions, as opposed to using only a single dimension. For each of the chosen dimensions, the number of cuts is computed based on conditions dependent on the amount of space that is available for the search structure. In the example in [Figure 2] Hyper-Cuts (on the right) cuts the plane into four squares with one direct cut, reducing the height of the decision tree to Recursive Flow Classification(RFC) RFC [5] is a heuristic for packet classification on multiple fields. Classifying a packetinvolves mapping s-bits in the packet header to a T bit action identifier, where T=log N,T<<S. A simple, but impractical method could pre-compute the action for each of 2^s the different packet headers, yielding the action in one step. RFC attempts to perform the same mapping over several phases. At each stage the algorithm maps one set of values to a smaller set. In each phase a set of memories return a value shorter (i.e., expressed in fewer bits) than the index of the memory access. The algorithm, illustrated in [Figure 3], which operates as follows: In the first phase, fields of the packet header are split up into multiple chunks that are used to index into multiple memories in parallel. The contents of each memory are chosen so that the result of the lookup is narrower than the index. In subsequent phases, memories are indexed using the results from earlier phases. In the final phase, the memory yields the action. The algorithm requires construction of the contents of each memory. 90
5 International Journal of Computer Engineering and Applications, Volume VI, Issue II, May 14 ISSN Figure 3: Packet flow in RFC 2.5 BV(Bit Vector) search algorithm The bit vector[6] scheme is a form of divide-and conquer which divides the packet classification problem into k subproblems, and then combines the results. To do so, first build k one-dimensional tries associated with each dimension (field) in the original database. It is assume that ranges are either handled using a range tree instead of a trie, or by converting ranges to tries. An N bit vector is associated with each node of the trie corresponding to a valid prefix. ( N is the total number of rules). The [Figure 5] shows the construction for the simple two dimensional example conditions in [Figure - 4]. For example, in [Figure - 4], the second rule F1 has 00* in the first field. Thus, the leftmost node in the trie for the first field corresponds to 00*. Similarly, the Field 1 trie contains a node for all distinct prefixes in Field 1 of Figure 4 such as 00*, 10*, 11*,1*, and 0*. Figure - 4: A simple example with 11 rules on two fields Kiran K C, Sunil T D and Dr M Z Kurian. 91
6 DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER Figure - 5: Two tries associated with each of the fields in the database of Figure Tuple space search It is a generic packet classification algorithm, called as Tuple Space Search (TSS)[7]. Because real databases typically use only a small number of distinct field lengths.it maps the filters to tuples a simple linear search of the tuple space can provide a good speedup over naive linear search over the filters. Each tuple is maintained as a hash table that can be searched in one memory access. Then introduced the techniques for further refining the search of the tuple space, and demonstrate their effectiveness on some firewall databases. [3] RECEIVER AND RAM IMPLEMENTATION Implementation is the process of converting a new system design into an operational one. It is the key stage in achieving a successful new system. It must therefore be carefully planned and controlled. The implementation of a system is done after the development effort is completed. The overall implementation of optimized low-power packet classification on FPGA can be done as Implementing Receiver unit Implementing RAM Unit 3.1 Implementation of receiver RTL schematic of the receiver is as shown in the [Figure - 6]. input data at data_in is moved to the data_out. Output is generated only at the rising edge of the clock.sop(start of packet), eop(end of packet) and rst are the control signals. 92
7 International Journal of Computer Engineering and Applications, Volume VI, Issue II, May 14 ISSN Figure - 6: RTL schematic view of receiver The receiver is executed in Verilog and the results are observed in the simulink software as shown in [Figure 7]. The data decimal 19 at the input data_in is moved to the output data_out. Figure - 7: Simulation of reciever 3.2 Implementation of RAM RAM is also known as Random Access Memory. A random-access memory device allows stored data to be accessed quickly in any random order. One can read and over-write data in RAM.RAM modules are register arrays in which one operation on one register can be performed at a time. RAM is normally used for storing large data sets. RTL schematic of RAM is as shown in [Figure 8]. DI and DO are the data in and data out respectively. WE is write enable signal. Kiran K C, Sunil T D and Dr M Z Kurian. 93
8 DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER Figure - 8: RTL schematic view of RAM The implementation of 76X8 RAM is described in this section. This RAM module is used to store different constraints like environmental constraints, UAV constraints, mission constraints and also to store parent and offspring solutions. This RAM module is implemented using Verilog HDL. [Figure 8] shows the inputs and outputs of the RAM. Since the address is of 8 bits there are 256 memory locations to store the data. When the clock is high and reset is low, the data is stored or retrieved depending on the rd_wr signal. When rd_wr is high the data is read from the memory and when rd_wr is low the data is written into the memory. Resultant waveforms are shown in [Figure 9], where received packets at the input are stored in the RAM memory. Packets from the receiver are stored in the different memory locations of RAM, stored packets can be read from the locations when WE signal becomes zero. DO signal waveform show the read output from the RAM. Figure - 9: Simulation of RAM [4] INDEXING As the packet header consists of different fields like Source IP (SIP), Destination IP (DIP), source port number, destination port number and protocol type, these fields are used to classify the packets. Classification is carried out by taking the concept of dividing the header 94
9 International Journal of Computer Engineering and Applications, Volume VI, Issue II, May 14 ISSN fields into hypercube from the hypercut algorithm. In indexing process different ranges in the header fields are defined and an index for the particular range is assigned. As shown in [Figure -10], four bit SIP and DIP are considered for classification, different ranges of IP addresses are indexed into a four bit number. Index is later used in the classifier to move the packets into different locations. Figure - 10: Indexing of header fields [6] CLASSIFIER Packet is considered for 32 bit data, as the packet enters into the classifier the index for that packet is examined and according to the index assigned packet is moved to the different memory locations. As shown in [Figure 11] packet at data_in is moved to one of the location at the output according to the index specified. As the index is changed the output will appear at another location. Figure 11: Classification using index [6] CONCLUSION Kiran K C, Sunil T D and Dr M Z Kurian. 95
10 DESIGN AND IMPLEMENTATION OF OPTIMIZED PACKET CLASSIFIER In this paper different algorithms for software approaches of packet classification are discussed. Packet classification can be implemented in the core of the network and hence improving the speed and security. A classifier is designed and implemented using the method of indexing. REFERENCES [1] Usage and Population Statistics.(2012,Jun.) [Online].Available: [2] P. Gupta and N. McKeown, Packet classification using hierarchical intelligent cuttings, IEEE Micro, vol. 20, no. 1, pp , Feb [3] T. Woo, A modular approach to packet classification: Algorithms and results, in Proc. IEEE Int. Conf. Comput. Commun., Mar. 2000, pp [4] S. Singh, F. Baboescu, G. Varghese, and J. Wang, Packet classification using multidimensional cutting, in Proc. ACM Special Interest Group Data Commun. Conf., Aug. 2003, pp [5] P. Gupta and N. McKeown, Packet classification on multiple fields, in Proc. ACM Special Interest Group Data Commun. Conf., Sep. 1999, pp [6] T. V. Lakshman and D. Stiliadis, High-speed policy based packet forwarding using efficient multi-dimensional range matching, in Proc. ACM Special Interest Group Data Commun. Conf., Sep. 1998, pp [7] V. Srinivasan, S. Suri, and G. Varghese, Packet classification using tuple space search, in Proc. ACM Special Interest Group Data Commun.Conf., Sep. 1999, pp [8] A. Kennedy, D. Bermingham, X. Wang, and B. Liu, Power analysis of packet classification on programmable network processors, in Proc. EE Int. Conf. Signal Process. Commun., Nov. 2007, pp
Design 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 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 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 informationPacket 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 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 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 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 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 informationMULTI-MATCH PACKET CLASSIFICATION BASED ON DISTRIBUTED HASHTABLE
International Journal of Science, Environment and Technology, Vol. 4, No 4, 2015, 1098 1106 ISSN 2278-3687 (O) 2277-663X (P) MULTI-MATCH PACKET CLASSIFICATION BASED ON DISTRIBUTED HASHTABLE 1 Neeshma K
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 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 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 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 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 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 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 informationPerformance Improvement of Hardware-Based Packet Classification Algorithm
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,
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 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 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 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 informationTowards High-performance Flow-level level Packet Processing on Multi-core Network Processors
Towards High-performance Flow-level level Packet Processing on Multi-core Network Processors Yaxuan Qi (presenter), Bo Xu, Fei He, Baohua Yang, Jianming Yu and Jun Li ANCS 2007, Orlando, USA Outline Introduction
More informationA STUDY & COMPARATIVE EVALUATION OF PACKET CLASSIFICATION ALGORITHMS
A STUDY & COMPARATIVE EVALUATION OF PACKET CLASSIFICATION ALGORITHMS HEDIYEH AMIRJAHANSHAHI SISTANI Department of Computer Studies and Research, Symbiosis International University, Pune, India Email: hediehamirjahanshahi@yahoo.com
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 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 informationDesign and Implementation of DPI Mechanism for NIDS on FPGA
Design and Implementation of DPI Mechanism for NIDS on FPGA Veena M P 1, Divya Prabha 2, Dr. M Z Kurian 3 M.Tech [Digital electronics], Sri Siddhartha Institute of Technology, Tumkur, Karnataka, India
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 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 informationEfficient Packet Classification on FPGAs also Targeting at Manageable Memory Consumption
Efficient Packet Classification on FPGAs also Targeting at Manageable Memory Consumption Nitesh Guinde, Sotirios G. Ziavras and Roberto Rojas-Cessa Department of Electrical and Computer Engineering New
More informationABC: Adaptive Binary Cuttings for Multidimensional Packet Classification
98 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 21, NO. 1, FEBRUARY 2013 ABC: Adaptive Binary Cuttings for Multidimensional Packet Classification Haoyu Song, Member, IEEE, and Jonathan S. Turner, Fellow,
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 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 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 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 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 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 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 informationReal Time Packet Classification and Analysis based on Bloom Filter for Longest Prefix Matching
Real Time Packet Classification and Analysis based on Bloom Filter for Longest Prefix Matching Ms. Namita N. Kothari ME Information Technology2nd, Amrutvahini College of Engineering, Sangamner, India namitakothari8@gmail.com
More informationDecision Forest: A Scalable Architecture for Flexible Flow Matching on FPGA
2010 International Conference on Field Programmable Logic and Applications Decision Forest: A Scalable Architecture for Flexible Flow Matching on FPGA Weirong Jiang, Viktor K. Prasanna Ming Hsieh Department
More informationFPGA Based Packet Classification Using Multi-Pipeline Architecture
International Journal of Wireless Communications and Mobile Computing 2015; 3(3): 27-32 Published online May 8, 2015 (http://www.sciencepublishinggroup.com/j/wcmc) doi: 10.11648/j.wcmc.20150303.11 ISSN:
More informationA Hybrid Approach to CAM-Based Longest Prefix Matching for IP Route Lookup
A Hybrid Approach to CAM-Based Longest Prefix Matching for IP Route Lookup Yan Sun and Min Sik Kim School of Electrical Engineering and Computer Science Washington State University Pullman, Washington
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 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 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 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 informationPACKET classification enables network routers to provide
IEEE TRANSACTIONS ON COMPUTERS, VOL. 60, NO. 5, MAY 2011 723 Toward Advocacy-Free Evaluation of Packet Classification Algorithms Haoyu Song, Member, IEEE, and Jonathan S. Turner, Fellow, IEEE Abstract
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 informationERFC: An Enhanced Recursive Flow Classification Algorithm
Gong XY, Wang WD, Cheng SD. ERFC: An enhanced recursive flow classification algorithm. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 25(5): 958 969 Sept. 2010. DOI 10.1007/s11390-010-1076-5 ERFC: An Enhanced
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 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 informationTrees in the List: Accelerating List-based Packet Classification Through Controlled Rule Set Expansion
Trees in the List: Accelerating List-based Packet Classification Through Controlled Rule Set Expansion Sven Hager Stefan Selent Björn Scheuermann Computer Engineering Group Humboldt University of Berlin,
More informationScalable Packet Classification on FPGA
1668 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 20, NO. 9, SEPTEMBER 2012 Scalable Packet Classification on FPGA Weirong Jiang, Member, IEEE, and Viktor K. Prasanna, Fellow,
More informationMulti-dimensional Packet Classification on FPGA: 100 Gbps and Beyond
Multi-dimensional Packet Classification on FPGA: 00 Gbps and Beyond Yaxuan Qi, Jeffrey Fong 2, Weirong Jiang 3, Bo Xu 4, Jun Li 5, Viktor Prasanna 6, 2, 4, 5 Research Institute of Information Technology
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 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 informationDecision Forest: A Scalable Architecture for Flexible Flow Matching on FPGA
Decision Forest: A Scalable Architecture for Flexible Flow Matching on FPGA Weirong Jiang, Viktor K. Prasanna University of Southern California Norio Yamagaki NEC Corporation September 1, 2010 Outline
More informationFast and Reconfigurable Packet Classification Engine in FPGA-Based Firewall
2011 International Conference on Electrical Engineering and Informatics 17-19 July 2011, Bandung, Indonesia Fast and Reconfigurable Packet Classification Engine in FPGA-Based Firewall Arief Wicaksana #1,
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 informationScalable Packet Classification
Scalable Packet Classification Florin Baboescu Dept. of Computer Science and Engineering University of California, San Diego 9500 Gilman Drive La Jolla, CA 92093-0114 baboescu@cs.ucsd.edu George Varghese
More informationPacket Classification Algorithms: From Theory to Practice
Packet Classification Algorithms: From Theory to Practice Yaxuan Qi, Lianghong Xu and Baohua Yang Department of Automation, Research Institute of Information Technology (RIIT), Tsinghua University, Beijing,
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 informationHNPC: Hardware Network Packet Classifier for High Speed Intrusion Detection Systems
International Journal of Engineering and Technology Volume 4 No. 3, March, 2014 HNPC: Hardware Network Packet Classifier for High Speed Intrusion Detection Systems Nekoo Rafiei Karkvandi, Hassan Asgharian,
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 informationHSM: A Fast Packet Classification Algorithm
HM: Fast acket Classification lgorithm Bo Xu, Research Institute of Information Technology (RIIT), Tsinghua University ongyi Jiang, Juniper Networks, Inc. Jun Li, Research Institute of Information Technology
More informationSurvey on Multi Field Packet Classification Techniques
Abstract Research Journal of Recent Sciences ISSN 2277-2502. Survey on Multi Field Packet Classification Techniques Ammar Yahya Daeef Al-Nejadi 1,2 and Nasir Shaikh- Husin 1 1 Faculty of Electrical Engineering,
More informationBinary Search Schemes for Fast IP Lookups
1 Schemes for Fast IP Lookups Pronita Mehrotra, Paul D. Franzon Abstract IP route look up is the most time consuming operation of a router. Route lookup is becoming a very challenging problem due to the
More informationFPGA Implementation of Lookup Algorithms
2011 IEEE 12th International Conference on High Performance Switching and Routing FPGA Implementation of Lookup Algorithms Zoran Chicha, Luka Milinkovic, Aleksandra Smiljanic Department of Telecommunications
More informationEffiCuts: Optimizing Packet Classification for Memory and Throughput
EffiCuts: Optimizing Packet Classification for Memory and Throughput Balajee Vamanan*, Gwendolyn Voskuilen* and T. N. Vijaykumar (* both primary student authors) School of Electrical and Computer Engineering,
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 informationHashing Round-down Prefixes for Rapid Packet Classification
Hashing Round-down Prefixes for Rapid Packet Classification Fong Pong and Nian-Feng Tzeng* *Center for Advanced Computer Studies University of Louisiana, Lafayette, USA 1 Outline Packet Classification
More informationFrugal IP Lookup Based on a Parallel Search
Frugal IP Lookup Based on a Parallel Search Zoran Čiča and Aleksandra Smiljanić School of Electrical Engineering, Belgrade University, Serbia Email: cicasyl@etf.rs, aleksandra@etf.rs Abstract Lookup function
More informationResource Efficient Multi Ported Sram Based Ternary Content Addressable Memory
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 PP 11-18 www.iosrjen.org Resource Efficient Multi Ported Sram Based Ternary Content Addressable Memory S.Parkavi (1) And S.Bharath
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 informationNovel Design of Dual Core RISC Architecture Implementation
Journal From the SelectedWorks of Kirat Pal Singh Spring May 18, 2015 Novel Design of Dual Core RISC Architecture Implementation Akshatha Rai K, VTU University, MITE, Moodbidri, Karnataka Basavaraj H J,
More informationEfficient Packet Classification for Network Intrusion Detection using FPGA
Efficient Packet Classification for Network Intrusion Detection using FPGA ABSTRACT Haoyu Song Department of CSE Washington University St. Louis, USA hs@arl.wustl.edu FPGA technology has become widely
More informationPARALLEL ALGORITHMS FOR IP SWITCHERS/ROUTERS
THE UNIVERSITY OF NAIROBI DEPARTMENT OF ELECTRICAL AND INFORMATION ENGINEERING FINAL YEAR PROJECT. PROJECT NO. 60 PARALLEL ALGORITHMS FOR IP SWITCHERS/ROUTERS OMARI JAPHETH N. F17/2157/2004 SUPERVISOR:
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 informationDBS: A Bit-level Heuristic Packet Classification Algorithm for High Speed Network
9 15th International Conference on Parallel and Distributed Systems : A Bit-level Heuristic Packet Classification Algorithm for High Speed Network Baohua Yang *,, Xiang Wang, Yibo Xue, and Jun Li, * Dept.
More informationProgrammable Software Switches. Lecture 11, Computer Networks (198:552)
Programmable Software Switches Lecture 11, Computer Networks (198:552) Software-Defined Network (SDN) Centralized control plane Data plane Data plane Data plane Data plane Why software switching? Early
More informationProceedings of the UGC Sponsored National Conference on Advanced Networking and Applications, 27 th March 2015
Decision Tree based Network Packet Classification Algorithms T S URMILA Department of Computer Science, Sourashtra College, Madurai-4 Email: urmi_ts@yahoo.co.in Dr R BALASUBRAMANIAN Dean - MCA, KVCET,
More informationTUPLE PRUNING USING BLOOM FILTERS FOR PACKET CLASSIFICATION
... TUPLE PRUNING USING BLOOM FILTERS FOR PACKET CLASSIFICATION... TUPLE PRUNING FOR PACKET CLASSIFICATION PROVIDES FAST SEARCH AND A LOW IMPLEMENTATION COMPLEXITY. THE TUPLE PRUNING ALGORITHM REDUCES
More informationPacket Classification for Core Routers: Is there an alternative to CAMs?
Packet Classification for Core Routers: Is there an alternative to CAMs? Florin Baboescu, Sumeet Singh, George Varghese Abstract A classifier consists of a set of rules for classifying packets based on
More informationISSN Vol.05,Issue.09, September-2017, Pages:
WWW.IJITECH.ORG ISSN 2321-8665 Vol.05,Issue.09, September-2017, Pages:1693-1697 AJJAM PUSHPA 1, C. H. RAMA MOHAN 2 1 PG Scholar, Dept of ECE(DECS), Shirdi Sai Institute of Science and Technology, Anantapuramu,
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 informationHigh-Performance Packet Classification on GPU
High-Performance Packet Classification on GPU Shijie Zhou, Shreyas G. Singapura and Viktor. Prasanna Ming Hsieh Department of Electrical Engineering University of Southern California Los Angeles, CA 99
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 informationA Configurable Packet Classification Architecture for Software- Defined Networking
A Configurable Packet Classification Architecture for Software- Defined Networking Guerra Pérez, K., Yang, X., Scott-Hayward, S., & Sezer, S. (2014). A Configurable Packet Classification Architecture for
More informationTowards System-level Optimization for High Performance Unified Threat Management
Towards System-level Optimization for High Performance Unified Threat Management Yaxuan Qi 1, 2, Baohua Yang 1, 3, Bo Xu 1, 3, Jun Li 1, 2 1 Research Institute of Information Technology (RIIT), Tsinghua
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 information15-744: Computer Networking. Routers
15-744: Computer Networking outers Forwarding and outers Forwarding IP lookup High-speed router architecture eadings [McK97] A Fast Switched Backplane for a Gigabit Switched outer Optional [D+97] Small
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 informationConfiguring ACLs. ACL overview. ACL categories. ACL numbering and naming
Contents Configuring ACLs 1 ACL overview 1 ACL categories 1 ACL numbering and naming 1 Match order 2 ACL rule numbering 3 Implementing time-based ACL rules 3 IPv4 fragments filtering with ACLs 3 Flow templates
More informationDesign and Evaluation of Packet Classification Systems, Doctoral Dissertation, December 2006
Washington University in St. Louis Washington University Open Scholarship All Computer Science and Engineering Research Computer Science and Engineering Report Number: WUCSE-26-53 26-1-1 Design and Evaluation
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 informationStatistical based Approach for Packet Classification
Statistical based Approach for Packet Classification Dr. Mrudul Dixit 1, Ankita Sanjay Moholkar 2, Sagarika Satish Limaye 2, Devashree Chandrashekhar Limaye 2 Cummins College of engineering for women,
More informationHigh-Performance Packet Classification Algorithm for Multithreaded IXP Network Processor
High-Performance Packet Classification Algorithm for Multithreaded IXP Network Processor DUO LIU Southwest University of Science and Technology, University of Science and Technology of China, and Suzhou
More informationEfficient Multi-Match Packet Classification with TCAM
Efficient Multi-Match Packet Classification with Fang Yu and Randy Katz fyu, randy @eecs.berkeley.edu CS Division, EECS Department, U.C.Berkeley Report No. UCB/CSD-4-1316 March 2004 Computer Science Division
More informationPlanar Point Location
C.S. 252 Prof. Roberto Tamassia Computational Geometry Sem. II, 1992 1993 Lecture 04 Date: February 15, 1993 Scribe: John Bazik Planar Point Location 1 Introduction In range searching, a set of values,
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 information