Distributed monitoring bandwidth adjusting method and system capable of realizing adaptive scheduling

Abstract

The invention belongs to the technical field of bandwidth adjustment, and particularly relates to a distributed monitoring bandwidth adjustment method and system capable of self-adaptive scheduling, which can ensure that high-priority nodes can preferentially obtain bandwidth resources by collecting network state data in real time and dynamically adjusting the bandwidth demand priority of each node. And the central scheduling node gathers priority information of all nodes, generates a global bandwidth allocation scheme, and continuously adapts to changes of network loads and monitoring requirements through a closed-loop adjustment process. According to the method, the utilization rate of bandwidth resources is remarkably improved, the stability and reliability of the system are enhanced, the phenomena of data transmission delay and packet loss are reduced, and meanwhile, the key nodes can still obtain sufficient bandwidth support under the condition of high load or emergency, so that the flexibility and the response speed of the whole distributed monitoring system are improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of bandwidth regulation, and in particular relates to a distributed monitoring bandwidth regulation method and system capable of adaptive scheduling. Background Art

[0002] In existing distributed monitoring systems, bandwidth resources are usually managed in a static or semi-static manner. These methods usually allocate bandwidth based on pre-set rules or fixed priorities, and fail to fully consider the dynamic changes in network status and node load. Specifically, the general solutions of the existing technology include the following: Static bandwidth allocation: In this solution, each monitoring node is allocated a fixed bandwidth resource. This method is simple and easy to implement, but when the network load fluctuates greatly, the bandwidth allocation cannot be flexibly adjusted, resulting in some nodes experiencing increased data transmission delays or packet loss due to insufficient bandwidth.

[0003] Priority-based allocation: This method allocates bandwidth resources based on the preset priorities of nodes. Although it can optimize resource utilization to a certain extent, since the priorities are usually fixed and cannot dynamically respond to changes in network status, there is still the problem of uneven resource allocation in practical applications.

[0004] Forecast-based allocation: Some advanced systems try to predict future network loads through historical data and adjust bandwidth allocation accordingly. However, due to the complexity and unpredictability of the network environment, this method often fails to accurately predict all situations, resulting in inaccurate bandwidth allocation.

[0005] A common problem of the above existing technologies is that they cannot effectively cope with the dynamic changes of network load and node demand, resulting in unreasonable allocation of bandwidth resources, which in turn affects the overall performance and stability of the system. Especially in high-load or sudden situations, fixed or semi-static bandwidth allocation strategies may result in insufficient bandwidth support for key nodes, thus affecting the timeliness and accuracy of monitoring data. Summary of the invention

[0006] The purpose of the present invention is to provide a distributed monitoring bandwidth adjustment method and system capable of adaptive scheduling, which significantly improves the performance and stability of the distributed monitoring system to solve the problems raised in the above-mentioned background technology.

[0007] To achieve the above object, the present invention proposes a distributed monitoring bandwidth adjustment method capable of adaptive scheduling, comprising the following steps: S1: Monitoring node collects network status data in real time; S2: Calculate the bandwidth demand priority of each monitoring node based on the collected network status data. The priority is dynamically adjusted based on data transmission delay and node load. S3: Send the calculated bandwidth demand priority to the central scheduling node, which aggregates the priority information of all monitoring nodes; S4: The central scheduling node generates a global bandwidth allocation plan based on the aggregated priority information. The allocation plan ensures that the bandwidth requirements of high-priority nodes are met first. S5: Send the global bandwidth allocation plan to each monitoring node, and the monitoring node adjusts the local data transmission rate according to the allocation plan; S6: After adjusting the data transmission rate, the monitoring node re-collects network status data to detect the actual effect of the bandwidth allocation scheme; S7: If it is detected that the bandwidth allocation scheme fails to meet the dynamically changing network load requirements, the central scheduling node recalculates and updates the global bandwidth allocation scheme; S8: Repeat steps S6 and S7 to form a closed-loop adjustment process, ensuring that bandwidth allocation always adapts to changes in network load and monitoring requirements.

[0008] Preferably, the monitoring node collects network status data in real time, including: Each monitoring node collects network status data at fixed time intervals, including current bandwidth usage, data transmission delay, and node load; calculates the standard value of each parameter, and compares the actual measured value with the standard value to obtain the deviation value; According to the obtained deviation value, the priority adjustment factor is calculated, and the current priority of the monitoring node is updated using this factor. If the adjustment factor is greater than zero, the priority of the node is increased, otherwise it is decreased; The updated priorities are sent to the central scheduling node, which receives the priority information set of all monitoring nodes and generates a global resource demand index based on this information; The central scheduling node generates a new bandwidth allocation scheme based on the generated global resource demand index and the predefined weight allocation principle.

[0009] Preferably, the step of calculating the bandwidth requirement priority of each monitoring node based on the collected network status data, wherein the priority is dynamically adjusted based on data transmission delay and node load, includes: For each monitoring node, a basic priority value is first calculated based on the collected network status data. The deviation value is calculated by combining the standard delay and load level defined by the system with the actual measured value, and the priority is adjusted accordingly. The priority value is adjusted by using the obtained basic priority value and combining it with the bandwidth usage rate; Convert the adjusted priorities into relative priorities to adapt to the global evaluation criteria of the central scheduling node. Through standardization, ensure that the priorities of each node can be compared with each other. According to the calculated relative priority, the final bandwidth requirement priority of the monitoring node is updated.

[0010] Preferably, the calculated bandwidth demand priority is sent to a central scheduling node, and the central scheduling node aggregates the priority information of all monitoring nodes, including: Each monitoring node sends the value of the bandwidth demand priority calculated by it to the central scheduling node through the network. The data packet sent contains the node's identity identifier and priority value; The central scheduling node receives the data packets sent by all monitoring nodes and stores them in a list, sorting the list in descending order according to the priority value; Based on the sorted list, the central scheduling node calculates the average priority of all nodes, and then calculates the deviation of each node from the average priority; Using the calculated average priority and deviation, the central scheduling node generates a global priority adjustment factor.

[0011] Preferably, the central scheduling node generates a global bandwidth allocation scheme based on the aggregated priority information, and the allocation scheme ensures that bandwidth requirements of high-priority nodes are met first, including: The central scheduling node calculates the bandwidth allocation ratio for each node based on the total priority of all nodes; Based on the calculated bandwidth allocation ratio and the maximum total bandwidth that can be allocated by the system, the specific bandwidth that should be allocated to each node is calculated; In order to cope with emergencies and ensure network stability, the central scheduling node also needs to calculate a reserved bandwidth, and the remaining bandwidth available for allocation is used to recalculate the actual allocated bandwidth of each node.

[0012] Preferably, the sending of the global bandwidth allocation scheme to each monitoring node, and the monitoring node adjusting the local data transmission rate according to the allocation scheme, includes: The central scheduling node packages the global bandwidth allocation plan into data packets and sends them to each monitoring node through the network. Each data packet contains the node's identifier and the amount of bandwidth to be allocated. After receiving the data packet, the monitoring node parses the bandwidth allocated to it and calculates an adjustment coefficient based on the current network status and historical transmission rate records; Using the obtained adjustment coefficient, the monitoring node updates its local data transmission rate; The monitoring node collects the current network status data again and compares it with the preset standard value. If any deviation value is found to be beyond the allowable range, the transmission rate is readjusted.

[0013] Preferably, after adjusting the data transmission rate, the monitoring node re-collects network status data to detect the actual effect of the bandwidth allocation scheme, including: When the monitoring node detects that the comprehensive performance index exceeds the preset threshold, it indicates that the current bandwidth allocation scheme fails to meet the dynamically changing network load requirements; at this time, the monitoring node sends the abnormal status information to the central scheduling node; After receiving the abnormal status information of all monitoring nodes, the central scheduling node aggregates this information to form a global abnormal status list; for each node, its abnormality degree is calculated to reflect the performance of the node when the network status deteriorates; Based on the calculated abnormality level, the central scheduling node updates the priority adjustment factor of each node; Using the updated priority adjustment factor, the central scheduling node recalculates the total priority of all nodes and generates a new bandwidth allocation ratio; combined with the maximum total bandwidth that can be allocated by the system, the new bandwidth that should be allocated to each node is calculated; finally, the central scheduling node sends the updated bandwidth allocation plan to each monitoring node.

[0014] Preferably, if it is detected that the bandwidth allocation scheme fails to meet the dynamically changing network load demand, the central scheduling node recalculates and updates the global bandwidth allocation scheme, including: When the monitoring node detects that the comprehensive performance index still exceeds the preset threshold, the monitoring node sends the latest abnormal status information to the central scheduling node again. After receiving this information, the central scheduling node summarizes the global abnormal status list; The central scheduling node calculates the abnormality level of each node and updates the priority adjustment factor of each node; Using the updated priority adjustment factor, the central scheduling node recalculates the total priority of all nodes and generates a new bandwidth allocation ratio. Combined with the maximum total bandwidth that can be allocated by the system, the new bandwidth amount that should be allocated to each node is calculated; Finally, the central scheduling node sends the updated bandwidth allocation plan to each monitoring node again.

[0015] Preferably, the steps S6 and S7 are repeated to form a closed-loop regulation process, including: After the central scheduling node completes the update of the bandwidth allocation plan and sends it to each monitoring node, it starts a new cycle. Each monitoring node adjusts its data transmission rate according to the received new allocation plan and re-collects network status data after the adjusted fixed time interval; Calculate the new standard deviation rate based on the re-collected data; Using the calculated standard deviation rate, a composite performance index is calculated; If the calculated comprehensive performance index still exceeds the preset threshold, the monitoring node will send the latest abnormal status information to the central scheduling node again; The central scheduling node repeats the process: summarizes the global abnormal status list, calculates the degree of abnormality, updates the priority adjustment factor, recalculates the total priority, and generates a new bandwidth allocation ratio; finally, according to the updated bandwidth allocation plan, it is sent to each monitoring node again.

[0016] On the other hand, the present invention provides a distributed monitoring bandwidth adjustment system capable of adaptive scheduling, comprising: Data collection module, used to collect network status data in real time at the monitoring node; The priority calculation module is used to calculate the bandwidth demand priority of each monitoring node based on the collected network status data. The priority is dynamically adjusted based on data transmission delay and node load; The priority aggregation module is used to send the calculated bandwidth demand priority to the central scheduling node, and the central scheduling node aggregates the priority information of all monitoring nodes; The global allocation plan generation module is used by the central scheduling node to generate a global bandwidth allocation plan based on the aggregated priority information. The allocation plan ensures that the bandwidth requirements of high-priority nodes are met first. The allocation plan delivery and adjustment module is used to deliver the global bandwidth allocation plan to each monitoring node, and the monitoring node adjusts the local data transmission rate according to the allocation plan; The effect evaluation module is used to monitor the node and re-collect network status data after adjusting the data transmission rate to detect the actual effect of the bandwidth allocation plan; A dynamic adjustment module, used for the central scheduling node to recalculate and update the global bandwidth allocation plan if it is detected that the bandwidth allocation plan fails to meet the dynamically changing network load requirements; The closed-loop regulation module is used to repeatedly execute the effect evaluation module and the dynamic adjustment module to form a closed-loop regulation process, thereby ensuring that bandwidth allocation always adapts to changes in network load and monitoring requirements.

[0017] Technical effects and advantages of the present invention: Compared with the prior art, the present invention provides a distributed monitoring bandwidth adjustment method and system capable of adaptive scheduling, which has the following advantages: The present invention collects network status data in real time and dynamically adjusts the bandwidth demand priority of each node to ensure that high-priority nodes can obtain bandwidth resources first. The central scheduling node summarizes the priority information of all nodes, generates a global bandwidth allocation plan, and continuously adapts to changes in network load and monitoring requirements through a closed-loop adjustment process. This method significantly improves the utilization rate of bandwidth resources, enhances the stability and reliability of the system, reduces data transmission delays and packet loss, and ensures that key nodes can still obtain sufficient bandwidth support under high load or emergency conditions, thereby improving the flexibility and response speed of the entire distributed monitoring system. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 It is a flow chart of the distributed monitoring bandwidth adjustment method capable of adaptive scheduling according to the present invention; Figure 2 The block diagram of the adaptively schedulable distributed monitoring bandwidth adjustment system of the present invention. DETAILED DESCRIPTION

[0019] The following will be combined with the accompanying drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. The specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0020] The present invention provides Figure 1 The distributed monitoring bandwidth adjustment method with adaptive scheduling shown in the figure includes the following steps: S1: The monitoring node collects network status data in real time; specifically includes: The monitoring node collects network status data every T seconds, recorded as D_(t)={Xb_(t),Ld_(t),Nl_(t)}, where Xb_(t) represents the bandwidth utilization rate at time t (unit: %), Ld_(t) represents the data transmission delay at time t (unit: ms), and Nl_(t) represents the node load at time t (unit: %); Calculate the standard value Std_Xb, Std_Ld, Std_Nl of each parameter, and compare the actual measured value with the standard value to obtain the deviation value: Db_(t)=Xb_(t)-Std_Xb,Dl_(t)=Ld_(t)-Std_Ld,Dn_(t)=Nl_(t)-Std_Nl; By regularly collecting network status data, the system can understand the current bandwidth usage, data transmission delay and node load in real time, which provides basic data support for subsequent priority adjustment and bandwidth allocation.

[0021] According to the obtained deviation values ​​Db_(t), Dl_(t), and Dn_(t), the priority adjustment factor Af_(t)=w1*Db_(t)+w2*Dl_(t)+w3*Dn_(t) is calculated, where w1, w2, and w3 are the weight coefficients of the corresponding deviation values, respectively, satisfying w1+w2+w3=1; Af_(t) is used to update the current priority Pr_(t) of the monitoring node. If Af_(t)>0, the priority of the node is increased, otherwise it is reduced, that is, Pr_(t)=Pr_(t-1)+Af_(t); based on the collected network status data, the priority of each node is dynamically adjusted to ensure that when the bandwidth is tight, high-priority nodes can obtain more resources.

[0022] The updated priority Pr_(t) is sent to the central scheduling node; the central scheduling node receives the priority information set {Pr_1(t), Pr_2(t), ..., Pr_n(t)} from all monitoring nodes, and calculates the global resource demand index Rg_(t) according to the formula Rg_(t)=sum(Pr_1(t)*W1, Pr_2(t)*W2, ..., Pr_n(t)*Wn) / n, where W1, W2, ..., Wn are pre-set weights representing the importance levels of different nodes; the central scheduling node summarizes the priority information of all monitoring nodes to provide data support for generating a global bandwidth allocation plan.

[0023] Based on the calculated global resource demand index Rg_(t) and the previously defined weight allocation principle, the central scheduling node generates a new bandwidth allocation scheme Bdist_(t)={b_1(t),b_2(t),...,b_n(t)}, where b_i(t) represents the amount of bandwidth that should be allocated to the i-th node at time t; ensure that high-priority nodes obtain more bandwidth in proportion to their Pr_(t) values, that is, b_i(t)=Bmax*(Pr_(t) / sum(Pr_1(t),Pr_2(t),...,Pr_n(t))), where Bmax is the maximum total allocatable bandwidth; generate a new bandwidth allocation scheme based on the global resource demand index to ensure that high-priority nodes can obtain bandwidth resources first.

[0024] Example 1 Assume there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. Every T seconds (for example, T = 5 seconds), each node collects network status data: Node A:Xb_A(t)=80, Ld_A(t)=20, Nl_A(t); Standard values: Std_Xb=70, Std_Ld=15, Std_Nl=60; Deviation value: Db_A(t)=80-70=10, Dl_A(t)=20-15=5, Dn_A(t)=Nl_A(t)-60; Node B: Xb_B(t)=60, Ld_B(t)=10, Nl_B(t); Standard values: Std_Xb=70, Std_Ld=15, Std_Nl=60; Deviation value: Db_B(t)=60-70=-10, Dl_B(t)=10-15=-5, Dn_B(t)=Nl_B(t)-60; Node C: Xb_C(t)=90, Ld_C(t)=25, Nl_C(t); Standard values: Std_Xb=70, Std_Ld=15, Std_Nl=60; Deviation value: Db_C(t)=90-70=20, Dl_C(t)=25-15=10, Dn_C(t)=Nl_C(t)-60; Calculate the priority adjustment factor (assuming weight coefficients w1=0.4, w2=0.3, w3=0.3): Node A:Af_A(t)=0.4*10+0.3*5+0.3*(Nl_A(t)-60); Node B: Af_B(t)=0.4*(-10)+0.3*(-5)+0.3*(Nl_B(t)-60); Node C:Af_C(t)=0.4*20+0.3*10+0.3*(Nl_C(t)-60); Update priority (assuming the initial priority Pr_(t-1)=50): Node A: Pr_A(t)=50+Af_A(t); Node B: Pr_B(t)=50+Af_B(t); Node C: Pr_C(t)=50+Af_C(t); The central scheduling node aggregates the priority information and calculates the global resource demand index: Rg_(t)=(Pr_A(t)*W1+Pr_B(t)*W2+Pr_C(t)*W3) / 3; Generate a new bandwidth allocation plan (assuming the maximum total bandwidth Bmax = 100Mbps): Node A: bi_A(t)=100Mbps*(Pr_A(t) / (Pr_A(t)+Pr_B(t)+Pr_C(t))); Node B: bi_B(t)=100Mbps*(Pr_B(t) / (Pr_A(t)+Pr_B(t)+Pr_C(t))); Node C: bi_C(t)=100Mbps*(Pr_C(t) / (Pr_A(t)+Pr_B(t)+Pr_C(t))); Through the above steps, the system can dynamically adjust the priority of each node and reasonably allocate bandwidth to ensure that high-priority nodes have sufficient bandwidth support when resources are tight, thereby improving the overall performance and stability of the system.

[0025] S2: Calculate the bandwidth demand priority of each monitoring node based on the collected network status data. The priority is dynamically adjusted based on data transmission delay and node load. Specifically, it includes: For each monitoring node, based on the collected network status data D_(t)={Xb_(t), Ld_(t), Nl_(t)}, first calculate a basic priority value Fp_(t); use the formula Fp_(t)=α*(Std_Ld-Ld_(t))+β*(Std_Nl-Nl_(t)), where α and β are preset weight coefficients, satisfying α+β=1, Std_Ld and Std_Nl are the standard delay and load levels defined by the system, Ld_(t) and Nl_(t) are the data transmission delay and node load at time t respectively; calculate the basic priority value of each monitoring node through the collected network status data. This step can quantify the current status of the node in the network and provide a basis for subsequent priority adjustments.

[0026] The priority value Ap_(t) is adjusted by using the obtained basic priority value Fp_(t) and combining it with the bandwidth utilization rate Xb_(t); the formula Ap_(t)=Fp_(t)+γ*(Bmax-Xb_(t)) is adopted, where γ is an adjustment coefficient, Bmax is the maximum bandwidth utilization rate allowed by the system, and Xb_(t) is the actual bandwidth utilization rate at time t; this step ensures that when the bandwidth is tight, nodes with low bandwidth utilization get higher priority; Convert the adjusted priority value Ap_(t) into a relative priority Rp_(t) to adapt to the global evaluation criteria of the central scheduling node; The conversion formula is: Rp_(t)=Ap_(t) / max(Ap_1(t),Ap_2(t),...,Ap_n(t)); Where max(Ap_1(t),Ap_2(t),...,Ap_n(t)) represents the maximum Ap_(t) value among all nodes; through this conversion, it is ensured that the priorities between nodes can be compared with each other, and the value range is between 0 and 1; According to the calculated relative priority Rp_(t), update the final bandwidth demand priority Ep_(t) of the monitoring node; The formula Ep_(t)=δ*Rp_(t)+ε*H_(t) is applied, where δ and ε are weight factors, satisfying δ+ε=1, and H_(t) is the historical priority influencing factor, which represents the average priority of the node in the past period of time and is used to smooth the impact of short-term fluctuations on priority. In this way, both the current network status and the historical performance are taken into account, making the priority adjustment more stable and fair.

[0027] Example 2 Assume there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. Every T seconds (for example, T = 5 seconds), each node collects network status data: Node A: Xb_A(t)=80, Ld_A(t)=20, Nl_A(t)=70; Standard values: Std_Ld=15, Std_Nl=60; Node B: Xb_B(t)=60, Ld_B(t)=10, Nl_B(t)=50; Standard values: Std_Ld=15, Std_Nl=60; Node C: Xb_C(t)=90, Ld_C(t)=25, Nl_C(t)=80; Standard values: Std_Ld=15, Std_Nl=60; First, calculate the basic priority value of each node (assuming weight coefficient α=0.6, β=0.4): Node A: Fp_A(t)=0.6*(15-20)+0.4*(60-70)=-3-4=-7; Node B: Fp_B(t)=0.6*(15-10)+0.4*(60-50)=3+4=7; Node C: Fp_C(t)=0.6*(15-25)+0.4*(60-80)=-6-8=-14; Then, adjust the priority value based on the bandwidth usage (assuming the adjustment coefficient γ = 0.5 and the maximum bandwidth usage Bmax = 100): Node A: Ap_A(t)=-7+0.5*(100-80)=-7+10=3; Node B: Ap_B(t)=7+0.5*(100-60)=7+20=27; Node C: Ap_C(t)=-14+0.5*(100-90)=-14+5=-9; Next, convert to relative priority: Node A: Rp_A(t)=3 / max(3,27,-9)=3 / 27≈0.11; Node B: Rp_B(t)=27 / max(3,27,-9)=27 / 27=1.00; Node C: Rp_C(t)=-9 / max(3,27,-9)=-9 / 27≈-0.33 (Note: Usually a positive value is taken, but here we assume that only the positive value is taken. The -0.33 obtained in this formula is a negative value, so it is taken as 0); Finally, update the final bandwidth demand priority (assuming weight factor δ=0.8, ε=0.2, and historical priority impact factor H_(t)=50): Node A: Ep_A(t)=0.8*0.11+0.2*50=0.088+10=10.088; Node B: Ep_B(t)=0.8*1.00+0.2*50=0.8+10=10.8; Node C: Ep_C(t)=0.8*0+0.2*50=0+10=10; Through the above steps, the system can dynamically adjust the priority of each node and reasonably allocate bandwidth, ensuring that high-priority nodes get sufficient bandwidth support when resources are tight, improving the overall performance and stability of the system. Each step ensures the scientificity and rationality of priority adjustment, thereby achieving the optimal configuration of resources.

[0028] S3: Send the calculated bandwidth demand priority to the central scheduling node, which aggregates the priority information of all monitoring nodes; specifically, it includes: Each monitoring node sends the value of the bandwidth demand priority Ep_(t) calculated by it to the central scheduling node through the network; suppose the sent data packet is Pkg_(t)={NodeID,Ep_(t)}, where NodeID is the node identifier and Ep_(t) is the final bandwidth demand priority obtained from the previous step; each monitoring node sends its calculated bandwidth demand priority to the central scheduling node to ensure that the central scheduling node can summarize the priority information of all nodes and provide data support for subsequent global resource allocation.

[0029] The central scheduling node receives the data packets Pkg_(t) sent by all monitoring nodes and stores them in a list Lst=[Pkg_1(t),Pkg_2(t),...,Pkg_n(t)], where each element Pkg_n(t) contains a node identifier and a corresponding priority value; for the convenience of subsequent processing, the list Lst is sorted in descending order according to the priority value Ep_(t) to obtain a new list Lsts=sort(Lst,key=Ep_(t)); the central scheduling node receives the data packets sent by all monitoring nodes, and summarizes and sorts these data for the convenience of subsequent processing and analysis.

[0030] According to the obtained ordered list Lsts, the central scheduling node calculates the average priority of all nodes AvgEp_(t)=sum(Ep_1(t),Ep_2(t),...,Ep_m(t)) / m, where m is the total number of nodes and sum(Ep_1(t),Ep_2(t),...,Ep_m(t)) represents the sum of the priorities of all nodes. Then, the deviation of each node from the average priority DevEp_(i,t)=|Ep_(i,t)-AvgEp_(t)| is calculated to measure the urgency of the needs of each node. Using the calculated average priority AvgEp_(t) and deviation DevEp_(i,t), the central scheduling node generates a global priority adjustment factor GAf_(t)=1+η*(DevEp_(i,t) / max(DevEp_(1,t),DevEp_(2,t),...,DevEp_(m,t))), where η is a preset adjustment coefficient and max(DevEp_(1,t),DevEp_(2,t),...,DevEp_(m,t)) represents the maximum deviation among all nodes; for each node i, its adjusted global priority Gp_(i,t)=GAf_(t)*Ep_(i,t), thereby ensuring that high-priority nodes obtain greater weight in resource allocation while taking into account the impact of priority differences between nodes.

[0031] Example 3 Assume that there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. The bandwidth demand priority calculated by each node is as follows: Node A: NodeID_A, Ep_A(t)=10.088; Node B: NodeID_B, Ep_B(t)=10.8; Node C: NodeID_C, Ep_C(t)=10; First, each node packages the priority information into a data packet and sends it to the central scheduling node through the network: Node A: Pkg_A(t)={NodeID_A,10.088}; Node B: Pkg_B(t)={NodeID_B,10.8}; Node C: Pkg_C(t)={NodeID_C,10}; The central scheduling node receives packets from all nodes and stores them in a list: Lst=[Pkg_A(t),Pkg_B(t),Pkg_C(t)]; Sort the list in descending order by priority value Ep_(t): Lsts=sort(Lst,key=Ep_(t))=[{NodeID_B,10.8},{NodeID_A,10.088},{NodeID_C,10}]; Next, calculate the average priority of all nodes (assuming the total number of nodes m=3): AvgEp_(t)=(10.8+10.088+10) / 3=10.296; Then, calculate the deviation of each node from the average priority: DevEp_A(t)=|10.088-10.296|=0.208; DevEp_B(t)=|10.8-10.296|=0.504; DevEp_C(t)=|10-10.296|=0.296; Find the maximum deviation among all nodes: max(DevEp_A(t),DevEp_B(t),DevEp_C(t))=0.504; Using the calculated average priority and deviation, generate the global priority adjustment factor (assuming the adjustment coefficient η=0.5): Gaf_A(t)=1+0.5*(0.208 / 0.504)≈1.206; Gaf_B(t)=1+0.5*(0.504 / 0.504)=1.5; Gaf_C(t)=1+0.5*(0.296 / 0.504)≈1.294; Finally, adjust the global priority of each node: Gp_A(t)=1.206*10.088≈12.17; Gp_B(t)=1.5*10.8=16.2; Gp_C(t)=1.294*10=12.94; Through the above steps, the system can dynamically adjust the global priority of each node and reasonably allocate bandwidth to ensure that high-priority nodes get sufficient bandwidth support when resources are tight, thereby improving the overall performance and stability of the system. Each step ensures the scientificity and rationality of priority adjustment, thereby achieving the optimal configuration of resources.

[0032] S4: The central scheduling node generates a global bandwidth allocation plan based on the aggregated priority information. The allocation plan ensures that the bandwidth requirements of high-priority nodes are met first. Specifically, it includes: The central scheduling node first calculates the total priority of all nodes SumGp_(t)=sum(Gp_(1,t),Gp_(2,t),...,Gp_(n,t)) according to the adjusted global priority Gp_(i,t); here n is the total number of monitoring nodes, and SumGp_(t) represents the sum of the priorities of all nodes in the entire network; Based on the calculated total priority SumGp_(t), calculate the bandwidth allocation ratio Bap_(i,t)=Gp_(i,t) / SumGp_(t) for each node i; the purpose of this is to determine the weight of each node relative to the whole, ensuring that high-priority nodes obtain more bandwidth resources; Gp_(i,t) in the formula is the adjusted global priority of node i obtained from the previous step; According to the obtained bandwidth allocation ratio Bap_(i,t), combined with the maximum total bandwidth that can be allocated by the system Bmax, the specific bandwidth that should be allocated to each node Balloc_(i,t)=Bap_(i,t)*Bmax is calculated; here Bmax is the preset maximum available bandwidth, and Balloc_(i,t) represents the bandwidth that should be allocated to node i at time t; in this way, it is ensured that bandwidth resources are reasonably allocated according to the needs and priorities of each node; In order to cope with emergencies and ensure network stability, the central scheduling node also needs to calculate a reserved bandwidth Rsv_(t)=ρ*Bmax, where ρ is a preset proportional coefficient used to reserve a portion of the bandwidth to cope with possible emergency needs in the future; the remaining bandwidth available for allocation is Avail_(t)=Bmax-Rsv_(t); then, the updated available bandwidth is used to recalculate the actual allocated bandwidth of each node Balloc'_(i,t)=Balloc_(i,t)*(Avail_(t) / Bmax) to ensure that the stability and fairness of the system can be maintained even when the network load increases; this step references the Balloc_(i,t) value and is adjusted according to the new available bandwidth.

[0033] Example 4 Assume that there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. The adjusted global priority of each node is as follows: Node A: Gp_A(t)=12.17; Node B: Gp_B(t)=16.2; Node C: Gp_C(t)=12.94; First, calculate the total priority of all nodes (assuming the total number of nodes n=3): SumGp_(t)=12.17+16.2+12.94=41.31; Next, calculate the bandwidth allocation ratio for each node: Bap_A(t)=12.17 / 41.31≈0.295; Bap_B(t)=16.2 / 41.31≈0.392; Bap_C(t)=12.94 / 41.31≈0.313; Then, based on the bandwidth allocation ratio and the maximum total bandwidth that can be allocated by the system (assuming Bmax = 100Mbps), calculate the specific bandwidth that should be allocated to each node: Balloc_A(t)=0.295*100Mbps=29.5Mbps; Balloc_B(t)=0.392*100Mbps=39.2Mbps; Balloc_C(t)=0.313*100Mbps=31.3Mbps; In order to cope with emergencies and ensure network stability, calculate the reserved bandwidth (assuming the reserved ratio coefficient ρ = 0.1): Rsv_(t)=0.1*100Mbps=10Mbps; Avail_(t)=100Mbps-10Mbps=90Mbps; Recalculate the actual allocated bandwidth for each node using the updated available bandwidth: Balloc'_A(t)=29.5Mbps*(90Mbps / 100Mbps)=26.55Mbps; Balloc'_B(t)=39.2Mbps*(90Mbps / 100Mbps)=35.28Mbps; Balloc'_C(t)=31.3Mbps*(90Mbps / 100Mbps)=28.17Mbps; Through the above steps, the system can dynamically adjust the bandwidth allocation of each node to ensure that high-priority nodes get enough bandwidth support when resources are tight, thereby improving the overall performance and stability of the system. Each step ensures the scientificity and rationality of bandwidth allocation, thereby achieving the optimal configuration of resources. The specific steps are as follows: Calculate the total priority: By summarizing the adjusted global priorities of all nodes, the total priority SumGp_(t) is calculated to provide basic data for subsequent bandwidth allocation.

[0034] Calculate bandwidth allocation ratio: Based on the total priority, calculate the bandwidth allocation ratio Bap_(i,t) for each node to ensure that high-priority nodes obtain more bandwidth resources.

[0035] Calculate the specific bandwidth amount: According to the bandwidth allocation ratio and the maximum total bandwidth, calculate the specific bandwidth amount Balloc_(i,t) that should be allocated to each node to ensure the fairness and rationality of resource allocation.

[0036] Reserved bandwidth: To cope with emergencies, the reserved bandwidth Rsv_(t) is calculated and the remaining bandwidth available for allocation Avail_(t) is recalculated to ensure that the system remains stable when the network load increases. The actual allocated bandwidth Balloc'_(i,t) of each node is recalculated to make resource allocation more flexible and adaptable.

[0037] Through these steps, the system can effectively manage and allocate bandwidth resources in a dynamically changing network environment to ensure that the needs of each node are reasonably met.

[0038] S5: Send the global bandwidth allocation plan to each monitoring node, and the monitoring node adjusts the local data transmission rate according to the allocation plan; specifically, it includes: The central scheduling node packages the global bandwidth allocation plan Balloc'_(i, t) into a data packet Pkg_(t)={NodeID,Balloc'_(i, t)} and sends it to each monitoring node through the network; here NodeID is the node identifier, and Balloc'_(i, t) is the actual bandwidth that should be allocated to each node calculated from the previous step; After receiving the data packet Pkg_(t), the monitoring node parses the bandwidth Balloc'_(i,t) allocated to itself, and calculates an adjustment coefficient Adj_(i,t) based on the current network status and historical transmission rate records; the adjustment coefficient uses the formula Adj_(i,t)=Balloc'_(i,t) / CurrRate_(i,t-1), where CurrRate_(i,t-1) is the actual transmission rate of the node at time t-1; this step ensures that the node can make appropriate rate adjustments based on the new bandwidth allocation; Using the obtained adjustment coefficient Adj_(i,t), the monitoring node updates its local data transmission rate NewRate_(i,t)=CurrRate_(i,t-1)*Adj_(i,t); the purpose of this is to match the node's data transmission rate with the newly allocated bandwidth to avoid overload or waste of resources; here CurrRate_(i,t-1) is the actual transmission rate of the previous cycle, and Adj_(i,t) is the adjustment coefficient based on the new allocation scheme; In order to ensure that the adjusted transmission rate does not have a negative impact on the entire network, after adjusting the data transmission rate, the monitoring node collects the current network state data NewState_(t)={NewRate_(t),NewLatency_(t),NewLoad_(t)} again and compares it with the preset standard value Std_Val; calculates the deviation value Dbn_(t)=NewRate_(t)-Std_Val, DLn_(t)=NewLatency_(t)-Std_Val, Dpn_(t)=NewL oad_(t)-Std_Val; if any deviation value is found to be out of the allowable range, the transmission rate NewRate_(i,t)=NewRate_(i,t)*(1-δ*Dbn_(t)) is readjusted, where δ is a preset correction factor used to fine-tune the transmission rate to adapt to the actual network conditions; in this way, it is ensured that the node not only adjusts the rate according to the allocation plan, but also dynamically responds to network changes to maintain the stability and efficiency of the system; this step references the NewRate_(i,t) value and makes necessary adjustments based on the new network status.

[0039] Example 5 Assume that there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. The actual bandwidth allocation for each node is as follows: Node A:NodeID_A,Balloc'_A(t)=26.55Mbps; Node B: NodeID_B, Balloc'_B(t)=35.28Mbps; Node C: NodeID_C, Balloc'_C(t)=28.17Mbps; First, the central scheduling node packages the bandwidth allocation plan into data packets and sends them to each monitoring node through the network: Node A: Pkg_A(t)={NodeID_A,26.55Mbps}; Node B: Pkg_B(t)={NodeID_B,35.28Mbps}; Node C: Pkg_C(t)={NodeID_C,28.17Mbps}; After receiving the data packet, the monitoring node parses the bandwidth allocated to it and calculates an adjustment coefficient based on the current network status and historical transmission rate records. Assume that the historical transmission rate of each node is: Node A: CurrRate_A(t-1)=20Mbps; Node B: CurrRate_B(t-1)=30Mbps; Node C: CurrRate_C(t-1)=25Mbps; Calculate the adjustment factor: Adj_A(t)=26.55Mbps / 20Mbps=1.3275; Adj_B(t)=35.28Mbps / 30Mbps=1.176; Adj_C(t)=28.17Mbps / 25Mbps=1.1268; Using the adjustment coefficient, update the data transmission rate of each node: NewRate_A(t)=20Mbps*1.3275=26.55Mbps; NewRate_B(t)=30Mbps*1.176=35.28Mbps; NewRate_C(t)=25Mbps*1.1268=28.17Mbps; In order to ensure that the adjusted transmission rate does not have a negative impact on the entire network, the monitoring node collects the current network status data again after adjusting the data transmission rate and compares it with the preset standard value. Assume that the preset standard value of the system is: Std_Val=30Mbps; The re-collected network status data is as follows (assumption): node: A:NewRate_A(t)=26.55Mbps,NewLatency_A(t)=15,NewLoad_A(t)=60; node: B:NewRate_B(t)=35.28Mbps,NewLatency_B(t)=10,NewLoad_B(t)=50; node: C:NewRate_C(t)=28.17Mbps,NewLatency_C(t)=12,NewLoad_C(t)=55; Calculate the deviation value: node: A:Dbn_A(t)=26.55Mbps-30Mbps=-3.45Mbps,Dln_A(t)=15-15=0,Dpn_A(t)=60-60=0; node: B:Dbn_B(t)=35.28Mbps-30Mbps=5.28Mbps,Dln_B(t)=10-15=-5,Dpn_B(t)=50-60=-10; node: C:Dbn_C(t)=28.17Mbps-30Mbps=-1.83Mbps,Dln_C(t)=12-15=-3,Dpn_C(t)=55-60=-5; Assuming the correction coefficient δ = 0.1, for node B, since its bandwidth deviation value exceeds the allowable range, the transmission rate needs to be readjusted: NewRate_B(t)=35.28Mbps*(1-0.1*5.28Mbps)=35.28Mbps*0.472=16.65Mbps; Through the above steps, the system can dynamically adjust the data transmission rate of each node to ensure that it matches the newly allocated bandwidth, and make necessary fine-tuning according to the actual network conditions to maintain the stability and efficiency of the system. The specific steps are as follows: Sending bandwidth allocation plan: The central scheduling node packages the actual bandwidth allocation of each node into a data packet and sends it to each monitoring node to ensure that each node can obtain the bandwidth it should be allocated in a timely manner.

[0040] Parse bandwidth allocation and calculate adjustment coefficient: The monitoring node parses the bandwidth allocated to it and calculates an adjustment coefficient based on the current network status and historical transmission rate records to ensure that the node can make appropriate rate adjustments based on the new bandwidth allocation.

[0041] Update local data transmission rate: Using the calculated adjustment coefficient, the monitoring node updates its local data transmission rate so that the node's data transmission rate matches the newly allocated bandwidth amount.

[0042] Re-collect network status data and make adjustments: To ensure that the adjusted transmission rate does not have a negative impact on the entire network, the monitoring node collects the current network status data again after adjusting the data transmission rate and compares it with the preset standard value. If any deviation value is found to be beyond the allowable range, the transmission rate is readjusted to ensure the stability and efficiency of the system.

[0043] Through these steps, the system can effectively manage and adjust the data transmission rate of each node in a dynamically changing network environment, ensure that the needs of each node are reasonably met, and maintain the stability and efficiency of the system.

[0044] S6: After adjusting the data transmission rate, the monitoring node re-collects network status data to detect the actual effect of the bandwidth allocation scheme; specifically, it includes: After adjusting the data transmission rate NewRate_(i,t), the monitoring node immediately starts to re-collect network status data NewState_(t)={NewRate_(t),NewLatency_(t),NewLoad_(t)}; here NewRate_(t) represents the actual bandwidth utilization after adjustment, NewLatency_(t) represents the current data transmission delay, and NewLoad_(t) represents the node load; these data will be used to evaluate the actual effect of the new allocation scheme; According to the collected data, the standard deviation rate Sdr_(t) of each parameter relative to the standard value Std_Val is calculated; the formula is: Sdr_Rate_(t)=(NewRate_(t)-Std_Val) / Std_Val, Sdr_Latency_(t)=(NewLatency_(t)-Std_Val) / Std_Val, Sdr_LoaD_(t)=(NewLoad_(t)-Std_Val) / Std_Val; Std_Val here is the standard value preset by the system, which is used to measure the normal range of network status; by calculating the standard deviation rate, the gap between the current network status and the ideal status can be quantified; Using the obtained standard deviation rate Sdr_(t), calculate a comprehensive performance index Cpi_(t)=w4*Sdr_Rate_(t)+w5*Sdr_Latency_(t)+w6*Sdr_LoaD_(t), where w4, w5, w6 are weight coefficients, satisfying w4+w5+w6=1; this comprehensive performance index Cpi_(t) reflects the overall performance of all key parameters under the current network state, and references Sdr_Rate_(t), Sdr_Latency_(t), Sdr_LoaD_(t); Based on the calculated comprehensive performance indicator Cpi_(t), the monitoring node determines whether it is necessary to further adjust its data transmission rate; if Cpi_(t) exceeds the preset threshold Th, it indicates that the current bandwidth allocation scheme fails to achieve the expected effect and needs to be adjusted; the specific adjustment method is: calculate the new adjustment coefficient Adj'_(i,t)=Adj_(i,t)*(1-κ*Cpi_(t)), where κ is a correction factor used to dynamically adjust the transmission rate according to the size of Cpi_(t); then, update the data transmission rate to NewRate'_(i,t)=NewRate_(i,t)*Adj'_(i,t); this step references Cpi_(t) and Sdr_(t) to ensure that the transmission rate is fine-tuned according to the actual network conditions to better adapt to changes and optimize the overall network performance.

[0045] Example 6 Assume that there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. The actual bandwidth usage of each node after adjustment is: Node A: NodeID_A, NewRate_A(t)=26.55Mbps; Node B: NodeID_B, NewRate_B(t)=35.28Mbps; Node C: NodeID_C, NewRate_C(t)=28.17Mbps; The re-collected network status data is as follows (assumption): node: A:NewRate_A(t)=26.55Mbps,NewLatency_A(t)=15,NewLoad_A(t)=60; node: B:NewRate_B(t)=35.28Mbps,NewLatency_B(t)=10,NewLoad_B(t)=50; node: C:NewRate_C(t)=28.17Mbps,NewLatency_C(t)=12,NewLoad_C(t)=55; Assume that the system preset standard value is: Std_Val = 30Mbps (bandwidth utilization); Std_Val=15 (data transmission delay); Std_Val = 60 (node ​​load); Calculate the standard deviation rate of each parameter: Node A: Sdr_Rate_A(t)=(26.55Mbps-30Mbps) / 30Mbps=-0.115; Sdr_Latency_A(t)=(15-15) / 15=0; Sdr_Load_A(t)=(60-60) / 60=0; Node B: Sdr_Rate_B(t)=(35.28Mbps-30Mbps) / 30Mbps=0.176; Sdr_Latency_B(t)=(10-15) / 15≈-0.333; Sdr_Load_B(t)=(50-60) / 60≈-0.167; Node C: Sdr_Rate_C(t)=(28.17Mbps-30Mbps) / 30Mbps=-0.061; Sdr_Latency_C(t)=(12-15) / 15=-0.2; Sdr_Load_C(t)=(55-60) / 60≈-0.083; Assume the weight coefficient is: w4=0.4,w5=0.3,w6=0.3; Calculate the comprehensive performance index: Node A: Cpi_A(t)=0.4*(-0.115)+0.3*0+0.3*0=-0.046; Node B: Cpi_B(t)=0.4*0.176+0.3*(-0.333)+0.3*(-0.167)=0.0704-0.0999-0.0501=-0.0796; Node C: Cpi_C(t)=0.4*(-0.061)+0.3*(-0.2)+0.3*(-0.083)=-0.0244-0.06-0.0249=-0.1093; Assuming the preset threshold Th = 0.1, for nodes B and C, since Cpi_(t) exceeds the preset threshold, adjustment is required. Assuming the correction factor κ = 0.1.

[0046] Calculate the new adjustment factor and update the data transfer rate: Node B: Adj'_B(t)=1.176*(1-0.1*(-0.0796))=1.176*1.00796≈1.185; NewRate'_B(t)=35.28Mbps*1.185≈41.81Mbps; Node C: Adj'_C(t)=1.1268*(1-0.1*(-0.1093))=1.1268*1.01093≈1.139; NewRate'_C(t)=28.17Mbps*1.139≈32.07Mbps; Through the above steps, the system can dynamically adjust the data transmission rate of each node to ensure that it matches the newly allocated bandwidth, and make necessary fine-tuning according to the actual network conditions to maintain the stability and efficiency of the system.

[0047] S7: If it is detected that the bandwidth allocation plan fails to meet the dynamically changing network load requirements, the central scheduling node recalculates and updates the global bandwidth allocation plan; specifically, it includes: When the monitoring node detects that the comprehensive performance index Cpi_(t) exceeds the preset threshold Th, it indicates that the current bandwidth allocation scheme fails to meet the dynamically changing network load requirements; at this time, the monitoring node sends the abnormal status information An_(t)={NodeID, Cpi_(t), Dn_(t)} to the central scheduling node; here Dn_(t) is the re-collected network status data, including the adjusted actual bandwidth utilization rate Bn_(t), data transmission delay Ln_(t) and node load Pn_(t); After the central dispatching node receives the abnormal status information An_(t) of all monitoring nodes, it aggregates this information to form a global abnormal status list GAn_(t)=[An_1(t),An_2(t),...,An_n(t)]; for each node i, its abnormality degree is calculated: Ea_(i,t)=w7*Sdr_B(i,t)+w8*Sdr_L(i,t)+w9*Sdr_P(i,t), where w7, w8, w9 are weight coefficients, satisfying w7+w8+w9=1; here Sdr_B(i,t), Sdr_L(i,t), Sdr_P(i,t) are calculated by standard deviation rate; According to the calculated abnormality level Ea_(i,t), the central scheduling node updates the priority adjustment factor Apf_(i,t)=Gp_(i,t)*(1+λ*Ea_(i,t)) of each node, where λ is an adjustment coefficient used to amplify or reduce the degree of priority adjustment; here Gp_(i,t) is the adjusted global priority calculated previously; in this way, it can be ensured that when the network condition deteriorates, the nodes that are more affected can get higher priority to obtain more resources; Using the updated priority adjustment factor Apf_(i,t), the central scheduling node recalculates the total priority of all nodes SumApf_(t)=sum(Apf_(1,t),Apf_(2,t),...,Apf_(n,t)); then, calculates the new bandwidth allocation ratio Bap'_(i,t)=Apf_(i,t) / SumApf_(t) for each node; combined with the maximum total bandwidth Amax that can be allocated by the system, calculates the new bandwidth that each node should be allocated Ba''_(i,t)=Bap'_(i,t)*Amax; this step refers to Apf_(i,t) and SumApf_(t) to ensure that the changes in the current network status are fully considered when reallocating bandwidth, and that resources are allocated fairly and reasonably according to the latest priority adjustment plan to cope with dynamically changing network load requirements; finally, the central scheduling node sends the updated bandwidth allocation plan to each monitoring node so that they can adjust the local data transmission rate according to the new plan.

[0048] Example 7 Assume that there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. The abnormal status information of each node is as follows: Node A: NodeID_A,Cpi_A(t)=-0.046,Dn_A(t)={Bn_A(t)=26.55Mbps,Ln_A(t)=15,Pn_A(t)=60}; Node B: NodeID_B,Cpi_B(t)=-0.0797,Dn_B(t)={Bn_B(t)=35.28Mbps,Ln_B(t)=10,Pn_B(t)=50}; Node C: NodeID_C,Cpi_C(t)=-0.1093,Dn_C(t)={Bn_C(t)=28.17Mbps,Ln_C(t)=12,Pn_C(t)=55}; Assume that the preset threshold Th=0.1, the Cpi_(t) of node C exceeds the preset threshold and needs to be adjusted.

[0049] First, calculate the standard deviation rate for each node (already calculated): Node A: Sdr_Rate_A(t)=-0.115; Sdr_Latency_A(t)=0; Sdr_Load_A(t)=0; Node B: Sdr_Rate_B(t)=0.176; Sdr_Latency_B(t)=-0.333; Sdr_Load_B(t)=-0.167; Node C: Sdr_Rate_C(t)=-0.061; Sdr_Latency_C(t)=-0.2; Sdr_Load_C(t)=-0.083; Assume the weight coefficient is: w7=0.4,w8=0.3,w9=0.3; Calculate the degree of abnormality of each node: Node A: Ea_A(t)=0.4*(-0.115)+0.3*0+0.3*0=-0.046; Node B: Ea_B(t)=0.4*0.176+0.3*(-0.333)+0.3*(-0.167)≈0.0704-0.1-0.0501=-0.0797; Node C: Ea_C(t)=0.4*(-0.061)+0.3*(-0.2)+0.3*(-0.083)=-0.0244-0.06-0.0249=-0.1093; Assuming the adjustment coefficient λ=0.5, update the priority adjustment factor of each node (assuming the previously adjusted global priority is Gp_A(t)=12.17, Gp_B(t)=16.2, Gp_C(t)=12.94): Node A: Apf_A(t)=12.17*(1+0.5*(-0.046))=12.17*0.977≈11.89; Node B: Apf_B(t)=16.2*(1+0.5*(-0.0797))=16.2*0.96015≈15.55; Node C: Apf_C(t)=12.94*(1+0.5*(-0.1093))=12.94*0.94535≈12.23; Recalculate the total priority of all nodes: SumApf_(t)=11.89+15.55+12.23=39.67; Calculate the new bandwidth allocation ratio: Bap'_A(t)=11.89 / 39.67≈0.2997; Bap'_B(t)=15.55 / 39.67≈0.3920; Bap'_C(t)=12.23 / 39.67≈0.3083; Combined with the maximum total bandwidth that can be allocated by the system (assuming Amax = 100Mbps), calculate the new bandwidth that should be allocated to each node: Ba''_A(t)=0.2997*100Mbps=29.97Mbps; Ba''_B(t)=0.3920*100Mbps=39.2Mbps; Ba''_C(t)=0.3083*100Mbps=30.83Mbps; Finally, the central scheduling node sends the updated bandwidth allocation plan to each monitoring node so that they can adjust the local data transmission rate according to the new plan.

[0050] Through the above steps, the system can effectively manage and adjust the data transmission rate of each node in a dynamically changing network environment, ensure that the needs of each node are reasonably met, and maintain the stability and efficiency of the system.

[0051] S8: Repeat steps S6 and S7 to form a closed-loop adjustment process to ensure that bandwidth allocation always adapts to changes in network load and monitoring requirements. Specifically, it includes: After the central scheduling node completes the update of the bandwidth allocation plan and sends it to each monitoring node, it starts a new cycle; each monitoring node adjusts its data transmission rate according to the received new allocation plan Ba''_(i, t), and re-collects network status data Dn'_(t)={Bn'_(t), Ln'_(t), Pn'_(t)} after T seconds of adjustment; here Bn'_(t), Ln'_(t) and Pn'_(t) are the actual bandwidth utilization rate, data transmission delay and node load after adjustment respectively; According to the collected data Dn'_(t), calculate the new standard deviation rate Sdr'_(t); the formula is Sdr_B'(t)=(Bn'_(t)-Sn) / Sn, Sdr_L'(t)=(Ln'_(t)-Sn) / Sn, Sdr_P'(t)=(Pn'_(t)-Sn) / Sn; Sn here is the standard value preset by the system, which is used to measure the ideal range of network status; through these calculations, the actual effect of the new allocation plan can be evaluated; Using the obtained standard deviation rate Sdr'_(t), calculate a comprehensive performance index Cpi'_(t)=w10*Sdr_B'(t)+w11*Sdr_L'(t)+w12*Sdr_P'(t), where w10, w11, w12 are weight coefficients, satisfying w10+w11+w12=1; this comprehensive performance index Cpi'_(t) reflects the overall performance of all key parameters under the current network state, and references Sdr_B'(t), Sdr_L'(t), Sdr_P'(t); If the calculated comprehensive performance index Cpi'_(t) still exceeds the preset threshold Th, it indicates that the current bandwidth allocation scheme still cannot fully adapt to the network load demand; at this time, the monitoring node sends the latest abnormal status information An'_(t)={NodeID,Cpi'_(t),Dn'_(t)} to the central scheduling node again; after receiving this information, the central scheduling node repeats the processing flow: summarize the global abnormal status list Gan'_(t), calculate the abnormality degree Ea'_(i,t), update the priority adjustment factor Apf'_(i,t), and recalculate Calculate the total priority SumApf'_(t) and generate a new bandwidth allocation ratio Bap''_(i,t); finally, according to the updated bandwidth allocation plan Bap'''_(i,t)=Bap''_(i,t)*Amax, it is sent to each monitoring node again; in this way, a closed-loop adjustment process is formed to ensure that bandwidth allocation can always adapt to changes in network load and monitoring requirements and continuously optimize network performance; this step refers to Cpi'_(t) and Sdr'_(t) to ensure necessary adjustments and optimizations based on the latest network conditions.

[0052] Example 8 Assume that there is a distributed monitoring system consisting of three monitoring nodes A, B, and C. The initial bandwidth allocation plan has been updated and sent to each monitoring node: Node A: New allocation scheme Ba''_A(t)=29.97Mbps; Node B: New allocation scheme Ba''_B(t)=39.2Mbps; Node C: New allocation scheme Ba''_C(t)=30.83Mbps; Each monitoring node adjusts its data transmission rate according to the received new allocation scheme and re-collects network status data after T seconds after the adjustment (assuming T = 5 seconds): Node A:Dn'_A(t)={Bn'_A(t)=29.5Mbps,Ln'_A(t)=14,Pn'_A(t)=58}; Node B:Dn'_B(t)={Bn'_B(t)=39Mbps,Ln'_B(t)=9,Pn'_B(t)=48}; Node C: Dn'_C(t)={Bn'_C(t)=31Mbps, Ln'_C(t)=11, Pn'_C(t)=53}; Assume that the system preset standard value is: Sn=30Mbps (bandwidth utilization); Sn=15 (data transmission delay); Sn=60 (node ​​load); Calculate the new standard deviation rate: Node A: Sdr_B'(t)=(29.5Mbps-30Mbps) / 30Mbps≈-0.0167; Sdr_L'(t)=(14-15) / 15≈-0.0667; Sdr_P'(t)=(58-60) / 60≈-0.0333; Node B: Sdr_B'(t)=(39Mbps-30Mbps) / 30Mbps=0.3; Sdr_L'(t)=(9-15) / 15=-0.4; Sdr_P'(t)=(48-60) / 60=-0.2; Node C: Sdr_B'(t)=(31Mbps-30Mbps) / 30Mbps≈0.0333; Sdr_L'(t)=(11-15) / 15≈-0.2667; Sdr_P'(t)=(53-60) / 60≈-0.1167; Assume the weight coefficient is: w10=0.4,w11=0.3,w12=0.3; Calculate new comprehensive performance indicators: Node A: Cpi'_A(t)=0.4*(-0.0167)+0.3*(-0.0667)+0.3*(-0.0333)=-0.00668-0.02001-0.00999=-0.03668; Node B: Cpi'_B(t)=0.4*0.3+0.3*(-0.4)+0.3*(-0.2)=0.12-0.12-0.06=-0.06; Node C: Cpi'_C(t)=0.4*0.0333+0.3*(-0.2667)+0.3*(-0.1167)=0.01332-0.08001-0.03501=-0.1017; Assuming that the preset threshold Th=0.1, the Cpi'_(t) of node C still exceeds the preset threshold and needs to be adjusted.

[0053] Node C sends the latest abnormal status information to the central scheduling node: An'_C(t)={NodeID_C,Cpi'_C(t)=-0.1017,Dn'_C(t)={Bn'_C(t)=31Mbps,Ln'_C(t)=11,Pn'_C(t)=53}}; After receiving this information, the central scheduling node repeats the processing flow in step S7: Summarize the global abnormal status list: Gan'_(t)=[An'_C(t)]; Calculate the degree of abnormality: Ea'_C(t)=0.4*0.0333+0.3*(-0.2667)+0.3*(-0.1167)=0.01332-0.08001-0.03501=-0.1017; Update the priority adjustment factor (assuming the adjustment coefficient λ=0.5, the previously adjusted global priority Gp_C(t)=12.94): Apf'_C(t)=12.94*(1+0.5*(-0.1017))=12.94*0.94915≈12.28; Recalculate the overall priority: Assuming that the priority adjustment factors of other nodes remain unchanged, recalculate the total priority: SumApf'_(t)=11.87+15.55+12.28=39.7; Calculate the new bandwidth allocation ratio: Bap''_C(t)=12.28 / 39.7≈0.3093; Generate a new bandwidth allocation plan (assuming the maximum total bandwidth Amax = 100Mbps): Ba'''_C(t)=0.3093*100Mbps≈30.93Mbps; Finally, the central scheduling node sends the updated bandwidth allocation plan Bap'''_(i,t) to each monitoring node, forming a closed-loop adjustment process to ensure that bandwidth allocation can always adapt to changes in network load and monitoring requirements and continuously optimize network performance.

[0054] Through the above steps, the system can effectively manage and adjust the data transmission rate of each node in a dynamically changing network environment, ensure that the needs of each node are reasonably met, and maintain the stability and efficiency of the system.

[0055] On the other hand, the present invention proposes a distributed monitoring bandwidth adjustment system capable of adaptive scheduling, such as Figure 2 As shown, including: Data collection module, used to collect network status data in real time at the monitoring node; The priority calculation module is used to calculate the bandwidth demand priority of each monitoring node based on the collected network status data. The priority is dynamically adjusted based on data transmission delay and node load; The priority aggregation module is used to send the calculated bandwidth demand priority to the central scheduling node, and the central scheduling node aggregates the priority information of all monitoring nodes; The global allocation plan generation module is used by the central scheduling node to generate a global bandwidth allocation plan based on the aggregated priority information. The allocation plan ensures that the bandwidth requirements of high-priority nodes are met first. The allocation plan delivery and adjustment module is used to deliver the global bandwidth allocation plan to each monitoring node, and the monitoring node adjusts the local data transmission rate according to the allocation plan; The effect evaluation module is used to monitor the node and re-collect network status data after adjusting the data transmission rate to detect the actual effect of the bandwidth allocation plan; A dynamic adjustment module, used for the central scheduling node to recalculate and update the global bandwidth allocation plan if it is detected that the bandwidth allocation plan fails to meet the dynamically changing network load requirements; The closed-loop adjustment module is used to repeat steps S6 and S7 to form a closed-loop adjustment process to ensure that bandwidth allocation always adapts to changes in network load and monitoring requirements.

[0056] In addition, when executing, each of the above modules also implements other steps of the above-mentioned distributed monitoring bandwidth adjustment method capable of adaptive scheduling, which will not be described one by one here.

[0057] In summary, the present invention ensures that high-priority nodes can obtain bandwidth resources first by collecting network status data in real time and dynamically adjusting the bandwidth demand priority of each node. The central scheduling node summarizes the priority information of all nodes, generates a global bandwidth allocation plan, and continuously adapts to changes in network load and monitoring requirements through a closed-loop adjustment process. This method significantly improves the utilization rate of bandwidth resources, enhances the stability and reliability of the system, reduces data transmission delays and packet loss, and ensures that key nodes can still obtain sufficient bandwidth support under high load or emergency conditions, thereby improving the flexibility and response speed of the entire distributed monitoring system.

[0058] Finally, it should be noted that the above is only a preferred embodiment of the present invention and is not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, it is still possible for those skilled in the art to modify the technical solutions described in the aforementioned embodiments or to make equivalent substitutions for some of the technical features therein. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A distributed monitoring bandwidth adjustment method capable of adaptive scheduling, characterized in that: The following steps are involved: S1: Monitoring node collects network status data in real time; S2: Calculate the bandwidth demand priority of each monitoring node based on the collected network status data, where the priority is dynamically adjusted based on data transmission delay and node load; S3: Send the calculated bandwidth demand priority to the central scheduling node, which aggregates the priority information of all monitoring nodes; S4: The central scheduling node generates a global bandwidth allocation plan based on the aggregated priority information. The allocation plan ensures that the bandwidth requirements of high-priority nodes are met first. S5: Send the global bandwidth allocation plan to each monitoring node, and the monitoring node adjusts the local data transmission rate according to the allocation plan; S6: After adjusting the data transmission rate, the monitoring node re-collects network status data to detect the actual effect of the bandwidth allocation scheme; S7: If it is detected that the bandwidth allocation scheme fails to meet the dynamically changing network load requirements, the central scheduling node recalculates and updates the global bandwidth allocation scheme; S8: Repeat steps S6 and S7 to form a closed-loop adjustment process, ensuring that bandwidth allocation always adapts to changes in network load and monitoring requirements.

2. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 1, characterized in that: The monitoring node collects network status data in real time, including: Each monitoring node collects network status data at fixed time intervals, including current bandwidth usage, data transmission delay, and node load; calculates the standard value of each parameter, and compares the actual measured value with the standard value to obtain the deviation value; According to the obtained deviation value, the priority adjustment factor is calculated, and the current priority of the monitoring node is updated using this factor. If the adjustment factor is greater than zero, the priority of the node is increased, otherwise it is decreased; The updated priorities are sent to the central scheduling node, which receives the priority information set of all monitoring nodes and generates a global resource demand index based on this information; The central scheduling node generates a new bandwidth allocation scheme based on the generated global resource demand index and the predefined weight allocation principle.

3. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 2, characterized in that: The bandwidth requirement priority of each monitoring node is calculated based on the collected network status data, and the priority is dynamically adjusted based on data transmission delay and node load, including: For each monitoring node, a basic priority value is first calculated based on the collected network status data. The deviation value is calculated by combining the standard delay and load level defined by the system with the actual measured value, and the priority is adjusted accordingly. The priority value is adjusted by using the obtained basic priority value and combining it with the bandwidth usage rate; Convert the adjusted priorities into relative priorities to adapt to the global evaluation criteria of the central scheduling node. Through standardization, ensure that the priorities of each node can be compared with each other. According to the calculated relative priority, the final bandwidth requirement priority of the monitoring node is updated.

4. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 3 is characterized in that: The calculated bandwidth demand priority is sent to the central scheduling node, and the central scheduling node summarizes the priority information of all monitoring nodes, including: Each monitoring node sends the value of the bandwidth demand priority to the central scheduling node through the network according to the bandwidth demand priority calculated by it. The sent data packet contains the node's identity identifier and priority value; The central scheduling node receives the data packets sent by all monitoring nodes and stores them in a list, sorting the list in descending order according to the priority value; Based on the sorted list, the central scheduling node calculates the average priority of all nodes, and then calculates the deviation of each node from the average priority; Using the calculated average priority and deviation, the central scheduling node generates a global priority adjustment factor.

5. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 4, characterized in that: The central scheduling node generates a global bandwidth allocation scheme based on the aggregated priority information. The allocation scheme ensures that the bandwidth requirements of high-priority nodes are met first, including: The central scheduling node calculates the bandwidth allocation ratio for each node based on the total priority of all nodes; Based on the calculated bandwidth allocation ratio and the maximum total bandwidth that can be allocated by the system, the specific bandwidth that should be allocated to each node is calculated; In order to cope with emergencies and ensure network stability, the central scheduling node also needs to calculate a reserved bandwidth, and the remaining bandwidth available for allocation is used to recalculate the actual allocated bandwidth of each node.

6. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 5, characterized in that: The global bandwidth allocation scheme is sent to each monitoring node, and the monitoring node adjusts the local data transmission rate according to the allocation scheme, including: The central scheduling node packages the global bandwidth allocation plan into data packets and sends them to each monitoring node through the network. Each data packet contains the node's identifier and the amount of bandwidth to be allocated. After receiving the data packet, the monitoring node parses the bandwidth allocated to it and calculates an adjustment coefficient based on the current network status and historical transmission rate records; Using the obtained adjustment coefficient, the monitoring node updates its local data transmission rate; The monitoring node collects the current network status data again and compares it with the preset standard value. If any deviation value is found to be beyond the allowable range, the transmission rate is readjusted.

7. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 6, characterized in that: After adjusting the data transmission rate, the monitoring node re-collects network status data to detect the actual effect of the bandwidth allocation scheme, including: When the monitoring node detects that the comprehensive performance index exceeds the preset threshold, it indicates that the current bandwidth allocation scheme fails to meet the dynamically changing network load requirements; at this time, the monitoring node sends the abnormal status information to the central scheduling node; After receiving the abnormal status information of all monitoring nodes, the central scheduling node aggregates this information to form a global abnormal status list; for each node, its abnormality degree is calculated to reflect the performance of the node when the network status deteriorates; Based on the calculated abnormality level, the central scheduling node updates the priority adjustment factor of each node; Using the updated priority adjustment factor, the central scheduling node recalculates the total priority of all nodes and generates a new bandwidth allocation ratio; combined with the maximum total bandwidth that can be allocated by the system, the new bandwidth that should be allocated to each node is calculated; finally, the central scheduling node sends the updated bandwidth allocation plan to each monitoring node.

8. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 7, characterized in that: If it is detected that the bandwidth allocation scheme fails to meet the dynamically changing network load requirements, the central scheduling node recalculates and updates the global bandwidth allocation scheme, including: When the monitoring node detects that the comprehensive performance index still exceeds the preset threshold, the monitoring node sends the latest abnormal status information to the central scheduling node again. After receiving this information, the central scheduling node summarizes the global abnormal status list; The central scheduling node calculates the abnormality level of each node and updates the priority adjustment factor of each node; Using the updated priority adjustment factor, the central scheduling node recalculates the total priority of all nodes and generates a new bandwidth allocation ratio. Combined with the maximum total bandwidth that can be allocated by the system, the new bandwidth amount that should be allocated to each node is calculated; Finally, the central scheduling node sends the updated bandwidth allocation plan to each monitoring node again.

9. The adaptively schedulable distributed monitoring bandwidth adjustment method according to claim 8, characterized in that: The steps S6 and S7 are repeated to form a closed-loop regulation process, including: After the central scheduling node completes the update of the bandwidth allocation plan and sends it to each monitoring node, it starts a new cycle. Each monitoring node adjusts its data transmission rate according to the received new allocation plan and re-collects network status data after the adjusted fixed time interval; Calculate the new standard deviation rate based on the re-collected data; Using the calculated standard deviation rate, a composite performance index is calculated; If the calculated comprehensive performance index still exceeds the preset threshold, the monitoring node will send the latest abnormal status information to the central scheduling node again; The central scheduling node repeats the process: summarizes the global abnormal status list, calculates the degree of abnormality, updates the priority adjustment factor, recalculates the total priority, and generates a new bandwidth allocation ratio; finally, according to the updated bandwidth allocation plan, it is sent to each monitoring node again.

10. A distributed monitoring bandwidth adjustment system capable of adaptive scheduling for implementing the method according to any one of claims 1 to 9, characterized in that: include: Data collection module, used to collect network status data in real time at the monitoring node; The priority calculation module is used to calculate the bandwidth demand priority of each monitoring node based on the collected network status data. The priority is dynamically adjusted based on data transmission delay and node load; The priority aggregation module is used to send the calculated bandwidth demand priority to the central scheduling node, and the central scheduling node aggregates the priority information of all monitoring nodes; The global allocation plan generation module is used by the central scheduling node to generate a global bandwidth allocation plan based on the aggregated priority information. The allocation plan ensures that the bandwidth requirements of high-priority nodes are met first. The allocation plan delivery and adjustment module is used to deliver the global bandwidth allocation plan to each monitoring node, and the monitoring node adjusts the local data transmission rate according to the allocation plan; The effect evaluation module is used to monitor the node and re-collect network status data after adjusting the data transmission rate to detect the actual effect of the bandwidth allocation plan; A dynamic adjustment module, used for the central scheduling node to recalculate and update the global bandwidth allocation plan if it is detected that the bandwidth allocation plan fails to meet the dynamically changing network load requirements; The closed-loop regulation module is used to repeatedly execute the effect evaluation module and the dynamic adjustment module to form a closed-loop regulation process, thereby ensuring that bandwidth allocation always adapts to changes in network load and monitoring requirements.

Images