NDLI: A B-tree dynamic router-table design

Content Provider	IEEE Xplore Digital Library
Author	Lu, H. Sahni, S.
Copyright Year	2004
Description	Author affiliation: Dept. of Comput. & Information Sci., Florida Univ., Gainesville, FL, USA (Lu, H.; Sahni, S.)
Abstract	We propose B-tree data structures for dynamic router-tables for the cases when the filters are prefixes as well as when they are nonintersecting ranges. A crucial difference between our data structure for prefix filters and the B-tree router-table data structure of Suri et al. (2001) is that in our data structure, each prefix is stored in O(1) B-tree nodes per B-tree level, whereas in the structure of Suri et al. (2001), each prefix is stored in O(m) nodes per level (m is the order of the B-tree). As a result of this difference, a prefix may be inserted or deleted from an n-filter router table accessing only O(log/sub m/ n) nodes of our data structure; these operations access O(m log/sub m/ n) nodes using the structure of Suri et al. (2001). Eventhough the asymptotic complexity of prefix insertion and deletion is the same in both B-tree structures, experiments conducted by us show that because of the reduced cache misses for our structure, the measured average insert and delete times using our structure are about 30% less than when the B-tree structure of Suri et al. (2001) is used. Further, an update operation using the B-tree structure of Suri et al. (2001) will, in the worst case, make 2.5 times as many cache misses as made when our structure is used. The asymptotic complexity to find the longest matching prefix is the same, O(m log/sub m/ n) in both B-tree structures, and in both structures, this operation accesses O(log/sub m/ n) nodes. The measured time for this operation also is nearly the same for both data structures. Both B-tree structures for prefix router-tables take O(n) memory. However, our structure Is more memory efficient by a constant factor.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Simulation IEEE Commun. Soc
Starting Page	840
Ending Page	845
File Size	641588
Page Count	6
File Format	PDF
ISBN	078038623X
DOI	10.1109/ISCC.2004.1358645
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-07-28
Publisher Place	Egypt
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data structures Matched filters Information filtering Information filters Routing Information science Data engineering Time measurement Internet Frequency
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

Dynamic IP router-tables using highest-priority matching

Prefix- and interval-partitioned router-tables [IP routing]

Dynamic Tree Bitmap for IP Lookup and Update

Dynamic Tree Bitmap for IP Lookup and Update

A Novel Dynamic Router-Tables Design for IP Lookup and Update

A B-tree dynamic router-table design

Data structures for one-dimensional packet classification using most-specific-rule matching

A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables

Adaptive Statistical Optimization Techniques for Firewall Packet Filtering

A B-tree dynamic router-table design

Similar Documents

Dynamic IP router-tables using highest-priority matching

Prefix- and interval-partitioned router-tables [IP routing]

Dynamic Tree Bitmap for IP Lookup and Update

Dynamic Tree Bitmap for IP Lookup and Update

A Novel Dynamic Router-Tables Design for IP Lookup and Update

A B-tree dynamic router-table design

Data structures for one-dimensional packet classification using most-specific-rule matching

A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables

Adaptive Statistical Optimization Techniques for Firewall Packet Filtering

A B-tree dynamic router-table design