NDLI: High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression

Content Provider	IEEE Xplore Digital Library
Author	Sundstron, M. Larzon, L.-A.
Copyright Year	2005
Description	Author affiliation: Dept. of Comput. Sci. & Electr. Eng., Lulea Univ. of Technol., Sweden (Sundstron, M.; Larzon, L.-A.)
Abstract	Longest prefix matching is frequently used for IP forwarding in the Internet. Data structures used must be not only efficient, hut also robust against pathological entries caused by an adversary or misconfiguration. In this paper, we attack the longest prefix matching problem by presenting a new algorithm supporting high lookup performance, fast incremental updates and guaranteed compression ratio. High lookup performance is achieved by using only four memory accesses. Guaranteed compression ratio is achieved by combining direct indexing with an implicit tree structure and carefully choosing which construct to use when updating the forwarding table. Fast incremental updates are achieved by a new memory management technique featuring fast variable size allocation and deallocation while maintaining zero fragmentation. An IPv4 forwarding table data structure can be implemented in software or hardware within 2.7 Mb of memory to represent 2/sup 18/ routing entries. Incremental updates require only 752 memory accesses in worst case for the current guaranteed compression ratio. For a hardware implementation, we can use 300 MHz SRAM organized in four memory banks and four pipeline stages to achieve a guaranteed performance of 300 million lookups per second, corresponding to /spl sim/ 100 Gbit/s wire speed forwarding, and 400,000 incremental updates per second. In measurements performed on a 3.0 GHz Pentium 4 machine using a routing table with more than 2/sup 17/ entries, we can forward over 27 million IPv4 packets per second, which is equivalent to wire speeds exceeding 10 Gbit/s. On the same machine and with the same routing table, we can perform over 230,000 incremental updates/second.
Starting Page	1641
Ending Page	1652
File Size	2571649
Page Count	12
File Format	PDF
ISBN	0780389689
ISSN	0743166X
DOI	10.1109/INFCOM.2005.1498446
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-03-13
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Data structures Hardware Wire Internet Robustness Pathology Indexing Tree data structures Memory management
Content Type	Text
Resource Type	Article
Subject	Computer Science Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression (2005)

High-performance Longest Prefix Match Logic Supporting Fast Updates for IP Forwarding Devices

Tree bitmap: hardware/software ip lookups with incremental updates (2002).

TCAM-based high speed Longest prefix matching with fast incremental table updates

Survey and Proposal on Binary Search Algorithms for Longest Prefix Match

A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing

High-Speed IP Address Lookups Using Hardware Based Tree Structures

A Hardware-Based Longest Prefix Matching Scheme for TCAMs

Longest Prefix Search Using Compressed Trees (1998)

High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression

Similar Documents

High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression (2005)

High-performance Longest Prefix Match Logic Supporting Fast Updates for IP Forwarding Devices

Tree bitmap: hardware/software ip lookups with incremental updates (2002).

TCAM-based high speed Longest prefix matching with fast incremental table updates

Survey and Proposal on Binary Search Algorithms for Longest Prefix Match

A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing

High-Speed IP Address Lookups Using Hardware Based Tree Structures

A Hardware-Based Longest Prefix Matching Scheme for TCAMs

Longest Prefix Search Using Compressed Trees (1998)

High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression