NDLI: SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation

Content Provider	ACM Digital Library
Author	Pong, Fong Tzeng, Nian-Feng
Copyright Year	2010
Abstract	A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). The proposed design involves two key techniques to lower table storage required drastically: 1) storing transformed prefix representations; and 2) accommodating multiple prefixes per table entry via prefix aggregation, achieving superior storage-efficiency (SUSE). With each prefix $(p(\textit{x}))$ maneuvered as a polynomial, $p(\textit{x})$ = $q(\textit{x})$ × $g(\textit{x})$ + $r(\textit{x})$ based on a divisor $g(\textit{x}),$ SUSE keeps only $q(\textit{x})$ rather than full and long $p(\textit{x})$ in an $r(\textit{x})-indexed$ table with $2^{degree(g(x))}$ entries, because $q(\textit{x})$ and $r(\textit{x})$ uniquely identify $p(\textit{x}).$ Additionally, using $r(\textit{x})$ as the hash index exhibits better distribution than do original prefixes, reducing hash collisions, which can be tolerated further by the set-associative design. Given a set of chosen prefix lengths (called "treads"), all prefixes are rounded down to nearest treads under SUSE before hashed to the table using their transformed representations so that prefix aggregation opportunities abound in hash entries. SUSE yields significant table storage reduction and enjoys fast lookups and speedy incremental updates not possible for a typical trie-based design, with the worst-case lookup time shown upper-bounded theoretically by the number of treads ζ but found experimentally to be 4 memory accesses when ζ equals 8. SUSE makes it possible to fit a large routing table with 256 K (or even 1 M) prefixes in on-chip SRAM by today's ASIC technology. It solves both the memory- and the bandwidth-intensive problems faced by IP routing.
Starting Page	81
Ending Page	94
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2009.2022085
Volume Number	18
Issue Number	1
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-02-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Hash tables Linear feedback shift registers Longest prefix matching Prefix aggregation Prefix transformation Routing tables Table storage Tries
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

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

SUSE: Superior Storage-Efficiency for Routing Tables Through Prefix Transformation and Aggregation

Suse: superior storage-efficiency for routing tables through prefix transformation and aggregation.

Suse: superior storage-efficiency for routing tables through prefix transformation and aggregation (2009).

Concise lookup tables for IPv4 and IPv6 longest prefix matching in scalable routers

Efficient construction of multibit tries for IP lookup

Concise Lookup Tables for IPv4 and IPv6 Longest Prefix Matching in Scalable Routers

Dynamic pipelining:making IP-lookup truly scalable

Longest prefix matching using bloom filters

Scalable, memory efficient, high-speed IP lookup algorithms

SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation

Similar Documents

SUSE: Superior Storage-Efficiency for Routing Tables Through Prefix Transformation and Aggregation

Suse: superior storage-efficiency for routing tables through prefix transformation and aggregation.

Suse: superior storage-efficiency for routing tables through prefix transformation and aggregation (2009).

Concise lookup tables for IPv4 and IPv6 longest prefix matching in scalable routers

Efficient construction of multibit tries for IP lookup

Concise Lookup Tables for IPv4 and IPv6 Longest Prefix Matching in Scalable Routers

Dynamic pipelining:making IP-lookup truly scalable

Longest prefix matching using bloom filters

Scalable, memory efficient, high-speed IP lookup algorithms

SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation