SON Coordination via Dynamic Operational Stage Priority
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In self-organizing networks, conflicts arise due to the dominance of function instances with longer or bigger impacts, which can block shorter or smaller impacting instances even when they have the same priority, and existing priority methods do not account for changing importance during operation.
Innovation Solution
A method that compares operational stage information of function instances to determine priority, allowing instances with higher effective priority to run, and updates operational stage information based on configuration management and impact times to prevent triggering on unreliable data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If function instances with longer or bigger impacts are given higher priority, then system stability is improved, but shorter or smaller impacting instances are blocked even when they have the same priority
Solution Approach 1:
The patent introduces dynamic priority adjustment based on operational stage information. The priority of a function instance is not fixed but changes dynamically according to its current operational stage (e.g., input collection, processing, output). This allows the system to adapt priority levels in real-time, preventing permanent blocking of shorter instances while maintaining stability during critical operations.
Solution Approach 2:
The patent changes the parameter used for priority determination from static impact duration to dynamic operational stage information. By monitoring which operational stage a function instance is currently in, the system can adjust priority levels appropriately, allowing shorter instances to execute when they are in less critical stages while maintaining system stability during critical operations.
2Device complexity
If existing priority methods are used, then simple priority assignment is maintained, but changing importance during operation is not accounted for
Solution Approach 1:
The patent enables function instances to self-report their operational stage information to the priority determination mechanism. Each function instance monitors its own operational stage and provides this information when requesting execution, allowing the system to automatically adjust priorities based on current operational context without requiring complex external management.
Solution Approach 2:
The patent implements a feedback mechanism where operational stage information flows from function instances back to the priority determination system. This feedback loop allows the system to continuously adjust priorities based on the current state of executing instances, enabling dynamic adaptation while maintaining relatively simple priority assignment logic at the core system level.
3Speed
If function instances are triggered without considering operational stage, then rapid response is achieved, but triggering on unreliable data occurs
Solution Approach 1:
The patent requires function instances to report their operational stage information before triggering execution. This preliminary check ensures that the system has reliable information about the current state of other instances before allowing a new instance to start, preventing triggers based on unreliable or incomplete data while maintaining rapid response through efficient information exchange.
Data Source
AI summary
There is provided a method comprising receiving at least one request from a first function instance of a self-organising network, comparing said first function instance and a second function instance effective in the self-organising network to determine whether the first function instance and the second function instance overlap, and, characterised by, receiving operational stage information of the first function instance and if the first function instance and the second function instance overlap using said operational stage information in determining which of the first and second function instance to nm in dependence on which of the first function instance and the second function instance has higher priority and causing the determined instance to be run.