Content Router Cache Synchronization via Joint Hashing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Information-Centric Networks (ICNs) face challenges in efficiently exchanging and updating large-scale forwarding table information between content routers due to the magnitude of content routing, which is not adequately addressed by existing technologies.
Innovation Solution
The method involves creating a hash of cache contents using a joint hash function shared between content routers, encoding it with distributed source coding, and transmitting the encoded hash to enable efficient data exchange and reconstruction of content tables, minimizing data transfer while handling correlations and differences between router caches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If content routing is implemented in ICNs, then routing based on content enables flexible content delivery, but the size of forwarding tables increases by several orders of magnitudes
Solution Approach 1:
The patent extracts only the essential information needed for routing decisions by creating a hash of the content table entries and transmitting only this compressed representation rather than the entire table. This allows routers to maintain accurate routing information while dramatically reducing the data exchange burden.
Solution Approach 2:
The patent transforms the content table from its original detailed form into a hashed representation, changing the parameter space from full entry storage to compressed hash exchange. This parameter transformation enables efficient synchronization while maintaining routing functionality.
2Reliability
If entire content tables are exchanged between routers, then complete routing information is obtained, but redundant data transmission increases data transfer burden
Solution Approach 1:
The patent extracts only the necessary routing information by hashing the content tables and exchanging only the hash values. This extraction approach maintains complete routing information availability while eliminating redundant data transmission that would occur if entire tables were exchanged.
Solution Approach 2:
The patent creates a compressed copy of the routing information through hashing, allowing routers to exchange this condensed representation rather than the full original data. This copying approach preserves routing completeness while significantly reducing transmission volume.
3Measurement precision
If detailed content table synchronization is performed, then accurate routing is maintained, but data exchange volume becomes prohibitively large
Solution Approach 1:
The patent extracts only the essential routing information needed for accurate path selection by creating hashes of content table entries. This extraction maintains routing accuracy while dramatically reducing the quantity of data that must be exchanged between routers.
Solution Approach 2:
The patent changes the representation parameter from detailed content entries to hashed summaries, enabling accurate routing information to be conveyed with minimal data exchange volume. This parameter change resolves the contradiction between precision and quantity.
Data Source
AI summary
System and method embodiments for exchanging information between a first and second content router enable the content routers to synchronize their caches with a minimal exchange of information. In an embodiment, the method includes creating a hash of contents of a cache in the first content router using a joint hash function shared with the second content router, encoding the hash of contents of the cache in the first content router with distributed source coding, and transmitting the encoded hash to the second content router.