DTN Node Storage Segmentation for Priority-Based Data Forwarding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In DTN-based communication systems, finite storage space and limited network capacity can lead to data loss or delay, as nodes may refuse or remove data to manage resources, even with infinite storage available, due to network flooding issues.
Innovation Solution
Implementing a node configuration with a main storage unit and an auxiliary storage unit, where messages are marked with priority tags for sorting based on transmission and retention priorities, allowing for efficient management and forwarding of data, even in resource-constrained environments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traffic is stored at each DTN node until forwarding conditions are satisfied, then data delivery reliability is improved, but storage space is consumed and may lead to storage exhaustion
Solution Approach 1:
The patent segments the storage system into two distinct parts: main storage for keeping traffic until forwarding conditions are satisfied, and auxiliary storage for temporarily holding copies of high-priority traffic. This segmentation allows the system to maintain high delivery reliability while managing storage space efficiently by only duplicating necessary data.
Solution Approach 2:
The patent applies local quality by creating auxiliary storage entries selectively based on priority tags. Not all stored traffic is duplicated in auxiliary storage—only those marked with specific priority levels receive auxiliary copies. This ensures that critical data is protected against storage exhaustion while avoiding unnecessary storage consumption for low-priority traffic.
2Loss of information
If DTN nodes store all incoming traffic, then data loss is reduced, but network flooding occurs and delays increase
Solution Approach 1:
The patent implements local quality by applying different storage policies to different priority classes of traffic. High-priority traffic marked with appropriate tags receives auxiliary storage protection, while lower-priority traffic follows standard storage procedures. This differentiated approach prevents network flooding caused by universal storage while ensuring critical data is protected from loss.
3Productivity
If priority tags are used to sort main storage unit, then forwarding efficiency is improved, but sorting complexity increases
Solution Approach 1:
The patent applies preliminary action by sorting the main storage unit according to priority tags before forwarding decisions are made. Traffic is pre-organized by priority level, so when forwarding conditions are satisfied, the highest priority traffic is immediately ready for transmission without requiring complex real-time sorting decisions. This reduces forwarding latency and simplifies the decision-making process at forwarding points.
4Speed
If auxiliary data structures store logical references to main storage objects, then data access speed is improved, but memory usage increases
Solution Approach 1:
The patent implements copying by creating auxiliary data structures that contain logical references (pointers) to objects in the main storage unit rather than duplicating the actual traffic data. This allows fast access to high-priority traffic through the auxiliary structures while avoiding the memory overhead of complete data duplication. The logical references provide quick lookup capability with minimal memory consumption.
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
There is provided a method of managing a node in a DTN-based communication system, the node being configured to store incoming messages in a main storage unit (15) in the form of objects and forward messages from the main storage unit (15) to other nodes of the network depending on forwarding conditions, one or more portions of the message being marked with a set of priority tags of given types, each tag being assigned a value, the method comprising managing the storage of messages in the main storage unit (15), by sorting the main storage unit (15) according to a main ordering rule being related to at least one priority tag, the node further comprising an auxiliary storage unit (52) comprising at least one auxiliary data structure (520), each data structure storing a logical reference to each object of the main storage unit (15), the method further comprising sorting each auxiliary data structure according to at least one auxiliary ordering rule related to at least one priority tag.