Routing Lookup Algorithm for IPv6 using Hash Tables

Size: px
Start display at page:

Download "Routing Lookup Algorithm for IPv6 using Hash Tables"

Transcription

1 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 lookup algorithms, this paper proposes an improved routing lookup algorithm, which is based on the characteristics of IPv6 address structure and backbone routing table. Based on Hash table and multi branch Trie structure, the most commonly used routing prefix is placed in the hash table, and is stored in the table node according to the prefix value, which is not only the most commonly used. For other prefix matching problems, according to hash table, we use the index of the corresponding multi branch Trie tree to complete the longest prefix matching. Analysis show that the algorithm time efficiency. Key words: IPv6, routing table, trie, hash table 1 Introduction As the network size continues to grow, the traditional IPv4 address has been faced with the danger of exhaustion, IPv6 came into being. IPv6 and IPv4 phase Ratio, the length of the address from the original 32 to 128 place, is bound to make The scale of the routing table in the router, especially in the core router, is ten Big points. And the main function of the router is based on the IP data. Destination address lookup routing table forwarding packets, along with Gigabit router. And too Gigabit router, the optical interface speed has reached 10Gbps, so the routing lookup table has become a constraint to the router forwarding speed Bottleneck. The key to improve the routing lookup speed is to adopt a good lookup table. Method, this time to find a new IPv6 fast route lookup algorithm is particularly necessary. 2 Related Work Commonly used routing lookup algorithm are as follows. Software based algorithm. Simple binary Trie tree structure is used to achieve IP lookup. Each bit value to determine the branch of the tree, the search process to many times memory accesses. Representative algorithms include SAIL[2], Tree bitmap[8], and more [3][5][11][22]. Some algorithms use Bloom filters[7][15] to accelerate the lookup speed, such as PBF[27]. 1

2 Hardware based algorithm. Many researchers propose to use hardware to perform routing lookup. Due to the parallel characteristic, these algorithm can achieve very fast lookup speed at the cost of power consumption, such as using GPU[9] and TCAM[4][12]. To achieve fast lookup and reduce the hardware cost, some literatures propose first to compress the routing table, Forwarding Information Base (FIB), such as [28][10]. There are also many other algorithms, interested readers refer to [6][13][14][17][18][19][21][24]. 2 IPv6 Architecture FP field: IPv6 address in the format prefix, 3 bit long, is used to Identify the address in the IPv6 address space in which type of address. For example, the field is "001", which is the identity of the global unicast address; TLAID field: Top clustering identifier, including the most advanced address Routing information; RES field: the field is 8 bits and is reserved for future use, and eventually can be used to extend the top-level or next level aggregation identifier field; NLAID field: the next level aggregation identifier, the 24 bit length. The standard Identifier is used by some organizations to control the top clustering to arrange the address space; SLAID field: site class cluster identifier, used by some organizations, to arrange the internal network structure; Interface identifier field: 64 bits long, containing EUI-64 IEEE 64 bit value of port identifier. Therefore, IPv6 unicast address can include a large number of combinations, or even super over the future RFC may specify explicit fields. Whether it is a site level cluster identifier, or a large number of the next level aggregation identifier space, so that some network access providers and institutions through the hierarchical structure. 3 Proposed trie-based algorithm Although the nature of the IPv6 routing lookup is still the longest prefix matching Match, but due to the different address format, IPV4 on the search method no longer fully adapted to the IPv6, so in the design of the IP search must be according to the characteristics of IPv6 and the characteristics of each routing lookup algorithm Meter. Since the IPv6 multicast format is used only for the 128 bit address, the lookup problem of this class can be classified into IPV4 Address lookup up processing. This article is no longer considered. For IPv6, a global unicast address format that must be IPV4 search method is improved, and a new set of routing lookup is proposed. 2

3 Mechanism in order to meet the requirements of IPv6 unicast address lookup. The address format of the IPv6 in the section and the backbone routing table. The characteristics of the proposed algorithm and the existing routing lookup algorithm are analyzed. A new algorithm for fast searching of the aggregated unicast addresses in the world, First of all, the prefix in the 4~16 bit of the most advanced address routing information, and then Combined with the information on the 17 after the prefix length of 32, 48 and 64 establish Hash table, and the 17~31, 33~47 bit and 49~63 Bit set up multi branch Trie Tree, Hash table and multi branch Trie tree The algorithm is better in finding and updating the data. The routing entries in the routing table are 32, 48, and 64. Establish Hash table, not only for the longest prefix matching search, but also is an index table, when the table is not found in the longest matching prefix, the results will be based on the value of the Trie root address. And the first three of the unicast address are 001, but also because there is no prefix length Is less than or equal to 16 of the prefix, so for the 32 bit length of the prefix, the field stores only 16 bits in the 17 to 32 bits, while the 48 bit length A prefix that stores only 16 of its 33 to 48 bits, while the 64 bit length prefix, which stores only 16 of its 49 to 64 bits. The nodes in the table are ordered in this field next hop: the next hop address information, you can take the value and the next hop address. Tag: indicates whether there is a longer prefix matching field, the value of 0 and 1 respectively; Root pointer Trie: a pointer to the root node corresponding to the Trie, when you cannot find the appropriate routing information in the index table, you should go to the Trie tree pointer refers to the tree up to find the corresponding routing information; Next: a pointer to the next table node. Lookup algorithm requires that the values of these domains in the table node should be satisfied with the next condition: The value of the Prefix field cannot be null; When the value of Tag is 0, it is found in the Hash index table. The length of 32, 48 or 64 of the longest prefix match, and this time under the value of the hop Next domain is the value of the one hop address, and the hop Next Cannot be null, and the value of the root pointer Trie domain at this time must be empty. When Tag When the value is 1, it indicates that there is a longer matching prefix, next hop for null values, the best matching prefix is stored in the hash table at this time. The other Trie is stored in the table, while the value of the root pointer Trie. The root of the Trie tree is shorter than the Hash tree corresponding to the length of the table. For example, in the Tag value of 1, hash table with the prefix length of 32 The value of the root Pointer Trie of the table node corresponding to the value should be set up. 17~31 bit Trie root address value, while the Tag value is 1, Hash table with the prefix length of 48 values corresponding to the table node of the root Trie. The value of Pointer should be the set of bits of the Trie root address value. 3

4 4 Conclusion In this paper, a new IPv6 routing lookup algorithm is proposed. The IPv6 address structure and backbone routing table are integrated. By using hash table and multi branch Trie tree structure, our proposed algorithm can efficiently store the routing tables. With a prefix of two points, the hash table will be searched for destination addresses to achieve long prefix matching. The algorithm achieves fast lookup and update speed and memory efficiency. References [1] Degermark M, Brodnik A, Carlsson S, et al.small forwarding tables for fast routing lookups[j].computer Communication Review, 1997, 27(4):3-14 [2] Yang T, Xie G, Li Y B, et al. Guarantee IP lookup performance with FIB explosion[j]. ACM SIGCOMM Computer Communication Review, 2015, 44(4): [3] V. Srinivasan and G.Varghese, Faster IP Lookups using Controlled Prefix Expansion, Proc. ACM SIGMETRICS 98, June [4] A. J. McAuley and P. Francis, Fast Routing Table Lookup Using CAMs, Proc. IEEE INFOCOM 93, Vol.3, pp ,march [5] T. Yang, Z. Mi, R. Duan, X. Guo, J. Lu, S. Zhang, X. Sun, and B. Liu. An ultra-fast universal incremental update algorithm for trie-based routing lookup. In Proc. ACM/IEEE ICNP, [6] T zeng H H-Y, Przygienda T. On fast address-lookup algorithms [J].IEEE Journal on Selected Areas in Communications, 1999, 17(6): [7] B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7): , [8] E. Will, V. George, and D. Zubin. Tree bitmap: hardware/software IP lookups with incremental updates. ACM SIGCOMM Computer Communication Review, 34(2):97-122, [9] J. Zhao, X. Zhang, X. Wang, and X. Xue. Achieving O(1) IP lookup on gpu-based software routers. In ACM SIGCOMM Computer Communication Review, volume 40, pages ACM, [10] Yang T, Yuan B, Zhang S, et al. Approaching optimal compression with fast update for large scale routing tables[c]//proceedings of the 2012 IEEE 20th International Workshop on Quality of Service. 2012: 32. [11] R. Miguel, B. Ernst, and D. Walid. Survey and taxonomy of IP address lookup algorithms. Network, IEEE, 15(2), [12] Tong Yang, Ruian Duan, Jianyuan Lu, et al. CLUE: achieving fast update over compressed table for parallel lookup with reduced dynamic redundancy[c]//distributed Computing Systems (ICDCS), 2012 IEEE 32nd International Conference on. IEEE, 2012: [13] B. Lampson, V. Srinivasan, and G. Varghese, IP Lookups Using Multiway and Multicolumn Search, Proc. IEEE INFOCOM 98, Apr. 1998, pp [14] S. Suri, G. Varghese, and P. R. Warkhede, Multiway Range Trees: Scalable IP Lookup with Fast Updates, 4

5 Tech. rep , Washington Univ., [15] Yang T, Liu A X, Shahzad M, et al. A shifting bloom filter framework for set queries[j]. Proceedings of the VLDB Endowment, 2016, 9(5): [16] M. Á. Ruiz-Sánchez and W. Dabbous, Un Mécanisme Optimisé derecherche de route IP, Proc. CFIP 2000, Oct. 2000, pp [17] A. Feldmann and S. Muthukrishnan, Tradeoffs for Packet Classification, Proc. IEEE INFOCOM 2000, Mar. 2000, pp [18] C. Labovitz, Scalability of the Internet Backbone Routing Infrastructure, Ph.D. thesis, Univ. of Michigan, [19] Yang T, Xie G, Sun X, et al. Towards practical use of Bloom Filter based IP lookup in operational network[c]//2014 IEEE Network Operations and Management Symposium (NOMS). IEEE, 2014: 1-4. [20] G. Huston, Tracking the Internet s BGP Table, presentation slides: Dec [21] D. R. Morrison, PATRICIA Practical Algorithm to Retrieve Information Coded in Alphanumeric, J. ACM, vol. 15, no. 4, Oct. 1968, pp [22] S. Nilsson and G. Karlsson, IP-Address Lookup Using LC-Tries, IEEE J. Select. Areas Commun., Vol.17, No.6, pp , June [23] N. Huang and S. Zhao, A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers, IEEE J. Select. Areas Commun., Vol.17, No.6, pp , June [24] W Z Zhang. On the Routing Lookup Algorithm for IPv6[Z], 1999 [25] Ioannis Ioannidis. Adaptive Data Structures for IP Lookups[C]. IEEE INFOCOM 2003 [26] Marcel Waldvogel. Scalable High Speed IP Routing Lookups[C]. ACM SIGCOMM 97,1997 [27] Dharmapurikar S, Krishnamurthy P, Taylor D E. Longest prefix matching using bloom filters[c]//proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. ACM, 2003: [28] Draves R P, King C, Venkatachary S, et al. Constructing optimal IP routing tables[c]//infocom'99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE. IEEE, 1999, 1:

Dynamic Routing Tables Using Simple Balanced. Search Trees

Dynamic 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 information

Frugal IP Lookup Based on a Parallel Search

Frugal 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 information

Binary Search Schemes for Fast IP Lookups

Binary 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 information

Fast Update of Forwarding Tables in Internet Router Using AS Numbers Λ

Fast 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 information

Disjoint 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 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 information

Tree, Segment Table, and Route Bucket: A Multistage Algorithm for IPv6 Routing Table Lookup

Tree, Segment Table, and Route Bucket: A Multistage Algorithm for IPv6 Routing Table Lookup Tree, Segment Table, and Route Bucket: A Multistage Algorithm for IPv6 Routing Table Lookup Zhenqiang LI Dongqu ZHENG Yan MA School of Computer Science and Technology Network Information Center Beijing

More information

Parallel-Search Trie-based Scheme for Fast IP Lookup

Parallel-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 information

Problem Statement. Algorithm MinDPQ (contd.) Algorithm MinDPQ. Summary of Algorithm MinDPQ. Algorithm MinDPQ: Experimental Results.

Problem 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 information

Review on Tries for IPv6 Lookups

Review 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 information

A Novel Level-based IPv6 Routing Lookup Algorithm

A Novel Level-based IPv6 Routing Lookup Algorithm A Novel Level-based IPv6 Routing Lookup Algorithm Xiaohong Huang 1 Xiaoyu Zhao 2 Guofeng Zhao 1 Wenjian Jiang 2 Dongqu Zheng 1 Qiong Sun 1 Yan Ma 1,3 1. School of Computer Science and Technology, Beijing

More information

Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup

Efficient 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 information

IP Address Lookup in Hardware for High-Speed Routing

IP Address Lookup in Hardware for High-Speed Routing IP Address Lookup in Hardware for High-Speed Routing Andreas Moestedt and Peter Sjödin am@sics.se, peter@sics.se Swedish Institute of Computer Science P.O. Box 1263, SE-164 29 KISTA, Sweden Abstract This

More information

Multiway Range Trees: Scalable IP Lookup with Fast Updates

Multiway Range Trees: Scalable IP Lookup with Fast Updates Multiway Range Trees: Scalable IP Lookup with Fast Updates Subhash Suri George Varghese Priyank Ramesh Warkhede Department of Computer Science Washington University St. Louis, MO 63130. Abstract In this

More information

A Classified Multi-Suffix Trie for IP Lookup and Update

A Classified Multi-Suffix Trie for IP Lookup and Update A Classified Multi-Suffix Trie for IP Lookup and Update Sun-Yuan Hsieh and Ying-Chi Yang Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road,

More information

Multiway Range Trees: Scalable IP Lookup with Fast Updates

Multiway Range Trees: Scalable IP Lookup with Fast Updates Washington University in St. Louis Washington University Open Scholarship All Computer Science and Engineering Research Computer Science and Engineering Report Number: WUCS-99-28 1999-01-01 Multiway Range

More information

Packet Classification using Rule Caching

Packet 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 information

FPGA Implementation of Lookup Algorithms

FPGA 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 information

THE advent of the World Wide Web (WWW) has doubled

THE advent of the World Wide Web (WWW) has doubled IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 17, NO. 6, JUNE 1999 1093 A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers Nen-Fu Huang, Member, IEEE,

More information

OBMA: Minimizing Bitmap Data Structure with Fast and Uninterrupted Update Processing

OBMA: Minimizing Bitmap Data Structure with Fast and Uninterrupted Update Processing OBMA: Minimizing Bitmap Data Structure with Fast and Uninterrupted Update Processing Chuwen Zhang, Yong Feng, Haoyu Song, Ying Wan, Wenquan Xu, Yilun Wang, Huichen Dai, Yang Li, Bin Liu Department of Computer

More information

CS419: Computer Networks. Lecture 6: March 7, 2005 Fast Address Lookup:

CS419: Computer Networks. Lecture 6: March 7, 2005 Fast Address Lookup: : Computer Networks Lecture 6: March 7, 2005 Fast Address Lookup: Forwarding/Routing Revisited Best-match Longest-prefix forwarding table lookup We looked at the semantics of bestmatch longest-prefix address

More information

Length Indexed Bloom Filter Based Forwarding In Content Centeric Networking

Length Indexed Bloom Filter Based Forwarding In Content Centeric Networking Length Indexed Bloom Filter Based Forwarding In Content Centeric Networking Vishal Manghnani Rochester Institute of Technology vjm1952@rit.edu Abstract Named Data Network (NDN) is a modern networking architecture

More information

LONGEST prefix matching (LPM) techniques have received

LONGEST prefix matching (LPM) techniques have received IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 2, APRIL 2006 397 Longest Prefix Matching Using Bloom Filters Sarang Dharmapurikar, Praveen Krishnamurthy, and David E. Taylor, Member, IEEE Abstract We

More information

Efficient Packet Classification using Splay Tree Models

Efficient 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 information

Data Structures for Packet Classification

Data 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 information

Novel Hardware Architecture for Fast Address Lookups

Novel Hardware Architecture for Fast Address Lookups Novel Hardware Architecture for Fast Address Lookups Pronita Mehrotra, Paul D. Franzon ECE Department, North Carolina State University, Box 7911, Raleigh, NC 27695-791 1, USA Ph: +1-919-515-735 1, Fax:

More information

AN EFFICIENT HYBRID ALGORITHM FOR MULTIDIMENSIONAL PACKET CLASSIFICATION

AN 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 information

Fast IP Routing Lookup with Configurable Processor and Compressed Routing Table

Fast IP Routing Lookup with Configurable Processor and Compressed Routing Table Fast IP Routing Lookup with Configurable Processor and Compressed Routing Table H. Michael Ji, and Ranga Srinivasan Tensilica, Inc. 3255-6 Scott Blvd Santa Clara, CA 95054 Abstract--In this paper we examine

More information

Fast Packet Classification Algorithms

Fast 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 information

Shape Shifting Tries for Faster IP Route Lookup

Shape Shifting Tries for Faster IP Route Lookup Shape Shifting Tries for Faster IP Route Lookup Haoyu Song, Jonathan Turner, John Lockwood Applied Research Laboratory Washington University in St. Louis Email: {hs1,jst,lockwood}@arl.wustl.edu Abstract

More information

CHAPTER 2 LITERATURE SURVEY

CHAPTER 2 LITERATURE SURVEY 23 CHAPTER 2 LITERATURE SURVEY The current version of the Internet Protocol IPv4 was first developed in the 1970s (Tanenbaum 2002), and the main protocol standard RFC 791 that governs IPv4 functionality

More information

Shape Shifting Tries for Faster IP Route Lookup

Shape Shifting Tries for Faster IP Route Lookup Shape Shifting Tries for Faster IP Route Lookup Haoyu Song, Jonathan Turner, John Lockwood Applied Research Laboratory Washington University in St. Louis Email: {hs1,jst,lockwood}@arl.wustl.edu Abstract

More information

Forwarding and Routers : Computer Networking. Original IP Route Lookup. Outline

Forwarding 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 information

Scalable IP Routing Lookup in Next Generation Network

Scalable 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 information

Fast and Scalable IP Address Lookup with Time Complexity of Log m Log m (n)

Fast and Scalable IP Address Lookup with Time Complexity of Log m Log m (n) 58 JOURNAL OF ADVANCES IN INFORMATION TECHNOLOGY, VOL. 5, NO. 2, MAY 214 Fast and Scalable IP Address Lookup with Time Complexity of Log m Log m (n) Abhishant Prakash Motilal Nehru National Institute of

More information

Towards 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 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 information

Last Lecture: Network Layer

Last Lecture: Network Layer Last Lecture: Network Layer 1. Design goals and issues 2. Basic Routing Algorithms & Protocols 3. Addressing, Fragmentation and reassembly 4. Internet Routing Protocols and Inter-networking 5. Router design

More information

An Ultra-fast Universal Incremental Update Algorithm for Trie-based Routing Lookup

An Ultra-fast Universal Incremental Update Algorithm for Trie-based Routing Lookup An Ultra-fast Universal Incremental Update Algorithm for Trie-based Routing Lookup Tong Yang, Zhian Mi, Ruian Duan, Xiaoyu Guo, Jianyuan Lu, Shenjiang Zhang, Xianda Sun and Bin Liu Department of Computer

More information

Efficient hardware architecture for fast IP address lookup. Citation Proceedings - IEEE INFOCOM, 2002, v. 2, p

Efficient hardware architecture for fast IP address lookup. Citation Proceedings - IEEE INFOCOM, 2002, v. 2, p Title Efficient hardware architecture for fast IP address lookup Author(s) Pao, D; Liu, C; Wu, A; Yeung, L; Chan, KS Citation Proceedings - IEEE INFOCOM, 2002, v 2, p 555-56 Issued Date 2002 URL http://hdlhandlenet/0722/48458

More information

A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond

A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond A Pipelined IP Address Lookup Module for 1 Gbps Line Rates and beyond Domenic Teuchert and Simon Hauger Institute of Communication Networks and Computer Engineering (IKR) Universität Stuttgart, Pfaffenwaldring

More information

ECE697AA Lecture 20. Forwarding Tables

ECE697AA 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 information

Packet Classification Using Dynamically Generated Decision Trees

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 information

Tree-Based Minimization of TCAM Entries for Packet Classification

Tree-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 information

IP lookup with low memory requirement and fast update

IP lookup with low memory requirement and fast update Downloaded from orbit.dtu.dk on: Dec 7, 207 IP lookup with low memory requirement and fast update Berger, Michael Stübert Published in: Workshop on High Performance Switching and Routing, 2003, HPSR. Link

More information

Three Different Designs for Packet Classification

Three 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 information

Rule Caching for Packet Classification Support

Rule 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 information

Bloom Filters. References:

Bloom Filters. References: Bloom Filters References: Li Fan, Pei Cao, Jussara Almeida, Andrei Broder, Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol, IEEE/ACM Transactions on Networking, Vol. 8, No. 3, June 2000.

More information

A Memory-Balanced Linear Pipeline Architecture for Trie-based IP Lookup

A Memory-Balanced Linear Pipeline Architecture for Trie-based IP Lookup 5th IEEE Symposium on High-Performance Interconnects A Memory-Balanced Linear Pipeline Architecture for Trie-based IP Lookup Weirong Jiang and Viktor K. Prasanna Ming Hsieh Department of Electrical Engineering

More information

All-Match Based Complete Redundancy Removal for Packet Classifiers in TCAMs

All-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

A 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 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 information

A Multi-stage IPv6 Routing Lookup Algorithm Based on Hash Table and Multibit Trie Xing-ya HE * and Yun YANG

A Multi-stage IPv6 Routing Lookup Algorithm Based on Hash Table and Multibit Trie Xing-ya HE * and Yun YANG 2017 International Conference on Computer, Electronics and Communication Engineering (CECE 2017) ISBN: 978-1-60595-476-9 A Multi-stage IPv6 Routing Lookup Algorithm Based on Hash Table and Multibit Trie

More information

* I D ~~~ ~ Figure 2: Longest matching prefix.

* I D ~~~ ~ Figure 2: Longest matching prefix. A fast and compact longest match prefix look-up method using pointer cache for very long network address Masanori Uga Kohei Shiomoto "IT Network Service Systems Laboratories Midori 3-9-, Musashino, Tokyo

More information

Journal of Network and Computer Applications

Journal of Network and Computer Applications Journal of Network and Computer Applications () 4 Contents lists available at ScienceDirect Journal of Network and Computer Applications journal homepage: www.elsevier.com/locate/jnca Memory-efficient

More information

V6Gene: A Scalable IPv6 Prefix Generator for Route Lookup Algorithm

V6Gene: A Scalable IPv6 Prefix Generator for Route Lookup Algorithm Scalable IPv6 Prefix Generator for Benchmark 1 V6Gene: A Scalable IPv6 Prefix Generator for Route Lookup Algorithm Benchmark i Abstract-- Most conventional IPv4-based route lookup algorithms are no more

More information

INF5050 Protocols and Routing in Internet (Friday ) Subject: IP-router architecture. Presented by Tor Skeie

INF5050 Protocols and Routing in Internet (Friday ) Subject: IP-router architecture. Presented by Tor Skeie INF5050 Protocols and Routing in Internet (Friday 9.2.2018) Subject: IP-router architecture Presented by Tor Skeie High Performance Switching and Routing Telecom Center Workshop: Sept 4, 1997. This presentation

More information

Scalable Packet Classification for IPv6 by Using Limited TCAMs

Scalable 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 information

Novel IP Address Lookup Algorithm for Inexpensive Hardware Implementation

Novel IP Address Lookup Algorithm for Inexpensive Hardware Implementation Novel IP Address Lookup Algorithm for Inexpensive Hardware Implementation KARI SEPPÄNEN Information Technology Research Institute Technical Research Centre of Finland (VTT) PO Box 1202, FIN-02044 VTT Finland

More information

Chapter 12 Digital Search Structures

Chapter 12 Digital Search Structures Chapter Digital Search Structures Digital Search Trees Binary Tries and Patricia Multiway Tries C-C Tsai P. Digital Search Tree A digital search tree is a binary tree in which each node contains one element.

More information

A Scalable Approach for Packet Classification Using Rule-Base Partition

A 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 information

Message Switch. Processor(s) 0* 1 100* 6 1* 2 Forwarding Table

Message Switch. Processor(s) 0* 1 100* 6 1* 2 Forwarding Table Recent Results in Best Matching Prex George Varghese October 16, 2001 Router Model InputLink i 100100 B2 Message Switch B3 OutputLink 6 100100 Processor(s) B1 Prefix Output Link 0* 1 100* 6 1* 2 Forwarding

More information

Grid of Segment Trees for Packet Classification

Grid 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 information

Lecture notes of G. Q. Maguire Jr. IK2555, Spring Module 2

Lecture notes of G. Q. Maguire Jr. IK2555, Spring Module 2 Lecture notes of G. Q. Maguire Jr. IK2555, Spring 2014 1 2 3 4 5 6 7 8 9 Renesas Technology Corp. TCAM description http://www.renesas.com/fmwk.jsp?cnt=tcam_series_landing.jsp&fp=/applications/ network/network_memory/tcam/

More information

An Efficient Parallel IP Lookup Technique for IPv6 Routers Using Multiple Hashing with Ternary marker storage

An 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 information

ADDRESS lookup is one of the fundamental functions

ADDRESS lookup is one of the fundamental functions IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 17, NO. 6, JUNE 1999 1083 IP-Address Lookup Using LC-Tries Stefan Nilsson and Gunnar Karlsson, Senior Member, IEEE Abstract There has recently been

More information

15-744: Computer Networking. Routers

15-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 information

Implementation of Boundary Cutting Algorithm Using Packet Classification

Implementation 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 information

Exploiting Graphics Processors for High-performance IP Lookup in Software Routers

Exploiting Graphics Processors for High-performance IP Lookup in Software Routers Exploiting Graphics Processors for High-performance IP Lookup in Software Routers Jin Zhao, Xinya Zhang, Xin Wang School of Computer Science Fudan University Shanghai, China Email:{jzhao,06300720198,xinw}@fudan.edu.cn

More information

A SURVEY OF RECENT IP LOOKUP SCHEMES 1

A SURVEY OF RECENT IP LOOKUP SCHEMES 1 A SURVEY OF RECENT IP LOOKUP SCHEMES 1 Abstract V. Srinivasan, G. Varghese Microsoft Research, UCSD cheenu@ccrc. wustl. edu, varghese@ccrc. wustl. edu Internet (IP) address lookup is a major bottleneck

More information

Public Review for Efficient FIB Caching using Minimal Non-overlapping Prefixes. Yaoqing Liu, Syed Obaid Amin, and Lan Wang

Public Review for Efficient FIB Caching using Minimal Non-overlapping Prefixes. Yaoqing Liu, Syed Obaid Amin, and Lan Wang a c m Public Review for Efficient FIB Caching using Minimal Non-overlapping Prefixes Yaoqing Liu, Syed Obaid Amin, and Lan Wang The sizes of the Routing Information Base (RIB) and the associated Internet

More information

Switch and Router Design. Packet Processing Examples. Packet Processing Examples. Packet Processing Rate 12/14/2011

Switch and Router Design. Packet Processing Examples. Packet Processing Examples. Packet Processing Rate 12/14/2011 // Bottlenecks Memory, memory, 88 - Switch and Router Design Dr. David Hay Ross 8b dhay@cs.huji.ac.il Source: Nick Mckeown, Isaac Keslassy Packet Processing Examples Address Lookup (IP/Ethernet) Where

More information

High-Speed IP Routing With Binary Decision Diagrams Based Hardware Address Lookup Engine

High-Speed IP Routing With Binary Decision Diagrams Based Hardware Address Lookup Engine IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 4, MAY 2003 513 High-Speed IP Routing With Binary Decision Diagrams Based Hardware Address Lookup Engine Rama Sangireddy, Student Member,

More information

Power Efficient IP Lookup with Supernode Caching

Power Efficient IP Lookup with Supernode Caching Power Efficient IP Lookup with Supernode Caching Lu Peng, Wencheng Lu * and Lide Duan Department of Electrical & Computer Engineering Louisiana State University Baton Rouge, LA 73 {lpeng, lduan1}@lsu.edu

More information

Binary Search Schemes for Fast IP Lookups

Binary Search Schemes for Fast IP Lookups Schemes for Fast IP Lookups Pronita Mehrotra, Paul D. Franzon ECE Department, North Carolina State University Box 791 1, Raleigh NC 27695 {pmehrot,paulf]@eos.ncsu.edu Abstra&Ronte lookup is becoming a

More information

Scalable Name-Based Packet Forwarding: From Millions to Billions. Tian Song, Beijing Institute of Technology

Scalable Name-Based Packet Forwarding: From Millions to Billions. Tian Song, Beijing Institute of Technology Scalable Name-Based Packet Forwarding: From Millions to Billions Tian Song, songtian@bit.edu.cn, Beijing Institute of Technology Haowei Yuan, Patrick Crowley, Washington University Beichuan Zhang, The

More information

Multi-core Implementation of Decomposition-based Packet Classification Algorithms 1

Multi-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 information

Scalable High-Speed Prefix Matching

Scalable High-Speed Prefix Matching Scalable High-Speed Prefix Matching Marcel Waldvogel Washington University in St. Louis and George Varghese University of California, San Diego and Jon Turner Washington University in St. Louis and Bernhard

More information

Growth of the Internet Network capacity: A scarce resource Good Service

Growth of the Internet Network capacity: A scarce resource Good Service IP Route Lookups 1 Introduction Growth of the Internet Network capacity: A scarce resource Good Service Large-bandwidth links -> Readily handled (Fiber optic links) High router data throughput -> Readily

More information

Scaling the Inter-Domain Routing System

Scaling the Inter-Domain Routing System Scaling the Inter-Domain Routing System Kaustubh Gadkari Computer Science Department Colorado State University kaustubh@cs.colostate.edu Abstract The Internet inter-domain routing system is facing scalability

More information

A Multilayer Neural Network for IP Lookup Packet Classification

A Multilayer Neural Network for IP Lookup Packet Classification A Multilayer Neural Network for IP Lookup Packet Classification and * + 8 * Mehran Mahramian Moallem, Nasser Yazdani, Karim Faez, Hassan Taheri * + Amir Kabir University of Technology, Tehran University

More information

Wildcard Compression of Inter-Domain Routing Tables for OpenFlow-Based Software-Defined Networking

Wildcard Compression of Inter-Domain Routing Tables for OpenFlow-Based Software-Defined Networking c 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising

More information

Fast Packet Classification Using Bloom filters

Fast 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 information

Recursively Partitioned Static IP Router-Tables *

Recursively Partitioned Static IP Router-Tables * Recursively Partitioned Static IP Router-Tables * Wencheng Lu Sartaj Sahni {wlu,sahni}@cise.ufl.edu Department of Computer and Information Science and Engineering University of Florida, Gainesville, FL

More information

An Efficient IP Routing Lookup by Using Routing Interval

An 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 information

Memory-Efficient IPv4/v6 Lookup on FPGAs Using Distance-Bounded Path Compression

Memory-Efficient IPv4/v6 Lookup on FPGAs Using Distance-Bounded Path Compression Memory-Efficient IPv4/v6 Lookup on FPGAs Using Distance-Bounded Path Compression Hoang Le Ming Hsieh Dept. of Electrical Eng. University of Southern California Los Angeles, CA 989, USA Email: hoangle@usc.edu

More information

ADDRESS LOOKUP SOLUTIONS FOR GIGABIT SWITCH/ROUTER

ADDRESS LOOKUP SOLUTIONS FOR GIGABIT SWITCH/ROUTER ADDRESS LOOKUP SOLUTIONS FOR GIGABIT SWITCH/ROUTER E. Filippi, V. Innocenti and V. Vercellone CSELT (Centro Studi e Laboratori Telecomunicazioni) Via Reiss Romoli 274 Torino, 10148 ITALY ABSTRACT The Internet

More information

Updating Designed for Fast IP Lookup

Updating Designed for Fast IP Lookup Updating Designed for Fast IP Lookup Natasa Maksic, Zoran Chicha and Aleksandra Smiljanić School of Electrical Engineering Belgrade University, Serbia Email:maksicn@etf.rs, cicasyl@etf.rs, aleksandra@etf.rs

More information

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms Filippo Geraci 1 and Roberto Grossi 2 1 IIT-CNR, Pisa, and Dipartimento di Ingegneria dell Informazione, U. Siena, Italy

More information

TOWARDS EFFECTIVE PACKET CLASSIFICATION

TOWARDS 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 information

A Retrieval Method for Double Array Structures by Using Byte N-Gram

A Retrieval Method for Double Array Structures by Using Byte N-Gram A Retrieval Method for Double Array Structures by Using Byte N-Gram Masao Fuketa, Kazuhiro Morita, and Jun-Ichi Aoe Abstract Retrieving keywords requires speed and compactness. A trie is one of the data

More information

FAST IP ADDRESS LOOKUP ENGINE FOR SOC INTEGRATION

FAST IP ADDRESS LOOKUP ENGINE FOR SOC INTEGRATION FAST IP ADDRESS LOOKUP ENGINE FOR SOC INTEGRATION Tomas Henriksson Department of Electrical Engineering Linköpings universitet SE-581 83 Linköping tomhe@isy.liu.se Ingrid Verbauwhede UCLA EE Dept 7440B

More information

A Hybrid Approach to Scalable Name Prefix Lookup

A Hybrid Approach to Scalable Name Prefix Lookup A Hybrid Approach to Scalable Name Prefix Lookup Kun Huang and Zhaohua Wang Institute of Computing Technology, Chinese Academy of Sciences and University of Chinese Academy of Sciences Beijing, China {huangkun09,

More information

IP Forwarding. CSU CS557, Spring 2018 Instructor: Lorenzo De Carli

IP Forwarding. CSU CS557, Spring 2018 Instructor: Lorenzo De Carli IP Forwarding CSU CS557, Spring 2018 Instructor: Lorenzo De Carli 1 Sources George Varghese, Network Algorithmics, Morgan Kauffmann, December 2004 L. De Carli, Y. Pan, A. Kumar, C. Estan, K. Sankaralingam,

More information

A Multi Gigabit FPGA-based 5-tuple classification system

A 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 information

Midterm Review. Congestion Mgt, CIDR addresses,tcp processing, TCP close. Routing. hierarchical networks. Routing with OSPF, IS-IS, BGP-4

Midterm Review. Congestion Mgt, CIDR addresses,tcp processing, TCP close. Routing. hierarchical networks. Routing with OSPF, IS-IS, BGP-4 Midterm Review Week 1 Congestion Mgt, CIDR addresses,tcp processing, TCP close Week 2 Routing. hierarchical networks Week 3 Routing with OSPF, IS-IS, BGP-4 Week 4 IBGP, Prefix lookup, Tries, Non-stop routers,

More information

An Enhanced Bloom Filter for Longest Prefix Matching

An Enhanced Bloom Filter for Longest Prefix Matching An Enhanced Bloom Filter for Longest Prefix Matching Gahyun Park SUNY-Geneseo Email: park@geneseo.edu Minseok Kwon Rochester Institute of Technology Email: jmk@cs.rit.edu Abstract A Bloom filter is a succinct

More information

Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3

Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3 Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3 Han Zhi-nan Yan Wei Zhang Li Wang Yue Computer Network Laboratory Department of Computer Science & Technology, Peking University

More information

Introduction. Router Architectures. Introduction. Introduction. Recent advances in routing architecture including

Introduction. Router Architectures. Introduction. Introduction. Recent advances in routing architecture including Introduction Router Architectures Recent advances in routing architecture including specialized hardware switching fabrics efficient and faster lookup algorithms have created routers that are capable of

More information

Computer Networks 56 (2012) Contents lists available at SciVerse ScienceDirect. Computer Networks

Computer 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 information

Projecting IPv6 Packet Forwarding Characteristics Under Internet-wide Deployment

Projecting IPv6 Packet Forwarding Characteristics Under Internet-wide Deployment Projecting IPv6 Packet Forwarding haracteristics Under Internet-wide eployment raig A. Shue and Minaxi Gupta omputer Science epartment, Indiana University {cshue, minaxi}@cs.indiana.edu ABSTRAT While routing

More information

Efficient Packet Classification for Network Intrusion Detection using FPGA

Efficient 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 information

Performance Improvement of Hardware-Based Packet Classification Algorithm

Performance 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 information