Network topology aware edge device non-inductive upgrading method and system and medium

Abstract

The invention discloses a network topology aware edge device non-inductive upgrading method and system and a medium, and relates to the technical field of device upgrading. The method comprises the following steps: a device information acquisition process: acquiring device information of each sub-device, wherein the device information comprises a position of the device in a network topology, a device memory utilization rate condition, a device load condition and a network congestion condition; an upgrading evaluation process: according to the equipment information of each piece of sub-equipment, determining an upgrading sequence of each piece of sub-equipment in the topological environment through a weighting algorithm; in the non-inductive upgrading process, upgrading services are sequentially issued according to the upgrading sequence, so that the lower hanging equipment of the to-be-upgraded sub-equipment roams to the stable equipment in the topology environment, and the sub-equipment is upgraded after roaming of the lower hanging equipment is completed; and obtaining an upgrading condition returned by the sub-equipment. According to the invention, the upgrading strategy is intelligently adjusted based on the equipment capability and the network condition, and the user-awareness-free and weak network environment high-success-rate upgrading experience is realized.

Description

Technical Field

[0001] This invention relates to the field of equipment upgrade technology, and in particular to a method, system and medium for seamless upgrade of edge devices with network topology awareness. Background Technology

[0002] Traditional network equipment upgrade methods, in an effort to minimize user perception, typically involve unified upgrades during off-peak hours such as early morning. However, this results in poor timeliness and lingering user experience issues. Furthermore, fixed upgrade strategies ignore individual device capabilities, potentially leading to resource waste or delayed upgrades. The lack of proactive analysis of network topology, location, and bandwidth can cause network congestion or service interruptions in weak network environments. Additionally, equipment upgrade status is usually reported via a single link, resulting in latency and insufficient reliability. Summary of the Invention

[0003] The technical problem to be solved by the present invention is to provide a method, system and medium for seamless upgrade of edge devices with network topology awareness, which intelligently adjusts the upgrade strategy based on device capabilities and network conditions, so as to achieve a seamless upgrade experience for users and a high success rate in weak network environments.

[0004] In a first aspect, the present invention provides a method for seamless upgrades of edge devices with network topology awareness, comprising:

[0005] Device information acquisition process: Acquire device information for each sub-device, including the device's location in the network topology, device memory utilization, device load, and network congestion status;

[0006] Upgrade evaluation process: Based on the device information of each sub-device, the upgrade order of each sub-device in the topology environment is determined by a weighted algorithm;

[0007] Seamless upgrade process: Upgrade services are issued sequentially according to the upgrade order, enabling the downstream devices of the sub-device to roam to stable devices in the topology environment. After the downstream devices have completed roaming, the sub-device performs the upgrade; the upgrade status returned by the sub-device is obtained.

[0008] Furthermore, the weighted algorithm in the upgrade evaluation process is specifically as follows:

[0009] S total =S topology +S ram +S subClinet +S network

[0010] Among them, S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S ramThe device memory utilization score is calculated based on the current raw size used by the device and the maximum raw size supported by the device; S flash The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S network The network congestion score is calculated based on packet loss rate, latency, and current bandwidth utilization.

[0011] Furthermore, S topology The minimum cost path, MinCost, obtained from Dijkstra's algorithm is calculated using the following formula:

[0012] s topology =MinCost / T 跳数 ×10

[0013] Where, MinCost = Dijkstra(E 拓扑位置矩阵 E weight E weight Given the cost matrix, the formula for calculating the weight is:

[0014] Weight = BaseCost + i × RSSI penalty +j×Utilization penalty

[0015] BaseCost is determined based on the connection type. RSSI is the signal strength, Utilization is the channel utilization, and i and j are the weighting coefficients.

[0016] Furthermore, during the seamless upgrade process, the roaming score of the surrounding devices of the sub-device to be upgraded is calculated based on the network environment and topology. Stable devices are then determined based on the roaming score, and the downstream devices of the sub-device to be upgraded are roamed to the stable devices in the topology environment. The roaming score is calculated using the following formula:

[0017] S roam =w1×S stability +w2×S topology +w3×S subClinet +w4×S signal

[0018] Among them, S stability The equipment stability score is calculated based on the ratio of online time to statistical time; S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S subClinetThe device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S signal The signal strength score is calculated based on RSSI; w1, w2, w3, and w4 are the weighting coefficients for each score.

[0019] Furthermore, the device upgrade status on each link is updated in real time through multi-link fusion technology, and unified judgment, recording and retry logic processing are performed through local fusion mechanism.

[0020] Secondly, the present invention provides a network topology-aware edge device seamless upgrade system, comprising:

[0021] The device information acquisition module is used to acquire device information for each sub-device, including the device's location in the network topology, device memory utilization, device load, and network congestion.

[0022] The upgrade evaluation module is used to determine the upgrade order of each sub-device in the topology environment based on the device information of each sub-device and through a weighted algorithm.

[0023] The seamless upgrade module is used to sequentially issue upgrade services according to the upgrade order, enabling the downstream devices of the sub-device to roam to stable devices in the topology environment. After the downstream devices have completed roaming, the sub-device performs the upgrade; and the module obtains the upgrade status returned by the sub-device.

[0024] Furthermore, the weighted algorithm in the upgrade evaluation process is specifically as follows:

[0025] S total =S topology +S ram +S subClinet +S network

[0026] Among them, S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S ram The device memory utilization score is calculated based on the current raw size used by the device and the maximum raw size supported by the device; S flash The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S network The network congestion score is calculated based on packet loss rate, latency, and current bandwidth utilization.

[0027] Furthermore, S topology The minimum cost path, MinCost, obtained from Dijkstra's algorithm is calculated using the following formula:

[0028]

[0029] Where, MinCost = Dijkstra(E 拓扑位置矩阵 E weight E weight Given the cost matrix, the formula for calculating the weight is:

[0030] Weight = BaseCost + i × RSSI penalty +j×Utilization penalty

[0031] BaseCost is determined based on the connection type. RSSI is the signal strength, Utilization is the channel utilization, and i and j are the weighting coefficients.

[0032] Furthermore, during the seamless upgrade process, the roaming score of the surrounding devices of the sub-device to be upgraded is calculated based on the network environment and topology. Stable devices are then determined based on the roaming score, and the downstream devices of the sub-device to be upgraded are roamed to the stable devices in the topology environment. The roaming score is calculated using the following formula:

[0033] S roam =w1×S stability +w2×S topology +w3×S subClinet +w4×S signal

[0034] Among them, S stability The equipment stability score is calculated based on the ratio of online time to statistical time; S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S subClinet The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S signal The signal strength score is calculated based on RSSI; w1, w2, w3, and w4 are the weighting coefficients for each score.

[0035] Thirdly, the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in the first aspect.

[0036] The technical solutions provided in the embodiments of the present invention have at least the following technical effects or advantages:

[0037] 1. Dynamically determine upgrade priorities based on network topology and bandwidth to avoid network congestion, and proactively trigger roaming to avoid service interruption, significantly improving user experience.

[0038] 2. Utilize topology awareness and traffic analysis to accurately schedule user device roaming based on upgrade priorities, avoiding user-perceived interruptions.

[0039] 3. Intelligently adjust and upgrade strategies based on equipment capabilities and network conditions to reduce network load.

[0040] 4. By integrating multiple links to provide feedback on device upgrade status, unified status analysis and recording can be achieved; accurate reporting of device status ensures the reliability of upgrades.

[0041] The above description is merely an overview of the technical solution of the present invention. In order to better understand the technical means of the present invention and to implement it in accordance with the contents of the specification, and in order to make the above and other objects, features and advantages of the present invention more apparent and understandable, specific embodiments of the present invention are described below. Attached Figure Description

[0042] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0043] Figure 1 This is a flowchart of the method in Embodiment 1 of the present invention;

[0044] Figure 2 This is a flowchart illustrating the execution of the method in Embodiment 1 of the present invention;

[0045] Figure 3 This is a schematic diagram of the device in Embodiment 2 of the present invention;

[0046] Figure 4 This is a schematic diagram of the structure of the medium in Embodiment 3 of the present invention. Detailed Implementation

[0047] This invention provides a network topology-aware edge device seamless upgrade method, system, and medium that intelligently adjusts upgrade strategies based on device capabilities and network conditions, achieving a seamless upgrade experience for users and a high success rate in weak network environments.

[0048] Before introducing specific embodiments, the system framework corresponding to the method of this invention will be described first. The system is roughly divided into three parts: a master device, a sub-device, and a downstream device. The sub-device is connected to the master device or other sub-devices; each sub-device is connected to a downstream device. The system can be an FTTR system or other types of network communication systems.

[0049] This invention provides a method, system, and medium for seamless upgrades of edge devices under network topology awareness. It intelligently adjusts upgrade strategies based on device capabilities and network conditions to reduce network load; utilizes topology awareness and traffic analysis to accurately schedule user device roaming based on upgrade priorities, avoiding user-perceived interruptions; and ensures upgrade reliability by reporting device status in real-time and accurately through multi-link fusion technology. In weak network environments, it effectively improves upgrade success rates through breakpoint resumption and aggregation mechanisms, enabling resume transmission in weak network conditions, significantly enhancing user experience and upgrade efficiency. Overall, it achieves a seamless upgrade experience with uninterrupted network connectivity and a high success rate in weak network environments.

[0050] Example 1

[0051] This embodiment provides a method for seamless upgrades of edge devices with network topology awareness, such as... Figure 1 As shown, it includes:

[0052] S1. Device information acquisition process: Acquire the device information of each sub-device, including the device's location in the network topology, device memory utilization, device load, and network congestion.

[0053] S2. Upgrade Evaluation Process: Based on the device information of each sub-device, the upgrade order of each sub-device in the topology environment is determined through a weighted algorithm.

[0054] S3. Seamless upgrade process: Upgrade services are issued sequentially according to the upgrade order, so that the downstream devices of the sub-device to be upgraded roam to stable devices in the topology environment. After the downstream devices have completed roaming, the sub-devices perform upgrades; the upgrade status returned by the sub-devices is obtained.

[0055] In one specific embodiment, such as Figure 2 As shown, the specific execution process is as follows:

[0056] 1. The main device queries the device capabilities and network congestion status of each sub-device.

[0057] 2. Each sub-device returns its own status:

[0058] a. The upgrade status of devices on each link (MESH, MQTT, etc.) is collected in real time through the multi-link fusion module and reported to the master device in real time;

[0059] b. The topology location and bandwidth traffic analysis module analyzes the device's location in the network topology and the amount of bandwidth traffic it is in in real time, and then feeds this information back to the master device.

[0060] 3. The main equipment will be upgraded according to the status of each sub-equipment and the planned upgrade sequence.

[0061] The main device's device capacity awareness module detects the load capacity of each sub-device, assesses network congestion, decides whether to upgrade immediately or delay the upgrade, and distributes upgrade packages in batches during the upgrade process.

[0062] The evaluation algorithm is as follows:

[0063] Upgrade priority S total :

[0064] S total =S topology +S ram +S subClinet +S network

[0065] Among them, S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S ram The device memory utilization score is calculated based on the current raw size used by the device and the maximum raw size supported by the device; S flash The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S network The network congestion score is calculated based on packet loss rate, latency, and current bandwidth utilization.

[0066] The above scores can be calculated using the following formula:

[0067] Topological location score S topology The minimum cost path, MinCost, is calculated based on Dijkstra's algorithm.

[0068]

[0069] (1) Cost calculation: Cost calculation is used to calculate the cost from AP to the next hop.

[0070] The formula for calculating the cost (Weight) is:

[0071] Weight = BaseCost + i × RSSI penalty +j×Utilization penalty

[0072] BaseCost is determined based on the connection type. RSSI is the signal strength, Utilization is the channel utilization, and i and j are the weighting coefficients.

[0073] In one possible implementation, the weights of each item can be adjusted based on the network size (average number of hops from each AP to the controller) and the application scenario. Here, the maximum cost per link is set to 10 as the standard for initializing the weights.

[0074] Weight = BaseCost + 3 × RSSI penalty +4×Utilization penalty

[0075]

[0076] (2) Calculation of the minimum cost path (using Dijkstra's algorithm)

[0077] Dijkstra's algorithm is used to compute the minimum-cost path from a given access point (AP) to a controller. The algorithm steps are as follows:

[0078] - Initialization: Starting from the source AP, set the initial node distance to 0, and all others to infinity.

[0079] - Iterative update: Perform relaxation operations on the adjacent nodes of each node and update the distance.

[0080] Result: The minimum cost path from the source node to all nodes, especially to the Controller, is obtained.

[0081] MinCost=Dijkstra(E 拓扑位置矩阵 E weight )

[0082] Among them, E weight The cost matrix consists of the weight values ​​for each device.

[0083] S ram (Memory utilization raw score) is calculated as follows:

[0084]

[0085] R now Indicates the current raw size used by the device, R max Indicates the maximum raw size supported by the device. subClinet The (equipment load score) is calculated as follows:

[0086]

[0087] S network The network congestion score is calculated as follows:

[0088] Variables to consider:

[0089] - Packet loss rate: 0%~10%

[0090] - Latency: 0~500ms

[0091] - Current bandwidth usage: 0% to 100%

[0092]

[0093] Constraints:

[0094] 0 ≤ packetLoss ≤ 10%

[0095] 0ms ≤ latency ≤ 500ms

[0096] 0% ≤ bandwidth Usage ≤ 100%

[0097] The weights satisfy: v1 + v2 + v3 = 1

[0098] Recommendation weights: v1 = 0.4, v2 = 0.3, v3 = 0.3

[0099] The master device uses the S of each sub-device total The system scores and plans the upgrade sequence, then distributes upgrade packages in batches using a throttling approach during the upgrade process. The main device can also use network congestion scores (S) to determine the upgrade order. network Decide whether to upgrade immediately or delay the upgrade.

[0100] 4. The main equipment issues upgrade requests to the sub-equipment according to the plan.

[0101] Based on the network environment and topology, graph theory algorithms are used to roam the downstream devices of the device to be upgraded to stable devices in the topology environment, so that the device upgrade process is seamless for users and the network is not interrupted.

[0102] Stable devices can be identified based on roaming ratings, which are calculated using the following formula:

[0103] S roam =w1×S stability +w2×S topology +w3×S subClinet +w4×S signal

[0104] Among them, S stability The equipment stability score is calculated based on the ratio of online time to statistical time; S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S subClinetThe device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S signal The signal strength score is calculated based on RSSI; w1, w2, w3, and w4 are the weighting coefficients for each score.

[0105] Specifically, S stability The equipment stability score is calculated as follows:

[0106]

[0107] S subClinent The equipment load score is calculated as follows:

[0108]

[0109] S signal The signal strength score is calculated as follows:

[0110]

[0111] Where RSSI is the current signal strength, RSSI max and RSSI min To standardize the theoretical values.

[0112] Stable devices are generally selected based on a roaming rating of S. roam The highest level of equipment.

[0113] 5. The sub-device will roam to the designated stable device according to the instructions issued by the master device.

[0114] The breakpoint resume aggregation module records the breakpoint position when downloading the upgrade package from the main device. When the download is interrupted, the edge device caches and aggregates the resume data packets. It can also use the cooperation of neighboring nodes to achieve efficient data resume and improve the upgrade success rate in weak network environments.

[0115] 6. Real-time multi-link transmission upgrade status.

[0116] After the roaming of the downstream device is completed, the sub-device begins to upgrade and collects the device upgrade status on each link (MESH, MQTT, etc.) in real time through the multi-link fusion module, including download progress, success or failure status, and reports it to the central device in real time. The local fusion mechanism performs unified judgment, recording and retry logic processing.

[0117] 7. The master device records the real-time upgrade status of the sub-devices and determines whether a retry is necessary.

[0118] Specific application scenarios of the method in this embodiment include, but are not limited to:

[0119] Scenario 1 (Home Smart Networking Environment): Home FTTR devices intelligently identify the capabilities and network status of each device, and automatically select idle time periods for batch upgrades (e.g., during S...). network The upgrade will be performed when the threshold is exceeded, ensuring that users are not affected when watching high-definition videos or playing online games. The timing and strategy of the upgrade are determined by device capabilities and network congestion, completing the upgrade as quickly as possible while avoiding impacting the user experience.

[0120] Scenario 2 (Community or Campus Broadband Network): Edge devices prioritize upgrading core aggregation devices based on real-time network topology and bandwidth load (e.g., in S...). total In the calculation, S is given topology Setting higher weighting coefficients helps avoid network bottlenecks and ensures the overall stability of network operation.

[0121] Scenario 3 (weak network or remote areas): Edge devices adopt breakpoint resume and neighbor node data aggregation technology, which significantly improves the upgrade success rate and ensures that devices can be upgraded smoothly even in areas with poor network conditions.

[0122] Based on the same inventive concept, this application also provides a system corresponding to the method in Embodiment 1, as detailed in Embodiment 2.

[0123] Example 2

[0124] This embodiment provides a network topology-aware edge device seamless upgrade system, such as... Figure 3 As shown, it includes:

[0125] The device information acquisition module is used to acquire device information for each sub-device, including the device's location in the network topology, device memory utilization, device load, and network congestion.

[0126] The upgrade evaluation module is used to determine the upgrade order of each sub-device in the topology environment based on the device information of each sub-device and through a weighted algorithm.

[0127] The seamless upgrade module is used to sequentially issue upgrade services according to the upgrade order, enabling the downstream devices of the sub-device to roam to stable devices in the topology environment. After the downstream devices have completed roaming, the sub-device performs the upgrade; and the module obtains the upgrade status returned by the sub-device.

[0128] Preferably, the weighted algorithm in the upgrade evaluation process is as follows:

[0129] S total =S topology +S ram +S subClinet +S network

[0130] Among them, S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S ram The device memory utilization score is calculated based on the current raw size used by the device and the maximum raw size supported by the device; S flash The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S network The network congestion score is calculated based on packet loss rate, latency, and current bandwidth utilization.

[0131] Preferably, S topology The minimum cost path, MinCost, obtained from Dijkstra's algorithm is calculated using the following formula:

[0132]

[0133] Where, MinCost = Dijkstra(E 拓扑位置矩阵 E weight E weight Given the cost matrix, the formula for calculating the weight is:

[0134] Weight = BaseCost + i × RSSI penalty +j×Utilization penalty

[0135] BaseCost is determined based on the connection type. RSSI is the signal strength, Utilization is the channel utilization, and i and j are the weighting coefficients.

[0136] Preferably, during the seamless upgrade process, the roaming score of the surrounding devices of the sub-device to be upgraded is calculated based on the network environment and topology. A stable device is then determined based on the roaming score, and the downstream devices of the sub-device to be upgraded are roamed to the stable device in the topology environment. The roaming score is calculated using the following formula:

[0137] S roam =w1×S stability +w2×S topology +w3×S subClinet +w4×S signal

[0138] Among them, S stability The equipment stability score is calculated based on the ratio of online time to statistical time; S topologyTopology location score is calculated based on the minimum cost path from a specified AP to the Controller; S subClinet The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S signal The signal strength score is calculated based on RSSI; w1, w2, w3, and w4 are the weighting coefficients for each score.

[0139] Since the system described in Embodiment 2 of this invention is a system used to implement the method of Embodiment 1 of this invention, those skilled in the art can understand the specific structure and variations of this system based on the method described in Embodiment 1 of this invention, and therefore will not be repeated here. All systems used in the method of Embodiment 1 of this invention fall within the scope of protection of this invention.

[0140] Based on the same inventive concept, this application provides a storage medium corresponding to Embodiment 1, as detailed in Embodiment 3.

[0141] Example 3

[0142] This embodiment provides a computer-readable storage medium, such as... Figure 4 As shown, a computer program is stored thereon, which, when executed by a processor, can implement any of the embodiments in Example 1.

[0143] Since the computer-readable storage medium described in this embodiment is the same computer-readable storage medium used to implement the method in Embodiment 1 of this application, those skilled in the art can understand the specific implementation methods and various variations of the computer-readable storage medium in this embodiment based on the method described in Embodiment 1 of this application. Therefore, how this computer-readable storage medium implements the method in the embodiments of this application will not be described in detail here. Any computer-readable storage medium used by those skilled in the art to implement the method in the embodiments of this application falls within the scope of protection of this application.

[0144] The embodiments of the present invention have at least the following technical effects

[0145] 1. Dynamically determine upgrade priorities based on network topology and bandwidth to avoid network congestion, and proactively trigger roaming to avoid service interruption, significantly improving user experience.

[0146] 2. Utilize topology awareness and traffic analysis to accurately schedule user device roaming based on upgrade priorities, avoiding user-perceived interruptions.

[0147] 3. Intelligently adjust and upgrade strategies based on equipment capabilities and network conditions to reduce network load.

[0148] 4. By integrating multiple links to provide feedback on device upgrade status, unified status analysis and recording can be achieved; accurate reporting of device status ensures the reliability of upgrades.

[0149] 5. Determine the timing and strategy for upgrades based on device capabilities and network congestion, completing upgrades as quickly as possible while avoiding impacting user experience.

[0150] 6. During upgrades, implement a phased, throttling upgrade package delivery method that adapts to device capabilities to minimize the impact on the network.

[0151] 7. By recording breakpoint locations and using data aggregation mechanisms, resume transmission in weak network environments is achieved, forming an intelligent upgrade solution that is seamless and uninterrupted for users.

[0152] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0153] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0154] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0155] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0156] While specific embodiments of the present invention have been described above, those skilled in the art should understand that the specific embodiments described are merely illustrative and not intended to limit the scope of the present invention. Equivalent modifications and variations made by those skilled in the art in accordance with the spirit of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A method for seamless upgrades of network topology-aware edge devices, characterized in that, include: Device information acquisition process: Acquire device information for each sub-device, including the device's location in the network topology, device memory utilization, device load, and network congestion status; Upgrade evaluation process: Based on the device information of each sub-device, the upgrade order of each sub-device in the topology environment is determined by a weighted algorithm; Seamless upgrade process: Upgrade services are issued sequentially according to the upgrade order, enabling the downstream devices of the sub-device to roam to stable devices in the topology environment. After the downstream devices have completed roaming, the sub-device performs the upgrade; the upgrade status returned by the sub-device is obtained.

2. The method according to claim 1, characterized in that: The weighted algorithm in the upgrade evaluation process is as follows: S total =S topology +S ram +S subClinet +S network Among them, S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S ram The device memory utilization score is calculated based on the current raw size used by the device and the maximum raw size supported by the device; S flash The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S network The network congestion score is calculated based on packet loss rate, latency, and current bandwidth utilization.

3. The method according to claim 2, characterized in that: S topology The minimum cost path, MinCost, obtained from Dijkstra's algorithm is calculated using the following formula: s topology =MinCost / T 跳数 ×10 Where, MinCost = Dijkstra(E 拓扑位置矩阵 E weight E weight Given the cost matrix, the formula for calculating the weight is: Weight=BaseCost+i×RSSI penalty +j×Utilization penalty BaseCost is determined based on the connection type. RSSI is the signal strength, Utilization is the channel utilization, and i and j are the weighting coefficients.

4. The method according to claim 1, characterized in that: During the seamless upgrade process, the roaming score of the surrounding devices of the sub-device to be upgraded is calculated based on the network environment and topology. Stable devices are determined based on the roaming score, and then the downstream devices of the sub-device to be upgraded are roamed to the stable devices in the topology environment. The roaming score is calculated using the following formula: S roam =w1×S stability +w2×S topology +w3×S subClinet +w4×S signal Among them, S stability The equipment stability score is calculated based on the ratio of online time to statistical time; S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S subClinet The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S signal The signal strength score is calculated based on RSSI; w1, w2, w3, and w4 are the weighting coefficients for each score.

5. The method according to claim 1, characterized in that: The system uses multi-link fusion technology to monitor the upgrade status of devices on each link in real time, and uses a local fusion mechanism to make unified judgments, record and handle retry logic.

6. A network topology-aware edge device seamless upgrade system, characterized in that, include: The device information acquisition module is used to acquire device information for each sub-device, including the device's location in the network topology, device memory utilization, device load, and network congestion. The upgrade evaluation module is used to determine the upgrade order of each sub-device in the topology environment based on the device information of each sub-device and through a weighted algorithm. The seamless upgrade module is used to sequentially issue upgrade services according to the upgrade order, enabling the downstream devices of the sub-device to roam to stable devices in the topology environment. After the downstream devices have completed roaming, the sub-device performs the upgrade; and the module obtains the upgrade status returned by the sub-device.

7. The system according to claim 6, characterized in that: The weighted algorithm in the upgrade evaluation process is as follows: S total =S topology +S ram +S subClinet +S network Among them, S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S ram The device memory utilization score is calculated based on the current raw size used by the device and the maximum raw size supported by the device; S flash The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S network The network congestion score is calculated based on packet loss rate, latency, and current bandwidth utilization.

8. The system according to claim 7, characterized in that: S topology The minimum cost path, MinCost, obtained from Dijkstra's algorithm is calculated using the following formula: s topology =MinCost / T 跳数 ×10 Where, MinCost = Dijkstra(E 拓扑位置矩阵 E weight E weight Given the cost matrix, the formula for calculating the weight is: Weight=BaseCost+i×RSSI penalty +j×Utilization penalty BaseCost is determined based on the connection type. RSSI is the signal strength, Utilization is the channel utilization, and i and j are the weighting coefficients.

9. The system according to claim 6, characterized in that: During the seamless upgrade process, the roaming score of the surrounding devices of the sub-device to be upgraded is calculated based on the network environment and topology. Stable devices are determined based on the roaming score, and then the downstream devices of the sub-device to be upgraded are roamed to the stable devices in the topology environment. The roaming score is calculated using the following formula: S roam =w1×S stability +w2×S topology +w3×S subClinet +w4×S signal Among them, S stability The equipment stability score is calculated based on the ratio of online time to statistical time; S topology Topology location score is calculated based on the minimum cost path from a specified AP to the Controller; S subClinet The device load score is calculated based on the current number of connected devices and the maximum number of connected devices supported by the device; S signal The signal strength score is calculated based on RSSI; w1, w2, w3, and w4 are the weighting coefficients for each score.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the method as described in any one of claims 1 to 5.

Images