NDLI: Update-aware Controlled Prefix Expansion for fast IP lookups

Content Provider	IEEE Xplore Digital Library
Author	Yeim-Kuan Chang Yung-Chieh Lin Kuan-Ying Ho
Copyright Year	2009
Description	Author affiliation: National Cheng Kung University, Tainan, Taiwan (Yeim-Kuan Chang; Yung-Chieh Lin; Kuan-Ying Ho)
Abstract	In high performance routers design, fast IP address lookup is always a challenge. In order to obtain fast lookup speed, multi-bit tries are often used to represent the routing tables [1,2,3,6]. The drawbacks of multi-bit tries are the large memory usage and extensive update cost. To reduce the memory usage of multi-bit tries, Srinivasan and Varghese proposed a scheme called Controlled Prefix Expansion (CPE) [2] that uses the dynamic programming technique to obtain the optimal multi-bit tries in terms of memory usage. Furthermore, current backbone routers usually run the Border Gateway Protocol (BGP). BGP may cause a few hundred of updates per second. To make multi-bit tries adequate to these updates, a series of multi-bit tries nodes need to be modified. Since these updates can seriously affect the lookup speed, we need to minimize these update cost. However, CPE does not concern this issue. In this paper, we explore the optimization issue in terms of the update cost. We want to find an update-optimal multi-bit tries that still have the efficiency of lookup speed and memory usage. Contrast to CPE, our solutions achieve a 26% reduction of the update overhead and improve 38% of the search speed. Besides, we also examine our schemes in IPv6 routing tables. The experimental results show that our scheme can also scale well in IPv6.
Starting Page	1
Ending Page	6
File Size	6733442
Page Count	6
File Format	PDF
ISBN	9781424451746
DOI	10.1109/HPSR.2009.5307416
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-06-22
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Spine Cost function Data structures Optimal control Dynamic programming Protocols Buildings controlled prefix expansion IP address lookup multi-bit tries route update
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

1 Update-aware Controlled Prefix Expansion for Fast IP Lookups

Fast address lookups using controlled prefix expansion

Faster IP Lookups using Controlled Prefix Expansion (1998)

Faster IP Lookups using Controlled Prefix Expansion (1998)

Fast Address Lookups using Controlled Prefix Expansion (1999)

Optimal Routing Table Design for IP Address Lookups Under Memory Constraints (1999)

Shape shifting tries for faster ip route lookup.

route lookups as string matching

Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup (2002)

Update-aware Controlled Prefix Expansion for fast IP lookups

Similar Documents

1 Update-aware Controlled Prefix Expansion for Fast IP Lookups

Fast address lookups using controlled prefix expansion

Faster IP Lookups using Controlled Prefix Expansion (1998)

Faster IP Lookups using Controlled Prefix Expansion (1998)

Fast Address Lookups using Controlled Prefix Expansion (1999)

Optimal Routing Table Design for IP Address Lookups Under Memory Constraints (1999)

Shape shifting tries for faster ip route lookup.

route lookups as string matching

Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup (2002)

Update-aware Controlled Prefix Expansion for fast IP lookups