Vehicle Message Queues With Dynamic Priority Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems face challenges in efficiently transmitting messages to vehicles in a vehicle formation, particularly in ensuring timely delivery and managing message priorities while accounting for dynamic changes in vehicle formations and network congestion.
Innovation Solution
A method and apparatus that utilize message queues with locally assigned priorities based on vehicle formation information, applying a priority assignment algorithm to determine message queues and control message extraction and transmission, incorporating factors like occupancy rates, historical rejections, and message production rates to optimize message delivery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If messages are transmitted using a standard Pub/Sub paradigm without priority management, then the system is simple to operate, but network congestion and latency increase, causing delayed message delivery to vehicles
Solution Approach 1:
The message queue is segmented into multiple priority levels (e.g., high priority, medium priority, low priority queues). Messages are divided and routed to different queues based on their priority classification, allowing critical safety messages to be processed separately from non-critical information, thereby improving delivery speed without overwhelming the system
Solution Approach 2:
The system changes the parameter of message handling by introducing priority levels and associated weights. Each message is assigned a priority parameter that determines its processing order and queue selection. This parameter change enables differential treatment of messages, ensuring time-critical messages receive preferential processing while maintaining systematic control
2Reliability
If all messages are treated equally in the transmission queue, then the system is easy to manage, but time-critical safety messages experience latency and may not be delivered in real time
Solution Approach 1:
Different parts of the message queueing system are given different qualities based on message priority. High-priority messages receive dedicated queues or higher weights, while low-priority messages use standard processing. This local differentiation ensures that time-critical safety messages are reliably delivered without requiring complete reconfiguration of the entire system
Solution Approach 2:
The priority assignment algorithm incorporates feedback mechanisms that monitor message queue occupancy rates, historical rejection patterns, and current network conditions. This feedback allows the system to dynamically adjust priority assignments and queue routing decisions, improving delivery reliability while adapting to changing system states without manual intervention
3Productivity
If message queues are managed without considering occupancy rates and historical data, then the system requires less computational resources, but message rejection rates increase due to full queues
Solution Approach 1:
The system performs preliminary actions by analyzing queue occupancy rates and historical rejection data before routing new messages. This advance assessment allows the priority assignment algorithm to predict potential congestion and proactively route messages through optimal queues or adjust priorities, preventing rejections before they occur and maintaining high throughput
Solution Approach 2:
The system implements feedback loops that continuously monitor queue occupancy rates, message rejection patterns, and transmission success rates. This feedback information is fed back into the priority assignment algorithm, which adjusts routing decisions and priority assignments in real-time, optimizing message transmission throughput and minimizing retransmissions based on current system state
4Speed
If the system dynamically adjusts message priorities based on vehicle formation information and network conditions, then message delivery efficiency improves, but the computational complexity and processing overhead increase
Solution Approach 1:
The system changes key parameters such as queue weights, priority levels, and routing paths based on vehicle formation information and network conditions. By dynamically adjusting these parameters rather than reconfiguring the entire message queueing architecture, the system achieves improved processing speed while keeping computational overhead manageable through focused parameter optimization
Solution Approach 2:
The computational workload is segmented into discrete, manageable tasks: priority determination, queue selection, weight assignment, and routing decision. Each segment can be executed independently and efficiently, allowing the system to achieve dynamic adaptability without requiring computationally expensive global optimization algorithms
Data Source
Figure 1
Figure 2
Figure 3
AI summary
An apparatus comprises means for: storing a plurality of message queues associated with respective priorities in a scale of priorities assigned locally by the apparatus; receiving a message to be transmitted to one or more destination vehicles in a vehicle formation; determining, from the scale of priorities, a priority for the received message by applying a priority assignment algorithm based at least on vehicle formation information related to the vehicle formation; storing the received message in the message queue corresponding to the priority determined for the received message; controlling extraction of messages from the plurality of message queues for transmission to one or more vehicles in the vehicle formation according to an extraction order based at least on the respective priorities of the plurality of message queues.