NDLI: A scalable routing architecture for prefix tries

Content Provider	IEEE Xplore Digital Library
Author	Yi Wu Ge Nong
Copyright Year	2011
Description	Author affiliation: Department of Computer Science, Sun Yat-sen University, Guangzhou, China (Yi Wu; Ge Nong)
Abstract	While the throughput demand for a backbone router keeps increasing constantly, both routing and switching of packets are facing tough challenges for running faster. Currently, the prefix tries based routing algorithms are playing a key role in building high performance routing systems. We proposed in this article a routing architecture for scaling the throughput of a trie-based routing system, which consists of multiple memory blocks for trie storage and a buffer for queuing packets to resolve temporary memory access contentions. Specifically, when a trie is constructed, we store the nodes of the trie evenly into each memory block. The scheduling of queuing packets to access the memory blocks for their routes is modeled as a bipartite matching problem. A queuing model is developed to examine the system's theoretical performance under some simplified assumptions, and a series of computer simulation experiments are conducted for performance evaluation of the proposed system under more realistic conditions. The results from both the analytical queuing model and the simulation experiments indicate that this architecture can be a potential candidate for building high bandwidth routing engines for backbone routers.
Starting Page	264
Ending Page	269
File Size	173886
Page Count	6
File Format	PDF
ISBN	9781457718243
ISSN	15566463
e-ISBN	9781457718267
DOI	10.1109/ICON.2011.6168486
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-14
Publisher Place	Singapore
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Pipelines Throughput Scheduling Switches IP networks Analytical models
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

A load-balanced pipeline architecture for IP route lookup

Scalable high-throughput SRAM-based architecture for IP-lookup using FPGA

SRAM based longest prefix matching approach for multigigabit IP processing

Dynamic pipelining: making IP-lookup truly scalable

Decision Forest: A Scalable Architecture for Flexible Flow Matching on FPGA

Towards hardware architecture for memory efficient IPv4/IPv6 Lookup in 100 Gbps networks

Longest Prefix Match and updates in Range Tries

A high-speed and scalable switching fabrics for Internet routers

Dynamic pipelining:making IP-lookup truly scalable

A scalable routing architecture for prefix tries

Similar Documents

A load-balanced pipeline architecture for IP route lookup

Scalable high-throughput SRAM-based architecture for IP-lookup using FPGA

SRAM based longest prefix matching approach for multigigabit IP processing

Dynamic pipelining: making IP-lookup truly scalable

Decision Forest: A Scalable Architecture for Flexible Flow Matching on FPGA

Towards hardware architecture for memory efficient IPv4/IPv6 Lookup in 100 Gbps networks

Longest Prefix Match and updates in Range Tries

A high-speed and scalable switching fabrics for Internet routers

Dynamic pipelining:making IP-lookup truly scalable

A scalable routing architecture for prefix tries