NDLI: Bit-map trie: a data structure for fast forwarding lookups

Content Provider	IEEE Xplore Digital Library
Author	Seung-Hyun Oh Jong-Suk Ahn
Copyright Year	2001
Description	Author affiliation: Comput. Eng. Dept., Dongguk Univ., Seoul, South Korea (Seung-Hyun Oh)
Abstract	This paper proposes a data structure to perform forwarding lookups at gigabit speed by condensing the routing table of backbone routers into cache, thus eliminating slow memory accesses. The proposed structure bases on the conventional trie, known to be good for partial string searches. For the longest IP matching lookups, each level denotes a segment of IP address, and a node has multiple links each of which represents one combination of the address segment assigned to that level. When a given IP address reaches the dead-end node by following the links matching the IP address segment-by-segment, the node points the routing entry for forwarding the packet. For size reduction, the trie compresses pointers of child's locations and routing entries as a bit array where a single bit encodes a pointer. So, we call the proposed structure bit-map (BM) trie. For better performance, the BM trie jumps to the appropriate node at the middle level rather than starts from the root node. The experiments show that it compacts backbone routers' tables into 512 Kbyte cache and accomplishes around 2.4 million lookups per second on Pentium II processor.
Starting Page	1872
Ending Page	1876
File Size	205287
Page Count	5
File Format	PDF
ISBN	0780372069
DOI	10.1109/GLOCOM.2001.965899
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2001-11-25
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data structures Routing Spine Internet Data engineering Optical fiber communication Hardware Random access memory Computer aided manufacturing CADCAM
Content Type	Text
Resource Type	Article

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

Binary decision diagrams for efficient hardware implementation of fast IP routing lookups

Forwarding engine for fast routing lookups and updates

Routing lookups in hardware at memory access speeds

Pipelined architecture for fast IP lookup

Scalable IP lookup for programmable routers

Reconfigurable memory architecture for scalable IP forwarding engines

Searching very large routing tables in fast SRAM

Fast trie-based routing lookup with tiny searchable core

Optimizing routing tables on systems-on-chip with Content-Addressable Memories

Bit-map trie: a data structure for fast forwarding lookups

Similar Documents

Binary decision diagrams for efficient hardware implementation of fast IP routing lookups

Forwarding engine for fast routing lookups and updates

Routing lookups in hardware at memory access speeds

Pipelined architecture for fast IP lookup

Scalable IP lookup for programmable routers

Reconfigurable memory architecture for scalable IP forwarding engines

Searching very large routing tables in fast SRAM

Fast trie-based routing lookup with tiny searchable core

Optimizing routing tables on systems-on-chip with Content-Addressable Memories

Bit-map trie: a data structure for fast forwarding lookups