Dynamic Priority Data Message Publishing via Chain Rule-Operation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Publishing/subscription systems face challenges in prioritizing data messages effectively, as existing methods like FIFO and Dynamic Priority Scheduling often delay urgent messages and fail to consider relationships between messages, leading to inefficient data message delivery.
Innovation Solution
A priority-based data message publishing method and system that utilizes data message chains to dynamically adjust priorities based on the content and relationships of messages, where messages are added to existing or new chains and rule-operated to determine dynamic priorities for timely delivery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If FIFO (first-in-first-out) is used for data message publishing, then the system is simple to implement, but urgent data messages are delayed because they are published according to time sequence rather than priority
Solution Approach 1:
The patent implements dynamic priority scheduling where message priorities are not fixed but can be adjusted based on message importance and relationships. The system dynamically reassigns priorities to ensure urgent messages are published promptly, resolving the contradiction between simple FIFO implementation and timely delivery of urgent messages.
Solution Approach 2:
The system changes the priority parameter of data messages based on their characteristics and relationships. By modifying the priority parameter dynamically, the system can switch from simple time-sequence publishing to priority-based publishing, ensuring urgent messages are not delayed while maintaining implementation feasibility.
2Loss of time
If Dynamic Priority Scheduling is used to publish urgent messages first, then urgent messages are delivered promptly, but related non-urgent messages are ignored and cannot be published in time to support urgent messages
Solution Approach 1:
The patent introduces the concept of data message chains where related messages are nested within hierarchical structures. A parent message and its child messages form a nested relationship, allowing the system to identify and prioritize groups of related messages together, ensuring that support messages are published in time to back up urgent messages.
Solution Approach 2:
The system uses feedback mechanisms to analyze relationships between data messages and adjust priorities accordingly. By examining message content and relationships, the system provides feedback to the priority assignment process, ensuring that both urgent messages and their supporting related messages are properly prioritized and published in time.
3Device complexity
If traditional priority assignment is used without considering message relationships, then the publishing process is simple, but the system cannot properly handle increasing numbers of related data messages
Solution Approach 1:
The patent segments the priority assignment process into distinct steps: identifying message relationships, establishing data message chains, and assigning priorities based on chain positions. This segmentation makes the complex process of handling related messages manageable and scalable, allowing the system to efficiently process increasing volumes of related data messages without overwhelming complexity.
Solution Approach 2:
The system performs preliminary analysis of message relationships and establishes data message chains before priority assignment. By pre-organizing messages into hierarchical chains based on their relationships, the system simplifies the subsequent priority assignment process and improves its ability to handle increasing numbers of related messages efficiently.
Data Source
AI summary
A priority-based data message publishing method according to a data message chain can be implemented by receiving a data message, wherein the data message has an original priority. Then, judge whether there is a corresponding data message chain corresponding to the data message. When there is a corresponding data message chain, add the data message to the back of the corresponding data message chain to obtain a revised data message chain. When there is no corresponding data message chain the data message, add a new data message chain, and add the data message to the back of the new data message chain to obtain a revised data message chain. Next, rule-operate the revised data message chain to obtain a dynamic priority of the data message. Replace the original priority with the dynamic priority to obtain a revised data message. Publish the revised data message according to the dynamic priority.