Master Node Selection via Physical Attribute Scoring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for establishing and updating a master node in a computer network are inadequate, as they either rely on temporary node assignments, require global administrators, or depend on comparison of identification fields, which do not effectively address node malfunctions, security breaches, or optimal node selection based on physical attributes.
Innovation Solution
A method that scores each node based on physical attributes, designates the highest-scoring node as the master, and periodically updates the status through message exchanges, allowing non-master nodes to request status changes if they have higher scores, and declaring mastery if no message is received within a user-defined time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a permanent master node is assigned priority zero and slave nodes are assigned values one to four, then the master node can coordinate network activities, but the system lacks adaptability when the master node malfunctions or when a more suitable node becomes available
Solution Approach 1:
The patent implements dynamic master node selection by allowing slave nodes to periodically evaluate their own scores and the scores of other nodes. The master node status is not fixed but can be transferred when a slave node determines it has a higher score than the current master, making the system adaptive to changing conditions while maintaining reliable coordination.
Solution Approach 2:
The patent uses score values as dynamic parameters to determine master node status. Each node has an associated score based on its attributes, and the master node is the one with the highest score. This parameter-based approach allows automatic adaptation when node conditions change, resolving the contradiction between maintaining stable coordination and enabling flexible replacement.
2Reliability
If slave nodes are allowed to act as temporary master nodes and send command messages, then the network can maintain operation during master node failure, but the system complexity increases and security risks arise from unauthorized nodes issuing commands
Solution Approach 1:
The patent uses score comparison as a simple parameter-based mechanism to determine which node should be master. Instead of complex role management or temporary master node designations, each node simply compares its score with the current master's score. If a slave node has a higher score, it becomes the new master. This approach maintains operational continuity while avoiding increased system complexity.
3Reliability
If the master node periodically sends messages declaring its status and requesting score updates from non-master nodes, then the system can detect and respond to master node malfunctions, but the network traffic and processing overhead increase
Solution Approach 1:
The patent implements periodic status verification where the master node sends messages at intervals to declare its status and request score updates from slave nodes. This periodic action allows the system to detect master node malfunctions and enable slave nodes to evaluate whether they should become master, while keeping communication overhead manageable through reasonable timing intervals.
4Adaptability or versatility
If non-master nodes can request master node status by comparing scores, then the system achieves optimal node selection based on physical attributes, but the security risk increases from potential unauthorized status changes
Solution Approach 1:
The patent implements a feedback mechanism where non-master nodes periodically receive the master node's score and compare it with their own scores. This feedback loop allows nodes to evaluate whether they should request master status based on objective score comparisons rather than arbitrary decisions. The systematic feedback process reduces security risks by preventing unauthorized status changes while enabling optimal node selection based on physical attributes.
Data Source
AI summary
A method of establishing and updating a master node in a computer network by scoring each node in the network as a function of its physical attributes, designating the highest scoring node as the master node, sending a periodic message by the master node with its score and a request for non-master node scores, sending a message by a non-master node to the master node requesting relinquishment of master node status if the non-master node has a higher score, relinquishing master node status to a non-master node with a higher score and returning to the third step, and declaring by a non-master node that it is a master node if it has not received a message from the previously designated master node in a user-definable period of time and returning to the third step.