NDLI: Producing a high hit ratio and low search time in forwarding routing tables by predicting IP addresses

Content Provider	IEEE Xplore Digital Library
Author	Bahattab, A.A. Bodnar, B. Kraft, G. Evens, M.
Copyright Year	2002
Description	Author affiliation: Comput. Technol. Dept., Jeddah Coll. of Electron. Tech., Saudi Arabia (Bahattab, A.A.)
Abstract	In computer networks, fast routing is one of the main factors to speed up the transmission of the IP packets from the source to the destination computers. A router has a forwarding table (cache table) and a routing table. The forwarding table is derived from the routing table, which is maintained constantly by the router using one of the common routing protocols. There are two factors that affect the speed of the forwarding decisions. First, when a forwarding table holds a huge number of IP addresses, a complicated search algorithm is needed, which implies a high search time. If a complicated search algorithm is not used, then the forwarding table has to be set up in a manner to reduce search time; this implies that the table must be set up by a processor that has a substantial computing power. Second, the availability of the incoming IP address in the forwarding table (hit rate) reduces the extended search in the routing table. Our study examines the IP address streams. Two models were built to predict IP addresses. These models are plugged into the cache system simulation to prefetch the IP addresses prior to the router requests. The prediction scheme produces a higher hit ratio in comparison with the current cache schemes. Also, it reduces the cache table size, which implies low search time.
Starting Page	2338
Ending Page	2344
File Size	444276
Page Count	7
File Format	PDF
ISBN	0780376323
DOI	10.1109/GLOCOM.2002.1189049
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-11-17
Publisher Place	Taiwan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Databases Computer networks Power system modeling Spine Centralized control Computer science Educational institutions Routing protocols Availability Predictive 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

On the IP routing tables minimization with addresses reassignments

Viewserver hierarchy: a new inter-domain routing protocol

Networks without Borders: Communication despite Disconnection

Why we still don't know how to simulate networks

Why we still don't know how to simulate networks

A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol

A Hybrid Multi-Path Routing for Wireless Mesh Network Backbone

Constructing optimal IP routing tables

Forwarding state scalability for multicast provisioning in IP networks

Producing a high hit ratio and low search time in forwarding routing tables by predicting IP addresses

Similar Documents

On the IP routing tables minimization with addresses reassignments

Viewserver hierarchy: a new inter-domain routing protocol

Networks without Borders: Communication despite Disconnection

Why we still don't know how to simulate networks

Why we still don't know how to simulate networks

A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol

A Hybrid Multi-Path Routing for Wireless Mesh Network Backbone

Constructing optimal IP routing tables

Forwarding state scalability for multicast provisioning in IP networks

Producing a high hit ratio and low search time in forwarding routing tables by predicting IP addresses