DTN Data Caching via Dynamic Buffer Thresholds and TTL
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Delay Tolerant Networks (DTN) with limited buffer capacity, conventional caching policies from Information Centric Networking (ICN) cannot be applied, and there is a need for efficient management of node buffer capacity and caching services considering multiple requester nodes.
Innovation Solution
A data caching method that checks buffer capacity and usage, sets Time-to-Live (TTL) values, and manages data caching and deletion based on data and node information, including caching thresholds and delivery predictability, to optimize caching in DTN environments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional ICN caching policy is applied in DTN, then data caching service can be provided, but node buffer capacity is exceeded due to unlimited caching
Solution Approach 1:
The patent implements dynamic caching policies that adapt to changing network conditions and buffer states. The caching decision is not static but changes based on real-time buffer availability, data popularity, and delivery predictions, allowing the system to provide caching services while respecting buffer constraints
Solution Approach 2:
The patent changes key parameters including buffer threshold levels, caching probabilities, and TTL values based on network conditions. By dynamically adjusting these parameters, the system can provide effective caching services while preventing buffer overflow in resource-constrained DTN nodes
2Reliability
If data is cached in all nodes to improve delivery, then data availability increases, but buffer capacity is consumed excessively
Solution Approach 1:
The patent applies different caching strategies to different nodes based on their local buffer capacities and network positions. Instead of uniform caching across all nodes, each node makes caching decisions appropriate to its local constraints and capabilities, optimizing the balance between data availability and buffer usage
Solution Approach 2:
The patent implements partial caching where not all data is cached in all nodes, but rather selective caching based on predicted delivery needs and buffer availability. This partial action approach ensures data availability for critical data while limiting buffer consumption
3Productivity
If buffer capacity is increased to cache more data, then caching efficiency improves, but node resource constraints are violated
Solution Approach 1:
The patent uses preliminary actions by predicting future data delivery needs and proactively caching data before it is requested. This allows the system to achieve high caching efficiency without needing large buffers, as data is cached in advance based on predictions rather than waiting for requests
Solution Approach 2:
The patent implements self-service caching where nodes autonomously manage their own buffer resources based on local conditions and received information. Each node independently makes caching decisions that optimize its own buffer usage while contributing to overall network efficiency
Data Source
AI summary
Provided is a method of data caching in delay tolerant network based on information centric network and a recording medium and a device for performing the same. The data caching method includes: the step of checking a remaining buffer amount and a buffer usage amount of node, the step of caching data in the node which is received from another node according to a data caching policy, in case remaining buffer amount of the node is greater than a preset remaining buffer amount threshold, the step of deleting data cached in the node from the node according to a data deletion policy, in case the buffer usage amount of the node is less than a preset buffer usage amount threshold, and the step of setting an initial Time-to-Live (TTL) value of the data received from another node or updating a TTL of the data cached in the node using information of the data received from another node or information of the node.