Amanote Research

Amanote Research

    RegisterSign In

IP Lookup by Binary Search on Prefix Length

doi 10.1109/iscc.2003.1214104
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
S. Sahni
Publisher

IEEE Comput. Soc


Related search

Evaluation and Comparison of Binary Trie Base IP Lookup Algorithms With Real Edge Router IP Prefix Dataset

International Journal of Advanced Computer Science and Applications
Computer Science
2016English

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

IEEE Journal on Selected Areas in Communications
Computer NetworksElectronic EngineeringElectricalCommunications
2003English

Guarantee IP Lookup Performance With FIB Explosion

2014English

An IPv6 Address Lookup Algorithm Based on Multi-Bit Trie and Prefix Hierarchy

DEStech Transactions on Engineering and Technology Research
2017English

IP Address Lookup and Packet Classification Algorithms

English

Speeding Up IP Lookup Procedure in Software Routers by Means of Parallelization

Telfor Journal
Media TechnologySignal ProcessingComputer NetworksRadiationCommunicationsSoftware
2017English

IPStash: A Power-Efficient Memory Architecture for IP-lookup

English

Efficient IP Table Lookup via Adaptive Stratified Trees With Selective Reconstructions

Journal of Experimental Algorithmics
Theoretical Computer Science
2008English

On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy