• Home
  • Search
  • Fast and scalable schemes for the IP address lookup problem
  • Cite Icon62
  • https://doi.org/10.1109/hpsr.2000.856650Copy DOI Icon

Fast and scalable schemes for the IP address lookup problem

  • Jun 26, 2000
  • N Yazdani +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Routers forward a packet based on the packet destination address. To do this, they must find the longest matching prefix with the packet destination address in the IP lookup tables. Expanding the size of the global network increases the size of the lookup tables. Increasing the communication line speed reduces the processing and search time since the packets must be switched at wire speed. This implies that the forwarding engines need more efficient IP lookup techniques. We believe the fundamental issue preventing applying the usual tree structures such as m-way trees to the IP lookup problem is the lack of a systematic method to compare and sort strings of different lengths when some of them are prefixes of others. Therefore, a simple scheme for comparing and sorting IP address prefixes is first introduced. Then, we manipulate the prefix data and tune the well known data structures in order to apply them to the IP lookup problem. We propose a binary prefix tree and devise procedures to sort the prefixes and build the index structure. It uses O(N) memory space and works well for the longest prefix matching problem. The binary search tree is extended to m-way trees in order to get better search performance in the next steps. Two versions of m-way trees are proposed, a static m-way prefix tree and a dynamic m-way prefix tree. The first one is more suitable for an environment with lower transaction and expected to give better memory usage and more compact tree structure. The later one, the dynamic m-way prefix tree, is built bottom up like the B-tree and is more suitable for an environment with higher transactions. All data structures share a common property that no data prefix can be in a higher level than its prefix(es). We believe the proposed schemes are simple, well defined, easy to implement in hardware or software and scalable compared to the previously proposed methods while having efficient memory usage and search performance.

Similar Papers
  • Book Chapter
  • Citations1

Introduction to Binary Trees

  • Dec 31, 2013
  • Noel Kalicharan
  • Conference Article
  • Citations16

A longest prefix first search tree for IP lookup

  • Jan 01, 2005
  • Lih-Chyau Wuu +2
  • Conference Article
  • Citations3

Creating a Forest of Binary Search Trees for a Multiprocessor System

  • Sep 13, 2006
  • Suri Pushpa +2
  • Conference Article
  • Citations3

Multi-Finger Binary Search Trees

  • Jan 01, 2019
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Parinya Chalermsook +4
  • Research Article

Postorder trees and Eulerian numbers

  • Jul 01, 1991
  • Acta Informatica
  • Thomas P Whaley
  • PDF
  • Research Article
  • Citations6

A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic.

  • Jan 01, 2016
  • Computational intelligence and neuroscience
  • Jin-Peng Qi +2
  • Book Chapter
  • Citations10

Efficient Construction of Near-Optimal Binary and Multiway Search Trees

  • Jan 01, 2009
  • Prosenjit Bose +1
  • Conference Article
  • Citations12

Deletion without Rebalancing in Non-Blocking Binary Search Trees

  • Jan 01, 2017
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Meng He +1
  • Research Article

Filtering sinyal menggunakan bandpass filter

  • Apr 01, 2021
  • J-ICOM - Jurnal Informatika dan Teknologi Komputer
  • Agus Muliadi +1
  • Book Chapter
  • Citations6

On a sublinear time parallel construction of optimal binary search trees

  • Jan 01, 1994
  • Marek Karpinski +1
  • Conference Article
  • Citations2

Kakkot Tree — A Binary Search Tree with caching

  • Dec 01, 2012
  • Rajesh Ramachandran
  • Research Article
  • Citations1

An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

  • Jun 04, 2008
  • International Journal of Communication Systems
  • Luis Rueda +1
  • Conference Article

Improving efficacy of concurrent internal binary search trees using local recovery

  • Jan 04, 2019
  • Arunmoezhi Ramachandran +1
  • Conference Article
  • Citations1

A fast method for change point detection from large-scale time series based on Haar Wavelet and Binary Search Tree (HWBST)

  • Jul 01, 2014
  • Jin-Peng Qi +3
  • Research Article
  • Citations14

On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular <italic>n</italic>-Simplex

  • Jan 01, 2015
  • Informatica
  • Guillermo Aparicio +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.