A longest prefix first search tree for IP lookup

No abstract is available for this paper.

• Publication year

  2005

• Venue

  IEEE International Conference on Communications, 2005. ICC 2005. 2005

• Publication date

  2005-05-16

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/j.comnet.2007.01.023
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computer networks

  2018cited by this paper
• The Internet Protocol

  2005cited by this paper
• A fast IP lookup scheme for high speed routers

  2005influential reference
• IP lookup with low memory requirement and fast update

  2003influential reference
• Survey and taxonomy of IP address lookup algorithms

  2001influential reference
• Analyzing the Internet's BGP Routing Table

  2001cited by this paper
• A fast IP lookup scheme for longest-matching prefix

  2001cited by this paper
• IP-address lookup using LC-tries

  1999cited by this paper
• A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers

  1999cited by this paper
• Routing lookups in hardware at memory access speeds

  1998influential reference
• Small forwarding tables for fast routing lookups

  1997influential reference
• Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy

  1993cited by this paper
• An Architecture for IP Address Allocation with CIDR

  1993cited by this paper
• Trie memory

  1960influential reference

• Fast and efficient lookups via data-driven FIB designs

  2022cites this paper
• Multilevel length-based classified index table for IP lookups and updates

  2020cites this paper
• High-Performance IPv6 Lookup with Real-Time Updates Using Hierarchical-Balanced Search Tree

  2018cites this paper
• Using Route Forwarding State to Identify Routing Errors in Mission-Critical, Military Data Networks

  2017cites this paper
• Measuring and Implementing Internet Backbone Security: Current Challenges, Upcoming Deployment, and Future Trends

  2016cites this paper
• A Comprehensive Review of Energy Efficient Content Addressable Memory Circuits for Network Applications

  2016cites this paper
• BASSINS VERSANTSFonctionnement des petits bassins versants miniers

  2016cites this paper
• Lookup in an IP Router Based On a Reorganized Binary Prefixes Value Tree ( RBPVT )

  2016cites this paper
• Design and implementation of the ctrie-hash algorithm for fast routing lookup

  2015cites this paper
• The Development Status and Trend of NetFPGA

  2015cites this paper
• A hierarchical hashing scheme to accelerate longest prefix matching

  2014cites this paper
• RTRlib: An Open-Source Library in C for RPKI-based Prefix Origin Validation

  2013cites this paper
• A high-throughput and high-capacity IPv6 routing lookup system

  2013influential citation
• A hierarchical high-throughput and low power architecture for longest prefix matching for packet forwarding

  2013cites this paper
• Development and analysis of energy efficient match-line sensing circuits for high-speed ternary content addressable memory

  2013cites this paper
• Updates from the Internet Backbone: An RPKI/RTR Router Implementation, Measurements, and Analysis

  2013influential citation
• Route Lookup Algorithms Using the Novel Idea of Coded Prefix Trees

  2012cites this paper
• A Classified Multisuffix Trie for IP Lookup and Update

  2012influential citation
• Content-based route lookup using CAMs

  2012cites this paper
• An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

  2012influential citation
• A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

  2012cites this paper
• A dynamic indirect IP lookup based on prefix relationships

  2012cites this paper
• Enhanced Patricia Tree with Reordering and Fast Incremental and Decremental Update Functions

  2012cites this paper
• A New Scheme for IPv6 BD-TTCS Translator: A Section Division Approach

  2012cites this paper
• Next hop storage and retrieval for coded and scalar IP prefix trees

  2011cites this paper
• Divide-and-conquer based IPv6 address LPR in BD-SIIT IPv4/IPv6 transition using a novel reduced segment table(RST) algorithm

  2011cites this paper
• Extraction de motifs spatio-temporels dans des séries d'images de télédétection : application à des données optiques et radar

  2011cites this paper
• Coded and Scalar Prefix Trees: Prefix Matching Using the Novel Idea of Double Relation Chains

  2011cites this paper
• SCALABLE PACKET PROCESSING FOR HIGH-SPEED NETWORKS

  2011cites this paper
• IP Lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates

  2010cites this paper
• A Fast IP Address Lookup Algorithm Based on Search Space Reduction

  2010influential citation
• A Hybrid Approach to CAM-Based Longest Prefix Matching for IP Route Lookup

  2010cites this paper
• IP address lookup for Internet routers using cache routing table

  2010cites this paper
• IP Lookup using Two-level Indexing and B-Trees

  2010cites this paper
• Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet

  2009influential citation
• Radiometric evolution classification in a High Resolution Satellite Image Time Series (SITS)

  2008cites this paper
• On mining pixel based evolution classes in satellite image time series

  2008cites this paper
• A Novel Level-Based IPv6 Routing Lookup Algorithm

  2008influential citation
• A Dynamic Binary Hash Scheme for IPv6 Lookup

  2008influential citation
• A Scalable Exact matching in Balance Tree Scheme for IPv6 Lookup

  2007cites this paper
• Using Bit Selection to Do Routing Table Lookup

  2007influential citation
• A New Efficient Binary Search on Range for IP Address Lookup

  2006cites this paper
• Overlapping Hash Trie: A Longest Ppefix First Search Scheme for IPv4/IPv6 Lookup

  2006influential citation
• Enhanced Patricia Tree with Reordering (EPT-R) is a sophisticated high-throughput routing lookup by using localities in network

  year unknowncites this paper