Probabilistic Priority Band Resource Contention Resolution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing conflict resolution procedures for resource access, such as fixed priority, random selection, and lottery systems, face challenges like constant adjustments for load balancing, complexity in understanding resource priorities, and inability for one resource to have priority over another, leading to inefficiencies in managing resource access among multiple nodes.
Innovation Solution
Implementing a priority band-based conflict resolution method where nodes are assigned probabilistically distributed priority values, allowing lower priority nodes to access resources and using tie-breaker procedures to resolve ties, enabling dynamic load balancing without real-time calculations and static priority adjustments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If fixed priority procedure is used to allocate resource access, then resource access is determined by priority level, but constant adjustments are needed to provide fair load balancing which increases workload for resource manager
Solution Approach 1:
The patent applies dynamics by making priority values time-varying and probabilistically distributed rather than fixed. Each node receives priority values from a probability distribution function that changes over time, allowing the system to adapt to changing load conditions without requiring constant manual adjustments by the resource manager. This dynamic approach automatically achieves fair load balancing while simplifying resource manager operations.
Solution Approach 2:
The patent changes the parameter of priority values from static to probabilistically distributed values drawn from time-varying probability distribution functions. By sampling priority values from these distributions at each time step, the system transforms the fixed priority parameter into a dynamic one that naturally provides load balancing without increasing resource manager workload.
2Adaptability or versatility
If lottery procedure is used to allocate resource access, then nodes are chosen based on lottery tickets, but it is difficult to understand which resource has priority and resources cannot have priority over each other
Solution Approach 1:
The patent introduces probability distribution functions as an intermediary between the lottery mechanism and priority determination. These functions encode priority information in a structured way that maintains fairness through probabilistic sampling while preserving interpretability. The distribution parameters (mean, standard deviation) serve as interpretable priority indicators, allowing resources to have priority over each other through their distribution characteristics rather than through opaque ticket allocations.
3Productivity
If probabilistically distributed priority values are assigned to nodes, then lower priority nodes can access resources and load balancing is achieved, but tie-breaker procedures are needed to resolve conflicts when priority values are equal
Solution Approach 1:
The patent applies partial action by implementing tie-breaker procedures only when necessary (when priority values are equal) rather than for every resource allocation decision. The primary probabilistic priority mechanism handles most cases, and the tie-breaker serves as a supplementary mechanism activated only when the main mechanism produces a tie, thus minimizing additional complexity while ensuring complete conflict resolution.
Data Source
AI summary
Generally discussed herein are systems, devices, and methods for conflict resolution. A method can include identifying, by processing circuitry, whether a conflict exists between two or more nodes requesting access to a resource, in response to identifying a conflict exists, identifying a priority value for each of the nodes in conflict, the priority value for each of the nodes consistent with a probability distribution of possible priority values for each respective node, comparing the identified priority values to determine which priority value of the identified priority values corresponds to a highest priority value, and allocating access to the resource to the node corresponding to the determined highest priority value.