Priority-Based Data Access Control for Shared Resources
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data transport technologies face challenges in efficiently managing the transmission of data to shared resources, leading to variability in latency and performance, as not all data can be transmitted simultaneously, requiring decisions on which data to prioritize.
Innovation Solution
A method and system for controlling access to shared resources by prioritizing data items based on predetermined priorities, ensuring that data with the highest priority is transmitted first, and lower-priority data only after all non-awaiting lower-priority data has been transmitted, using queues and transmission processes to maintain latency and bandwidth guarantees.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If data items are transmitted simultaneously to shared resource, then transmission speed is improved, but resource contention and access control complexity increases
Solution Approach 1:
The patent segments data items into distinct units with assigned priorities, allowing the shared resource to process them in a controlled sequence rather than attempting simultaneous transmission. Each data item is treated as an independent entity that can be granted access based on its priority level, resolving the conflict between speed and control complexity.
Solution Approach 2:
The patent introduces priority as a new parameter to control data item access to the shared resource. By assigning different priority levels to different data items, the system can dynamically adjust transmission order without requiring complex simultaneous access control mechanisms, thus improving speed while maintaining manageable complexity.
2Loss of time
If priority-based scheduling is implemented, then latency guarantees are improved, but system complexity increases
Solution Approach 1:
The patent applies preliminary action by assigning priority levels to data items before they enter the transmission queue. This pre-classification allows the system to make deterministic scheduling decisions without complex real-time analysis, ensuring latency guarantees while keeping the scheduling mechanism relatively simple.
Solution Approach 2:
The patent implements feedback through the priority assignment mechanism, where the system monitors data item characteristics and assigns appropriate priority levels. This feedback loop enables the system to adapt to different data requirements and provide latency guarantees without requiring overly complex real-time control mechanisms.
3Adaptability or versatility
If all data items are transmitted with equal priority, then fairness is improved, but performance optimization for critical data deteriorates
Solution Approach 1:
The patent applies local quality by allowing different priority levels for different data items based on their specific requirements. Critical data items can be assigned higher priorities for optimized performance, while less time-sensitive data receives standard priority treatment, thus maintaining fairness overall while enabling performance optimization where needed.
Data Source
AI summary
A method and a system of controlling access of data items to a shared resource, wherein the data items each is assigned to one of a plurality of priorities, and wherein, when a predetermined number of data items of a priority have been transmitted to the shared resource, that priority will be awaiting, i.e. no further data items are transmitted with that priority, until all lower, non-awaiting priorities have had one or more data items transmitted to the shared resource. In this manner, guarantees services may be obtained for all priorities.