Hash-Based Content Routing in Content-Based Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional content-based network systems redundantly store the same content in multiple local routers, leading to inefficient distribution and increased traffic load, as content request messages are transmitted in a flooded manner, limiting scalability and service quality.
Innovation Solution
Assigning unique hash values to local routers and storing content based on these values, allowing content request messages to be directly transmitted to the mapped local router, thereby reducing redundant storage and network traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If content request messages are transmitted in a flooded manner to all local routers, then content can be found in any router storing it, but network traffic load increases and transmission efficiency decreases
Solution Approach 1:
The network is segmented into multiple groups, with each group managed by a group router. Content is distributed across different groups based on hash values, and request messages are routed to specific groups rather than flooding all routers. This segmentation reduces unnecessary traffic while maintaining content accessibility.
Solution Approach 2:
Group routers act as intermediaries between user devices and content-storing routers. When a content request is received, the group router determines the target group based on hash values and forwards the request only to relevant group routers, which then route to specific content routers. This intermediary mechanism eliminates flooded transmission.
2Reliability
If the same content is stored in multiple local routers for redundancy, then content availability increases, but storage space is wasted and distribution efficiency decreases
Solution Approach 1:
The system uses hash values of content identifiers as parameters to determine storage location. Each content item is assigned to a specific router within a group based on its hash value, ensuring unique storage without redundancy. This parameter-based allocation optimizes storage space while maintaining availability through the group routing mechanism.
Solution Approach 2:
The patent introduces a new dimension for content distribution by using hash values to map content to specific routers within groups. Instead of replicating content across multiple routers (traditional redundancy), the system organizes content in a hash-based distributed structure where each router stores unique content, and the group router enables access from any group member to any content in its group.
3Speed
If content is distributed across all local routers, then content access speed improves, but network complexity and routing overhead increase
Solution Approach 1:
The network is divided into groups managed by group routers, which handle routing decisions. This segmentation simplifies individual router complexity while maintaining fast access, as group routers manage the distribution logic and user devices only need to communicate with their local group router.
Solution Approach 2:
Group routers serve as intermediaries that absorb routing complexity. User devices send requests to group routers, which then determine the appropriate target router using hash values and forward requests accordingly. This intermediary approach hides routing complexity from end devices while enabling efficient content access.
Data Source
AI summary
The present invention relates to a method for transmitting content in a content-based network and, more particularly, to a content transmission method by which requested content is identified on the basis of a hash value of the requested content so as to be stored only in mapped routers, thereby preventing the same content from being duplicately stored in routers in a regional group such that various types of content can be distributed and stored, and a content request message is directly transmitted only to routers mapped to a hash value of requested content, on the basis of the hash value of the requested content, such that a traffic load, occurring due to the transmission of a content request message by a flooding scheme, can be reduced.