Traffic Block Scheduling for Overload Prevention in Computing Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing nodes face challenges in efficiently allocating computing resources for multiple services, leading to conflicts and potential damage due to overload, which affects online service quality.
Innovation Solution
A traffic scheduling method that divides traffic into blocks, determines computing requirements, and schedules each block to a target node based on region and resource needs, ensuring efficient allocation and avoiding overload by utilizing a unified scheduling device for both traffic and other services.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If a computing node processes both traffic service and computing service, then resource utilization is improved, but computing resource overload may occur causing service damage
Solution Approach 1:
The patent segments traffic into multiple traffic blocks based on region and resource requirements. This segmentation allows the scheduling device to allocate computing resources more precisely to different traffic blocks, preventing overload while maximizing resource utilization across multiple services.
Solution Approach 2:
The patent implements a feedback mechanism where the scheduling device monitors resource usage status of computing nodes and adjusts scheduling decisions accordingly. When resource usage exceeds thresholds, the system automatically reschedules traffic blocks to prevent overload and maintain service quality.
2Productivity
If traffic is divided into multiple blocks and scheduled separately, then resource allocation rationality is improved, but scheduling complexity increases
Solution Approach 1:
The scheduling device is designed with universal scheduling capability that can handle both traffic service and computing service scheduling through a unified mechanism. This multi-functionality allows the system to allocate resources rationally across different services without requiring separate scheduling systems, thereby managing complexity while improving efficiency.
3Loss of energy
If computing resources are allocated to multiple services on the same node, then resource utilization is improved, but conflict between services increases
Solution Approach 1:
The patent applies local quality by scheduling traffic blocks to specific computing nodes based on their region requirements and resource needs. Each traffic block is allocated to a target node where it can be processed without interfering with other services in different regions, thereby reducing service conflicts while maintaining high resource utilization through localized allocation strategies.
Data Source
AI summary
A scheduling device obtains to-be-scheduled traffic, and divides the traffic into a plurality of traffic blocks; then determines a computing requirement of each traffic block; and schedules, based on the computing requirement of each traffic block, each traffic block to a target node corresponding to each traffic block. A computing resource of the target node is used to process a service of the traffic block corresponding to the target node, the computing resource of the target node is further used to process another service different from the traffic block, and the other service is also scheduled by the scheduling device to the target node. One scheduling device schedules traffic or another service to a target node, and one scheduling device allocates a computing resource of the target node to a traffic service and the other service.