Content router FIB storage structure and data processing method thereof
A storage structure and router technology, applied in data exchange networks, digital transmission systems, electrical components, etc., can solve the problems of difficult storage consumption, name retrieval speed, and insufficient consideration of differentiated name retrieval, and achieve the effect of improving retrieval speed.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0070] The FIB storage structure and data processing method of the content router of the present invention are tested for software deployment on a computer configured with Intel Xeon E5-1650 v2 3.50 GHz and DDR3 24GB SDRAM. Experimental results show that under the condition that the false positive probability is 1%, the on-chip storage consumption of the FIB storage structure is 58.258MB, which can be deployed on the high-speed memory SRAM. Under the condition of supporting the LNPM mechanism, the actual throughput of the FIB storage structure is 11.64 million data packets per second, which can meet the current Internet requirements for fast processing of data packets. This shows that the FIB storage structure and data processing method of the content router designed in the present invention are suitable for the current memory hardware level, can effectively support the LNPM mechanism, and improve the retrieval speed of name data.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



