NDN Name Management via Fixed-Length Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Named Data Networking (NDN) for datacenter networks, routing requests based on long, complex names is resource-intensive and expensive in terms of processor operations, especially at high throughput.
Innovation Solution
Implementing a method that maps variable-length names in a first namespace to fixed-length names in a second namespace using a longest prefix tree, collapsing non-branching paths and dividing the namespace into segments to facilitate efficient routing, thereby translating and routing requests using the translated fixed-length names.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If variable-length names are used in NDN for datacenter networks, then naming flexibility and expressiveness are improved, but routing complexity and processor operations increase
Solution Approach 1:
The patent segments the variable-length name space into multiple fixed-length segments. Each segment is processed independently through hashing functions, transforming the complex variable-length naming problem into simpler fixed-length processing units that can be handled efficiently by routing tables.
Solution Approach 2:
The patent introduces fixed-length segment names as intermediary representations between the original variable-length names and the routing infrastructure. These segments act as mediators that preserve naming flexibility while enabling efficient fixed-length routing operations.
2Measurement precision
If long names are used for routing requests in NDN, then data object identification precision is improved, but processor operations and routing cost increase
Solution Approach 1:
The patent divides long names into multiple fixed-length segments, allowing precise identification of data objects through the combination of segments while keeping each individual segment compact and efficient for processing. This segmentation maintains identification precision without requiring processing of the entire long name at once.
Solution Approach 2:
The patent transforms the name length parameter from variable to fixed for each segment. By changing the parameter representation from long variable-length strings to shorter fixed-length segments, the system achieves the same identification precision with reduced processor operations.
3Adaptability or versatility
If variable-length names are used in NDN, then namespace expressiveness is improved, but routing table size and memory requirements increase
Solution Approach 1:
The patent segments the namespace into fixed-length units, allowing the routing table to store compact fixed-length segment entries rather than full variable-length names. This segmentation reduces the memory footprint of routing tables while preserving the expressiveness of the original namespace through the combination of segments.
Solution Approach 2:
The patent creates fixed-length segment copies from variable-length names. These compact segment copies are stored in routing tables instead of the original long names, reducing memory requirements while maintaining the ability to reconstruct and identify the original data objects through segment combinations.
Data Source
AI summary
The present disclosure relates generally to the field of efficient name management for named data networking in datacenter networks. In various examples, efficient name management for named data networking in datacenter networks may be implemented in the form of systems, methods and/or algorithms.