Blockchain Peer Maintenance Scheduling via Integer Programming
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain networks face challenges in scheduling maintenance operations with zero downtime, particularly due to the need for continuous availability of endorsing peers to maintain consensus and ensure seamless transaction endorsement, which is difficult to achieve without disrupting service.
Innovation Solution
The system employs integer programming to maximize the number of endorsing peers available within a consortium, ensuring that endorsement policies are always satisfiable by scheduling maintenance in a way that maintains network availability, using a scheduler node to manage peer maintenance and apply administrator constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If maintenance operations are performed on blockchain peers, then system maintenance and updates can be completed, but network availability and transaction endorsement continuity are disrupted
Solution Approach 1:
The system performs preliminary actions by identifying and scheduling maintenance operations in advance using integer programming optimization. The scheduler node calculates optimal maintenance windows before they occur, ensuring that peer maintenance is planned ahead while maintaining network availability through proactive scheduling rather than reactive disruptions.
Solution Approach 2:
The system implements dynamic scheduling where the maintenance timeline and peer availability are continuously adjusted based on network conditions and transaction loads. The integer programming model dynamically determines which peers can be maintained at any given time while ensuring endorsement policies remain satisfiable, allowing the system to adapt to changing operational requirements.
2Reliability
If endorsing peers are taken down for maintenance, then peer reliability can be improved, but endorsement policy satisfiability and transaction processing are compromised
Solution Approach 1:
The system applies partial action by selecting only a subset of peers for maintenance at any given time, rather than taking all peers offline. The integer programming optimization determines the minimum necessary peer maintenance while ensuring that sufficient endorsing peers remain available to satisfy endorsement policies and maintain transaction processing throughput.
Solution Approach 2:
The system changes operational parameters by dynamically adjusting peer availability states and maintenance schedules based on optimization results. The integer programming model modifies the operational parameters of individual peers (online/offline status) while maintaining the overall system parameter of endorsement policy satisfiability, allowing peer reliability to improve without compromising transaction processing.
3Reliability
If all endorsing peers remain available, then network continuity is maintained, but maintenance operations cannot be performed
Solution Approach 1:
The system segments the peer maintenance problem into discrete optimization decisions for individual peers and time periods. By dividing the maintenance scheduling into manageable units (specific peers at specific times), the integer programming model can determine optimal maintenance windows that maintain network continuity through proper segmentation of maintenance activities across multiple peers rather than requiring all peers to be unavailable simultaneously.
Solution Approach 2:
The scheduler node acts as an intermediary that coordinates between maintenance requirements and network availability. It uses integer programming optimization to mediate between the need to perform maintenance operations and the requirement to maintain network continuity, finding optimal schedules that satisfy both competing demands through centralized coordination and optimization.
Data Source
AI summary
An example operation includes one or more of solving, by a scheduler node, integer programming problem of maximizing a sum of organizations' endorsing peers that run chaincodes from a plurality of chaincodes within a consortium, making, by the scheduler node, endorsement policies (EPs) for the chaincodes from the plurality of the chaincodes to be satisfiable at any time, applying administrator's constraint of available endorsing peers to the maximized sum of organizations' endorsing peers, and adding resulting endorsing peers to a maintenance list.