Distributed Network Voting Stop Point Mechanism
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In traditional distributed computer networks, determining which machines participate in the initial voting process and achieving agreement on resource ownership can be challenging, especially when machines start up at the same time, leading to potential delays and inefficiencies.
Innovation Solution
A method is introduced where each machine sends an initial 'Announcement' packet and repeats it for a predetermined time (Discovery Phase), followed by a 'Vote Request' packet, which includes the number of discovered machines, and a 'cut-off' is applied to prevent further ballot submissions, ensuring only machines that have sent a Vote Request can participate in the voting process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If a complex voting method is used when machines are started, then resource allocation accuracy is improved, but the time to determine participating machines and reach agreement increases
Solution Approach 1:
The patent applies preliminary action by implementing a discovery phase before the formal voting process. During this phase, machines announce their presence and the system pre-determines which machines will participate in voting based on their startup timing. This preliminary identification of voting participants eliminates delays during the actual voting process, as the system already knows which machines to expect ballots from, thus resolving the contradiction between accurate resource allocation and voting time.
2Adaptability or versatility
If multiple machines are started in the same time frame, then network scalability is improved, but the difficulty of determining initial voting participants increases
Solution Approach 1:
The patent applies local quality by introducing temporal differentiation to the voting process. Machines that start up during the discovery phase are assigned the quality of 'voting participants,' while those starting afterward are excluded. This local distinction based on startup timing allows the system to handle multiple machines started simultaneously by creating a clear boundary between participating and non-participating machines, thus resolving the difficulty of identifying initial voting participants while maintaining network scalability.
3Manufacturing precision
If the voting process is extended to include all possible machines, then resource allocation completeness is improved, but system productivity decreases
Solution Approach 1:
The patent applies partial action by implementing a cut-off mechanism that limits voting participation to only those machines that started up during the discovery phase. This partial inclusion strategy ensures that resource allocation is complete for all relevant machines (those that should participate) while excluding machines that started too late, thus maintaining both allocation completeness and system productivity by avoiding unnecessary extensions of the voting process.
Data Source
AI summary
A highly efficient and effective method for deciding, in the context of a distributed computer network, how many computers will participate in an initial vote if multiple computers are started in the same general time frame.