WIRELESS MULTI-UPLINK SELECTION FOR MLO MESH NET

Abstract

A method for optimizing the topology of a mesh network. The method includes determining the topology of the mesh network and the first access point (AP) to be added to the mesh network. The method further includes determining a multi-uplink group between the first AP and the second AP. The method further includes determining a first number of sibling APs and a second number of neighbor APs of the first AP by designating the second AP as the parent AP of the first AP. The method further includes determining a metric value for the multi-uplink group based on the first number of sibling APs and the second number of neighbor APs of the first AP. The method further includes adding the first AP to the mesh network according to the multi-uplink group, based on the finding that the metric value satisfies a predetermined condition.

Description

background Mesh Portal Points (MPPs) and Mesh Access Points (MAPs) are key components in a mesh network. The MPP acts as a gateway between the mesh network and external networks, such as the internet or a wired local area network (LAN). The MPP can be a root node in the mesh network, directly connected to the external network via Ethernet or another wired connection. The MAP is a node within the mesh network that facilitates wireless communication by extending network coverage and forwarding data packets. MAPs connect wirelessly to other MAPs and the MPP to form a self-organizing network. Multi-link operation (MLO) is a feature introduced in Wi-Fi 7. MLO allows a non-AP multi-link device (MLD) to discover, authenticate, associate, and establish multiple connections to an AP MLD. Once the MLD setup procedure is complete, each link facilitates channel access and frame exchange between the non-AP MLD and the AP MLD. Brief description of the drawings The embodiments of this disclosure are evident from the following detailed description when read together with the accompanying figures. As is common practice in the industry, the various features are not drawn to scale. Indeed, the dimensions of the various features may be arbitrarily increased or decreased for the clarity of the discussion. Some examples of this disclosure are described with reference to the following figures. Fig. 1 shows a sample environment in which sample implementations of this disclosure may be implemented; Fig. 2 shows a schematic diagram illustrating an example of multiple uplinks between two APs according to the implementations of this disclosure; Fig.Figure 3 shows a schematic diagram illustrating an example of a competition and interference model for a mesh network according to the implementations of the present disclosure; Figure 4 shows a schematic diagram illustrating an example of the effects of activating a new radio device of an AP on siblings and neighbors of the AP according to the implementations of the present disclosure; Figure 5 shows a schematic diagram illustrating an example of two stages for determining the uplinks of the APs according to the implementations of the present disclosure; Figure 6 shows a flowchart illustrating an exemplary initial-stage process for determining the uplinks of the APs according to the implementations of the present disclosure; Figure 7 shows a schematic diagram illustrating an example of the initial stage for determining the uplinks of the APs according to the implementations of the present disclosure; FigureFigure 8 shows a flowchart illustrating an example process of the online optimization phase for determining the uplinks of the APs according to the implementations of the present disclosure; Figure 9 shows a schematic diagram illustrating an example of the online optimization phase for determining the uplinks of the APs according to the implementations of the present disclosure; Figure 10 shows a flowchart illustrating an example process of optimizing the topology of a mesh network according to the implementations of the present disclosure; Figure 11 shows a flowchart illustrating another example of a process for optimizing the topology of a mesh network according to the implementations of the present disclosure; Figure 12 shows a diagram illustrating an example of an electrical device according to the descriptions of the present disclosure; and Figure 13 shows the process of optimizing the topology of a mesh network according to the implementations of the present disclosure.Figure 13 shows a diagram illustrating an example of an AP according to the implementations of the present disclosure. Detailed description In mesh networks, the selection and customization of wireless mesh links for each map area (MAP) is a crucial aspect. A well-optimized topology is essential for maximizing network capacity and ensuring overall efficiency. With the introduction of the latest Wi-Fi 7 standard, Multi-Link Optimization (MLO) functionality has significantly improved the throughput and capacity of MAPs. However, existing metrics and algorithms for mesh networks still focus on single-link scenarios and are therefore only suitable for older Wi-Fi standards. The multi-uplink scenario has not yet been addressed in the Wi-Fi 7 standard. A typical AP MLD, for example, has multiple links configured on different radios, each with its own parameters such as RSSI (Received Signal Strength Indicator), transmit power, channel utilization, traffic, and load. Conventional algorithms evaluate each uplink individually and select a single link from among the multiple links on multiple radios. However, a Mesh-AP MLD can maintain multiple uplinks simultaneously, representing a subset of all possible connections (e.g., 5GHz+6GHz or 2.4GHz+5GHz+6GHz, etc.). Furthermore, utilizing all links between two APs for data transmission may only marginally improve the transmission rate, but can have significant negative impacts on sibling and neighboring APs. Therefore, enabling all links between two APs can only achieve a locally optimal solution, not a globally optimal one. The scheme presented in this disclosure takes into account the MLO features and the impact of increasing uplinks on other APs. Specifically, a network management system (NMS) can create a mesh network topology using an incremental top-down algorithm. Assuming that some APs have been added to the mesh network topology, the NMS can obtain a first AP (e.g., the first AP can have three links including 2.4 GHz, 5 GHz, and 6 GHz) from the APs not added to the topology, and a second AP (e.g., the second AP can also have three links including 2.4 GHz, 5 GHz, and 6 GHz) from the existing APs in the topology. The NMS can determine a multi-uplink group (e.g., 2.4 GHz and 5 GHz) between the first AP and the second AP. This means that data can be transferred between the first AP and the second AP via the links in the multi-uplink group.The NMS can then determine the number of sibling APs and the number of neighboring APs of the first AP in the topology by treating the second AP as a parent AP of the first AP. The NMS can then determine a metric value for the candidate multi-uplink group based on the number of sibling APs and the number of neighboring APs of the first AP, where the metric value can indicate the capacity of the candidate multi-uplink group. If the metric value meets a predetermined condition, the NMS can include the first AP in the topology according to the candidate multi-uplink group. In this way, the mesh network can transmit data across multiple uplinks between access points (APs), thus improving the network's performance. Furthermore, competition between sibling APs and interference between neighboring APs can be reduced within the mesh network, further enhancing its overall performance. Figure 1 shows an example environment 100 in which example implementations of the present disclosure can be implemented. As shown in Figure 1, the environment 100 comprises a server 102 and a mesh network 104. The mesh network 104 includes an MPP 106 and APs 108-1, 108-2, 108-3, 108-4, 108-5, 108-6, and 108-7 (also collectively referred to as APs 108). The MPP 106 connects the mesh network 104 to external wired or wireless networks and enables devices within the mesh network 104 to communicate with the internet or other external resources. The APs 108 can extend the range of the wireless network by forwarding traffic between client devices and the MPP 106 or other APs in the mesh network 104. In environment 100, MPP 106 and APs 108 are AP MLDs. An AP MLD supports multiple simultaneous connections (e.g., 2.4 GHz, 5 GHz, and 6 GHz) for communication with client devices or other APs. This allows for the pooling of bandwidth and resources across multiple channels, resulting in higher throughput and improved performance. A Multi-Uplink Group (MULG) refers to the aggregation of multiple wireless uplink connections between APs that utilize multiple frequency bands or radios. The MULG allows an AP to maintain multiple active uplinks to another AP or MPP. These uplinks can work together to send and receive data, enabling higher aggregated throughput and increased reliability. In environment 100, MPP 106 and APs 108 can communicate with a network management system (NMS) 132 installed on server 102. MPP 106 and APs 108 can scan their radios to obtain information about these APs (e.g., radio capabilities and information about neighboring APs). MPP 106 and APs 108 can then report their scan results to NMS 132. In this way, NMS 132 receives information about all these APs from a global perspective. In environment 100, the NMS 132 can rebuild the topology of the mesh network 104 to optimize its performance after receiving information about the MPP 106 and the APs 108. The NMS 132 can create a new topology of the mesh network 104 using an incremental top-down algorithm. For example, as shown in Fig. 1, the NMS 132 created a topology 122. In topology 122, the MPP 106 is a root node in a tree structure. The APs 108-1, 108-2, and 108-3 are connected to the MPP 106. Therefore, MPP 106 is a parent AP of APs 108-1, 108-2, and 108-3, and APs 108-1, 108-2, and 108-3 are child APs of MPP 106. Traffic can be transferred to MPP 106 via uplinks from APs 108-1, 108-2, and 108-3. Furthermore, APs 108-4 and 108-5 are connected to AP 108-1. Therefore, AP 108-1 is a parent AP of APs 108-4 and 108-5, and APs 108-4 and 108-5 are child APs of AP 108-1.Traffic can be transferred via uplinks from APs 108-4 and 108-5 to AP 108-1. The next step is to add one of the APs 108-6 and 108-7 to topology 122 to form a new topology. In environment 100, AP 108-1 can include a radio 110 (e.g., 2.4 GHz), a radio 112 (e.g., 5 GHz), and a radio 114 (e.g., 6 GHz). AP 108-6 can include a radio 116 (e.g., 2.4 GHz), a radio 118 (e.g., 5 GHz), and a radio 120 (e.g., 6 GHz). If NMS 132 designates AP 108-1 as the parent AP of AP 108-6, there can be multiple candidate MULGs between AP 108-1 and AP 108-6. The MULG candidates can include a MULG with an uplink 124 from radio 116 to radio 110, a MULG with an uplink 126 from radio 118 to radio 112, a MULG with an uplink 128 from radio 120 to radio 114, a MULG with uplinks 124 and 126, a MULG with uplinks 124 and 128, a MULG with uplinks 126 and 128, and a MULG with uplinks 124, 126, and 128.If NMS 132 designates AP 108-1 as the superior AP of AP 108-7, there may also be further MULG candidates between AP 108-1 and AP 108-7. In environment 100, NMS 132 can select a MULG candidate, for example, MULG 130 with uplinks 124 and 126. NMS 132 can then determine sibling APs of AP 108-6 in topology 122 and determine neighbor APs of AP 108-6 in topology 122. In Fig. 1, APs 108-4, 108-5, and 108-6 share the same parent AP (i.e., AP 108-1). Therefore, the sibling APs of AP 108-6 in topology 122 can include APs 108-4 and 108-5. Furthermore, the neighbor APs of AP 108-6 in topology 122 can include APs 108-2 and 108-3. In environment 100, NMS 132 can determine a metric value for MULG 130 based on the number of sibling APs of AP 108-6 and the number of neighboring APs of AP 108-6. The metric value for a MULG can indicate the capacity of the MULG. The capacity of the MULG refers to the combined ability of all connections within the group to transfer data. The capacity of the MULG can, for example, be the data rate of the MULG. After receiving the metric value for MULG 130, NMS 132 can determine whether the metric value satisfies a predetermined condition. In some implementations, NMS 132 can generate a new topology by adding AP 108-6 to topology 122 according to MULG 130 and determine a comprehensive metric value for the new topology based on the metric value for MULG 130. The comprehensive metric value for the new topology can indicate an overall capacity of the new topology. In some implementations, the predetermined condition can be that the comprehensive metric value for the new topology is the largest value among a set of comprehensive metric values ​​determined for all MULG candidates. In some implementations, the predetermined condition can be that the comprehensive metric value for the new topology meets a predetermined threshold. If NMS 132 determines that the metric value for MULG 130 meets the predefined condition, NMS 132 can add AP 108-6 to topology 122 and activate uplinks 124 and 126 according to MULG 130. If the metric value for MULG 130 does not meet the predefined condition, NMS 132 can add AP 108-6 or AP 108-7 according to another MULG. In this way, the mesh network 104 can transmit data across multiple uplinks between the access points (APs), thereby improving the performance of the mesh network 104. Furthermore, within the established mesh network 104, competition between sibling APs and interference between neighboring APs can be reduced. This further enhances the performance of the mesh network 104. In some implementations, the NMS can calculate metric values ​​for the MULGs based on a metric determination algorithm. This algorithm considers both the parameters of the access network operator's radios and the competition and interference between the various mesh nodes. A link reduction coefficient can be introduced to quantify the reduction effects caused by interference and competition. A comprehensive metric value can then be defined for an AP, representing the AP's actual capacity within the entire network topology. This metric determination algorithm can improve the accuracy of mesh node capacity in the MLD mesh network. This improved assessment can provide valuable insights for optimizing the entire mesh network, thereby improving its overall performance and efficiency. Figure 2 shows a schematic diagram illustrating Example 200 for multiple uplinks between two APs according to the implementations of the present disclosure. As shown in Figure 2, Example 200 comprises an MPP 202 and an AP 204, where MPP 202 and AP 204 are MLDs. MPP 202 and AP 204 can have multiple radios operating on multiple radio frequency bands. According to the Wi-Fi 7 standards, an MLD mesh point can simultaneously establish uplinks over all of its available radios, thus forming a MULG. As shown in Figure 2, MPP 202 and AP 204 can have three different radios operating on corresponding bands (e.g., 2.4 GHz, 5 GHz, and 6 GHz). At most three connections, e.g., connections 206, 208, and 210, can be established over these radios. For example, a 3-link MULG 212 can be formed between the MPP 202 and the AP 204. The capacitance CΣ of a MULG can be determined by calculating the sum of the capacitances of the individual links Lian to the radios, where link Li belongs to the MULG and i denotes an index of the link. The capacitance CΣ of the MULG can be calculated according to equation (1) as follows: In Fig. 2, for example, the capacity of connection 206, the capacity of connection 208, and the capacity of connection 210 can be determined. Then, the capacity of MULG 212 can be determined by calculating the sum of the capacities of connection 206, connection 208, and connection 210. Ideally, the Cider Link Li capacity can achieve a theoretical maximum data rate in the absence of interference. The theoretical maximum data rate can be determined based on the RF parameters of the radio and a negotiated highest modulation and coding scheme (MCS). The negotiated highest MCS index can be determined based on a bandwidth, a number of spatial currents (NSS), and the capabilities of the link Li. The actual capacity of the Cider Link Li can be estimated by equation (2) as follows: Where Ridie denotes the theoretical maximum data rate of the link Limit for a given bandwidth, NSS, and link capabilities Li. Furthermore, a function γ denotes a function configured to determine the theoretical maximum data rate based on a bandwidth, NSS, and capabilities. Additionally, a link reduction coefficient fie denotes a capacity reduction of Li caused by competition and interference. In Fig. 2, for example, the theoretical maximum data rates for links 206, 208, and 210 can be determined based on their bandwidths, NSS, and capabilities. Furthermore, corresponding link reduction coefficients can be determined for links 206, 208, and 210. Then, the capacities of links 206, 208, and 210 can be calculated based on these theoretical maximum data rates and link reduction coefficients. Taking competition and interference into account, the actual link capacity decreases accordingly. In a mesh node, sibling nodes can share the upstream capacity of the parent node. Furthermore, neighboring nodes can cause channel interference, which further reduces the actual data rates. Figure 3 shows a schematic diagram illustrating an example 300 of a competition and interference model for a mesh network according to the implementations of this disclosure. As shown in Fig. 3, Example 300 includes an AP 302. The AP 302 can be connected to a higher-level AP 304 via a link 314. Furthermore, in Example 300, APs 306 and 308 are also connected to the higher-level AP 304 and are siblings of AP 302 on a radio link corresponding to link 314. Additionally, in Example 300, APs 310, 312, and 314 are neighbors of AP 302 on the radio link corresponding to link 314. As described above, the link reduction coefficient fi can denote the reduction in link capacity Li caused by competition and interference. This link reduction coefficient can indicate a proportion of media resources that an AP can obtain relative to its siblings and neighbors. In some implementations, a competition reduction coefficient Pi can be determined based on the number of siblings of the AP. The competition reduction coefficient Pi can indicate a reduction in the actual capacity of link Li caused by competition between the AP and its siblings. In some implementations, an interference reduction coefficient Ti can be determined based on the number of neighbors of the AP.The interference reduction coefficient Ti can indicate a reduction in the actual capacity of the link Li caused by interference between the AP and its neighbors. Therefore, the link reduction coefficient fi can be determined based on the competition reduction coefficient Pi and the interference reduction coefficient Ti. The link reduction coefficient fi can be calculated, for example, using equation (3) as shown below. Here, NS denotes the number of siblings of the AP on the same radio corresponding to the link client, NR denotes the number of neighbors of the AP on the same radio besides its siblings, α and β are weighting factors representing the influence of the siblings and neighbors on this radio, respectively, and φi(NS, NR) denotes a function mapping the number of siblings and the number of neighbors to the link reduction coefficient f. Furthermore, in equation (3), can denote the competition reduction coefficient Pi and the interference reduction coefficient Ti. Then the actual capacity of each individual link can be rewritten in equation (4): For an AP with multiple uplinks, the actual capacity of its MULG can be rewritten as equation (5) as follows: Taking into account the loss and reduction effects along a multi-hop path, an end-to-end metric value for the AP can be determined based on the number of hops from the MPP (i.e., the root node) to the AP and a per-hop reduction factor. The end-to-end metric value for the AP can indicate the capacity that the AP can ultimately achieve from the MPP via its multi-hop connection. For example, the end-to-end metric value MAP for the AP can be calculated using equation (6): Here, λ(0 < λ < 1) denotes the reduction factor per hop and h the number of hops from MPP to AP. For a single AP, adding more radios to its MULG can increase its overall metric value, since the total capacity is the aggregated sum of the capacities of each individual link. However, enabling an additional uplink on a radio of one AP can affect the link reduction coefficients of other APs using the same radio. Figure 4 shows a schematic diagram illustrating Example 400 of the effects of enabling a new radio of one access device on siblings and neighbors of the access device according to the implementations of this disclosure. As shown in Fig. 4, an AP 402 is a parent of an APj. The APj can be connected to the AP 402 via a link 404 on a radio (e.g., 2.4 GHz). Furthermore, an APk can be a neighbor of the APj on the same radio via link 404. If, in Example 400, a new link 406 is activated from an APj to the AP 402 on the same radio, both the number of siblings Nsj of the APj and the number of neighbors NRk of the APk can be increased, leading to a decrease in the link reduction coefficients fjund fk for both the APj and the APk. The link reduction coefficients fjund fk can be represented by equation (7) as follows: Here, NRj represents the number of neighbors of APjund and Nsk represents the number of siblings of APk. Therefore, increasing the metric value for one AP by activating additional radios can lead to a decrease in the metric value for another AP, due to the introduction of competition and interference. Figure 5 shows a schematic diagram illustrating a two-stage Example 500 for determining AP uplinks according to the implementations of this disclosure. As shown in Figure 5, Example 500 comprises an initial stage 502 and an online optimization stage. In the initial stage 502, the APs are not connected to an NMS (e.g., NMS 134 in Figure 1) when they are powered on. Therefore, each AP can select a locally optimal MULG from the perspective of an individual AP. In some implementations, the AP in the initial stage 502 may use a constrained greedy algorithm to select uplinks to a parent AP from available uplinks. The constrained greedy algorithm may use a ratio threshold associated with the uplink capacities to limit whether an AP uplink should be activated.The mesh network can then be configured based on the uplinks selected by the access points (APs). This prevents lower-value uplinks from being activated, thereby reducing competition and interference on the relevant bands and improving the overall performance of the mesh network. After the mesh network is set up, the access points (APs) can communicate with the network management system (NMS) during the online optimization phase 504. This allows the NMS to gather information about the APs in the mesh network. The NMS can then optimize the mesh network topology from a global perspective based on this AP information. During the online optimization phase 504, the NMS can create an optimized mesh network topology using an incremental top-down algorithm. Therefore, when the NMS adds a new AP to an existing topology, it can determine the number of siblings and neighbors of the AP. Based on this information, the number of siblings, and the number of neighbors, the NMS can then decide whether to add the new AP to the topology and which uplinks to enable.In this way, a globally optimized topology of the mesh network can be determined, which can improve the performance of the mesh network. Figure 6 shows a flowchart illustrating an example initial-stage process 600 for determining the uplinks of the APs according to the implementations of this disclosure. Process 600 can be implemented by an AP. As shown in Figure 6, in block 602, the AP can scan its radios to obtain the capabilities of the radios, siblings on those radios, and neighbors on those radios. Furthermore, in the initial stage, the AP is not yet connected to a parent AP. Therefore, the AP can retrieve a list of eligible parent APs in the mesh network. In block 604, the AP can select an initial parent AP and a primary uplink radio. Based on the scan results, the ZB can evaluate the metric values ​​for individual uplinks with each parent AP candidate on all of its radios. For example, if the AP has three radios and two parent AP candidates, six metric values ​​for six individual uplinks can be evaluated. The AP can then designate the individual uplink with the highest metric value as the primary uplink and designate the parent AP corresponding to the primary uplink as the initial parent AP. The metric value M'i,n for the primary uplink Li,n can be represented by equation (8) as below: Here, Ci,n denotes the capacity of the main uplink, Li,n, i the index of the radio of the main uplink, Li,n, n the index of the original parent AP, and hn the number of hops of the original parent AP. In block 606, the accessee can select additional uplinks using the constrained greedy algorithm. As described above, adding more uplinks to a MULG can increase the metric value for one AP, but decrease the metric value for another AP due to competition and interference. Considering the benefits of adding uplinks and the reduced impact on other APs, the constrained greedy algorithm can be used to add additional uplinks to the MULG in the initial phase, including the main uplink. After the initial parent AP and the main uplink Li,n are determined, the AP can evaluate the capacity Cj, of the remaining link Lj,n, where j ≠ i. The AP can determine whether the capacity Cj, of link Lj,n and the capacity Ci, of the main uplink Li,n satisfy a predetermined condition. If the AP determines that the capacity Cj,n and the capacity Ci,n satisfy the predetermined condition, the AP can activate link Lj,n in the mesh topology by adding link Lj,n to the MULG including the main uplink Li,n. In some implementations, the AP can determine a ratio of the capacity Cj,n to the capacity Ci, of the main uplink Li,n. If the ratio is greater than a predetermined ratio threshold ΔC, the AP can determine that the capacity Cj,n and the capacity Ci,n satisfy the predetermined condition. The condition can be represented by equation (9) as below: This allows the additional uplinks with acceptable quality to be activated in the mesh network, while unsuitable uplinks are filtered out. The "Constrained Greedy" algorithm can prevent the unlimited use of a particular channel, which could lead to congestion and negatively impact the performance of other access points operating on the same channel. This improves the overall performance of the mesh network. Figure 7 shows a schematic diagram illustrating an Example 700 of the initial phase for determining the uplinks of the APs according to the implementations of the present disclosure. As shown in Figure 7, the Example 700 comprises APs 702, 704, and 706, each AP having three radios. AP 702 must determine the uplinks to be activated in the initial phase. AP 702 can determine that APs 704 and 706 are candidates to become parent APs. Then, AP 702 can scan each radio to obtain the capabilities of the radio, the sibling APs on that radio, and the neighboring APs on that radio. As shown in Fig. 7, in Example 700 there are three uplinks 708, 710, and 712 from AP 702 to the parent candidate AP 704, and three uplinks 714, 716, and 718 from AP 702 to the parent candidate AP 706. AP 702 can calculate the capacities of the six uplinks based on their capabilities, the number of siblings, and the number of neighbors. For example, the capacity of uplink 712 might be the largest of the six capacities. Therefore, AP 702 can select uplink 712 as the primary uplink according to Equation (8). Since uplink 712 is selected as the primary uplink, AP 704 can be designated as the initial parent AP. AP 702 can then determine whether to activate additional uplinks between AP 702 and AP 704. AP 704 can compare the capacity of uplink 708 with the capacity of uplink 712. If the capacity of uplink 708 and the capacity of uplink 712 satisfy equation (9), AP 702 can activate uplink 708 during the initial phase. Furthermore, AP 702 can also compare the capacity of uplink 710 with the capacity of uplink 712. If the capacity of uplink 710 and the capacity of uplink 712 satisfy equation (9), AP 702 can also activate uplink 710 during the initial phase. This allows the primary uplink with the highest capacity to be activated in the mesh network set up in the initial phase. Additionally, the other high-capacity uplinks can be activated, while the low-capacity uplinks can be filtered out. This reduces competition and interference between access points and improves the performance of the mesh network. After the initial phase is complete, the uplinks for each AP are bootstrapped to achieve a starting state with good capacity while avoiding excessive competition and interference with other nodes. However, the yaw strategy per AP in the initial phase cannot guarantee a globally optimized topology for the network as a whole, since an AP does not consider the capacity of other nodes. Once each AP has established uplinks and connected to its parent node in the initial phase, it also connects to the NMS and reports its scan results. The NMS can then collect information from all APs, providing a global overview of the network. During the online optimization phase, a total sum of the metric values ​​for all APs in a topology can be calculated as an overall metric value for the topology. This overall metric value can indicate the overall capacity of the topology. The overall metric value MΣ for a topology can be calculated according to equation (10) as follows: Here, APk denotes an AP with an index k, hk the hop count from the MPP to the APkMAPk, a capacity of the APk, and MULGk the multi-uplink group for the .APk. It should be noted that in equation (10) the MPP, which is directly connected to the backbone network via Ethernet, can be omitted because its capacity is fixed and only relates to an Ethernet uplink. According to equation (10), finding the largest value of the total metric value MΣ is a complex optimization problem with a large solution space, since each AP with potential parent nodes can be connected to different combinations of MULGs. The NMS can use an intuitive, incremental, top-down algorithm to search for improved metric values. For example, a topology might contain Tnn nodes. The NMS can determine how to insert a candidate APn+1 into this topology by selecting the optimal parent and uplinks to form a larger Tn+1 topology. Using this incremental strategy, the topology of the entire network can be built step by step. With this top-down approach, APs with fewer hops compared to leaf nodes can have higher priorities for achieving optimized capacity. This mirrors the tree-like structure of a mesh network, where APs with fewer hops require higher capacity to efficiently transfer data downwards. Figure 8 shows a flowchart illustrating an example process 800 of the online optimization phase for determining the uplinks of the APs according to the implementations of this disclosure. Example process 800 can be implemented by a NMS. In process 800, the NMS can select, for a given topology, a tuple consisting of a parent AP, a child AP, and a multi-linked loop (MULG) between the parent and child APs. The parent AP is part of the given topology, while the child AP is outside of it. Compared to other possible tuples, the selected tuple maximizes the metric value for the extended topology with n+1 nodes. In block 802, the NMS can enumerate all candidate tuples. For each AP belonging to a current topology, every possible subordinate AP located outside the current topology must be considered. The NMS can determine all potential MULGs between the two APs, encompassing all possible combinations of their available radios. In block 804, the NMS can calculate the overall metric values ​​for new topologies with candidate tuples. For a candidate tuple, the NMS can construct a new topology with n+1 nodes, where the child AP can be connected to the parent AP via the MULG in the candidate tuple. The overall metric value for the new topology can be calculated according to equation (10). In block 806, the NMS can select an optimal tuple and add the child AP within that tuple to the topology. By calculating the total metric value for each candidate tuple, the NMS can select the tuple with the highest total metric value as the optimal tuple. By repeating process 800, all APs can be added to the topology sequentially, resulting in an optimized mesh network topology. In this way, the NMS can manage the entire mesh network from a global perspective. By using the incremental top-down algorithm, optimal uplinks can be identified, thereby improving the overall performance of the network. Figure 9 shows a schematic diagram illustrating Example 900 of the online optimization phase for determining the uplinks of the APs according to the implementations of the present disclosure. As shown in Figure 9, Example 900 includes an MPP, an APm, an APl, an APn, an APp, and an APq. The NMS can determine a current topology T of the mesh network, where the topology Tn already includes the MPP, the APm, the APp, and the APq. The NMS can evaluate all possible child APs for it, such as the APp and the APq. Subsequently, the NMS can determine all potential MULGs, including a MULGn, p, i, where the MULGn, p, i denotes a MULG between the parent APn and the child APp, and i denotes an index of a particular combination of multiple uplinks. In Example 900, the NMS can determine a tuple (APn,APp,MULGn,p,i) and then construct a new topology containing n+1 nodes based on the tuple (APn,APp,MULGn,p,i), where the child APp can be connected to the parent APn via MULGn,p,i. The total metric value for the new topology Tn+1, including the n+1 nodes, can be calculated using equation (10). Other nodes are excluded and ignored, including the calculation of the number of siblings and the number of neighbors of the n+1 nodes. In example 900, the tuple (APn,APp,MULGn,p,i) can have the largest total metric value. In that case, APp can be added to the current topology Tn, but APq cannot be added to topology Tn. Therefore, a larger topology Tn+1 can be created. Figure 10 shows a flowchart illustrating an example process 1000 for optimizing a mesh network topology according to the implementations of this disclosure. Process 1000 can be implemented by an electrical device (e.g., a server) or by an NMS deployed on the electrical device. As shown in Figure 10, in block 1002, the NMS can determine a mesh network topology and a first AP to be added to the mesh network, wherein the topology includes a second AP, and the first and second APs are multi-link devices. In block 1004, the NMS can determine a multi-uplink group between the first AP and the second AP, wherein the multi-uplink group includes one or more uplinks from the first AP to the second AP.In block 1006, the NMS can determine an initial number of sibling APs of the first AP in the topology and a second number of neighboring APs of the first AP in the topology by designating the second AP as a parent AP of the first AP. In block 1008, the NMS can determine a metric value for the multi-uplink group based on the initial number of sibling APs and the second number of neighboring APs of the first AP, where the metric value indicates the capacity of the multi-uplink group. In block 1010, based on the determination that the metric value meets a predetermined condition, the NMS can insert the first AP into the mesh network according to the multi-uplink group. In this way, the mesh network can transmit data across multiple uplinks between access points (APs), thereby improving the mesh network's performance. Furthermore, within the established mesh network, competition between sibling APs and interference between neighboring APs can be reduced, further enhancing the mesh network's performance. Figure 11 shows a flowchart illustrating another example process 1100 for optimizing a mesh network topology according to the implementations of this disclosure. Process 1100 can be implemented by an access point (AP). As shown in Figure 11, in block 1102, a first AP can obtain a first number of sibling APs and a second number of neighbor APs by scanning on a radio of the first AP, where the first AP is a multi-link device. In block 1104, the first AP can determine an uplink from the first AP to a second AP on the radio. In block 1106, the first AP can determine a metric value for the uplink based on the first number of sibling APs and the second number of neighbor APs, where the metric value indicates an uplink capacity.In block 1108, the first AP can, based on the determination that the metric value meets a predetermined condition, enable the upstream connection for data transmission in a mesh network. This allows the mesh network to transmit data across multiple uplinks between access points (APs), thereby improving the mesh network's performance. Furthermore, it reduces competition and interference between APs, thus enhancing the overall performance of the mesh network. Fig. 12 shows a diagram illustrating an example of an electrical device 1200 according to the implementations of the present disclosure. As shown in Fig. 12, the electrical device 1200 comprises at least one processor 1210 and a memory 1220 connected to the at least one processor 1210. The memory 1220 stores instructions 1221, 1222, 1223, and 1224 to cause the processor 1210 to perform actions according to the example implementations of the present disclosure. As shown in Fig. 12, memory 1220 stores instructions 1221 to determine a mesh network topology and a first AP to be added to the mesh network, wherein the topology includes a second AP and the first and second APs are multi-link devices. Memory 1220 further stores instructions 1222 to determine a multi-uplink group between the first AP and the second AP, wherein the multi-uplink group includes one or more uplinks from the first AP to the second AP. Memory 1220 further stores instructions 1223 to determine a first number of sibling APs of the first AP in the topology and a second number of neighbor APs of the first AP in the topology by designating the second AP as a parent AP of the first AP.Memory 1220 further stores instructions 1224 to determine a metric value for the multi-uplink group based on the first number of sibling APs and the second number of neighboring APs of the first AP, where the metric value indicates a capacity of the multi-uplink group. Memory 1220 further stores instructions 1225 to add the first AP to the mesh network according to the multi-uplink group, based on the finding that the metric value satisfies a predetermined condition. The stored commands and the functions that the commands can execute can be understood with reference to the implementations described above. For the sake of brevity, the details of commands 1221, 1222, 1223, 1224, and 1225 will not be discussed here. Fig. 13 shows a diagram illustrating an example AP 1300 according to the implementations of this disclosure. As shown in Fig. 13, the AP 1300 comprises at least one processor 1310, a memory 1320 connected to the at least one processor 1310, at least one antenna 1330, at least one radio 1340, an Ethernet interface 1350, a management interface 1360, and a power supply interface 1370. The memory 1320 stores instructions 1321, 1322, 1323, and 1324 to cause the processor 1310 to perform actions according to example implementations of this disclosure. As shown in Fig. 13, memory 1320 stores instructions 1321 to obtain a first number of sibling APs of the first AP and a second number of neighboring APs of the first AP by sampling a radio of the first AP, where the first AP is a multi-link device. Memory 1320 further stores instructions 1322 to determine an uplink from the first AP to a second AP on the radio. Memory 1320 also stores instructions 1323 to determine a metric value for the uplink based on the first number of sibling APs and the second number of neighboring APs, the metric value indicating the uplink capacity. Memory 1320 further stores instructions 1324 to enable the uplink for data transmission in a mesh network based on the finding that the metric value satisfies a predetermined condition. The stored commands and the functions that the commands can execute can be understood with reference to the implementations described above. For the sake of brevity, the details of commands 1321, 1322, 1323, and 1324 will not be discussed here. The at least one 1330 antenna in the AP 1300 is a crucial component that enables the AP 1300 to communicate with wireless devices such as laptops, smartphones, and tablets. The primary function of the at least one 1330 antenna is to transmit and receive wireless signals by converting electrical signals into radio waves for outgoing communication and vice versa for incoming signals. The at least one 1340 radio unit in the AP 1300 is responsible for wireless communication. This unit can convert data between wired and wireless formats, enabling the AP 1300 to send and receive data wirelessly. In a modulation process, the digital data from the wired network is converted into radio waves for wireless transmission. In a demodulation process, the incoming radio waves are converted back into digital data that the AP 1300 can process. The at least one 1340 radio unit can operate on specific frequency bands, such as 2.4 GHz, 5 GHz, or 6 GHz. The at least one 1340 radio unit ensures effective communication by selecting appropriate channels to minimize interference. The performance of the at least one 1340 radio unit can be defined by various Wi-Fi standards, including 802.11a / b / g / n / ac / ax, with newer standards such as Wi-Fi 6 and Wi-Fi 7 offering improved speed, efficiency and capacity. The Ethernet 1350 interface on the AP 1300 can be used to connect the AP 1300 to the local network and bridge the gap between the wired and wireless segments of the network. The AP 1300 can be connected to routers, switches, or directly to the internet via the Ethernet 1350 interface, allowing wireless devices to communicate with other network resources and the wider internet. The Ethernet interface supports various speeds, including Fast Ethernet (e.g., 100 Mbps), Gigabit Ethernet (e.g., 1 Gbps), and even Multi-Gigabit Ethernet. The AP 1300's Management Interface 1360 allows network administrators to configure, monitor, and manage the AP 1300's settings and performance. The Management Interface 1360 can be accessed through various methods, such as a web browser, a command-line interface (CLI), or network management protocols like Simple Network Management Protocol (SNMP). Through the Management Interface 1360, administrators can configure and modify SSIDs, security protocols, VLANs, and other operational parameters to ensure the AP 1300 functions effectively within the network environment. The 1370 power supply interface in the AP 1300 provides the device with the necessary electrical power, ensuring smooth and efficient operation. This can be achieved via direct power supply using a power adapter plugged into a wall outlet or via Power over Ethernet (PoE), where power is supplied through the same Ethernet cable used for data transmission. Program code or instructions for carrying out the procedures of this disclosure may be written in any combination of one or more programming languages. These program codes or instructions may be made available to a processor or controller of a general-purpose computer, a specialized computer, or any other programmable data processing device, such that when executed by the processor or controller, the program codes perform the functions / operations specified in the flowcharts and / or block diagrams. The program code or instructions may be executed entirely on one machine, partially on the machine, as a standalone software package, partially on the machine and partially on a remote machine, or entirely on the remote machine or server. In the context of this disclosure, a machine-readable medium can be any tangible medium capable of containing or storing a program for use by or in conjunction with a command-executing system, apparatus, or device. The machine-readable medium can be a machine-readable signaling medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or apparatus, or any suitable combination thereof.More specific examples of a machine-readable storage medium would be an electrical connection with one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. Even though the processes are presented in a specific order, this does not mean that these processes must be executed in the presented order or sequentially, or that all presented processes must be executed to achieve the desired results. Multitasking and parallel processing can be advantageous under certain circumstances. Certain features described in connection with separate implementations can also be implemented in combination within a single implementation. Conversely, various features described in connection with a single implementation can also be implemented separately in multiple implementations or in any suitable subcombination. The preceding detailed description of this disclosure refers to the accompanying drawings, which form part of this disclosure and illustrate how examples of the disclosure can be carried out. These examples are described in sufficient detail to enable those skilled in the art to put the examples of this disclosure into practice, and it is understood that other examples may be used and that process, electrical, and / or structural modifications may be made without departing from the scope of this disclosure.

Claims

A method comprising: determining a mesh network topology and a first access point (AP) to be added to the mesh network, wherein the topology includes a second AP, and the first AP and the second AP are multi-link devices; determining a multi-uplink group between the first AP and the second AP, wherein the multi-uplink group includes one or more uplinks from the first AP to the second AP; determining a first number of sibling APs of the first AP in the topology and a second number of neighbor APs of the first AP in the topology by designating the second AP as a parent AP of the first AP; determining a metric value for the multi-uplink group based on the first number of sibling APs and the second number of neighbor APs of the first AP, wherein the metric value indicates a capacity of the multi-uplink group;and adding the first AP to the mesh network according to the multi-uplink group, based on the finding that the metric value meets a predetermined condition. The method of claim 1, wherein the topology is a first topology and the determination that the metric value satisfies the predetermined condition comprises: generating a second topology by adding the first AP to the first topology according to the multi-uplink group; determining a comprehensive metric value for the second topology based on the metric value for the multi-uplink group, wherein the comprehensive metric value represents a total capacity of the second topology; and determining that the metric value satisfies the predetermined condition by establishing that the comprehensive metric value for the second topology satisfies the predetermined condition. The method of claim 2, wherein the multi-uplink group is a first multi-uplink group, the comprehensive metric value is a first comprehensive metric value, and the determination that the comprehensive metric value for the second topology satisfies the predetermined condition, comprises: generating a plurality of candidate topologies based on a plurality of candidate multi-uplink groups, wherein the plurality of candidate multi-uplink groups includes the first multi-uplink group and the plurality of candidate topologies includes the second topology; determining a plurality of comprehensive metric values ​​for the plurality of candidate topologies, wherein the plurality of comprehensive metric values ​​includes the first comprehensive metric value; and determining that the first comprehensive metric value for the second topology satisfies the predetermined condition by determining that the first comprehensive metric value is a largest value of the plurality of comprehensive metric values. The method of claim 1, wherein the multi-uplink group comprises a first uplink and the determination of the metric value for the multi-uplink group based on the first number of sibling APs and the second number of neighbor APs of the first AP comprises: determining a maximum data rate for the first uplink; determining a reduction coefficient based on the first number of sibling APs and the second number of neighbor APs of the first AP; determining an actual capacity of the first uplink based on the maximum data rate and the reduction coefficient; and determining the metric value for the multi-uplink group based on the actual capacity of the first uplink. The method of claim 4, wherein determining the reduction coefficient based on the first number of sibling APs and the second number of neighbor APs of the first AP comprises: determining a first coefficient based on the first number of sibling APs of the first AP, wherein the first coefficient indicates a first reduction in the actual capacity of the first uplink caused by competition between the first AP and the sibling APs of the first AP; determining a second coefficient based on the second number of neighbor APs of the first AP, wherein the second coefficient indicates a second reduction in the actual capacity of the first uplink caused by interference between the first AP and the neighbor APs of the first AP; and determining the reduction coefficient based on the first coefficient and the second coefficient. The method of claim 4, wherein the actual capacity of the first uplink is a first actual capacity, the multi-uplink group further comprises a second uplink, and determining the metric value for the multi-uplink group based on the actual capacity of the first uplink comprises: determining a second actual capacity of the second uplink; determining an actual total capacity for the multi-link group based on the first actual capacity and the second actual capacity; and determining the metric value of the multi-uplink group based on the actual total capacity. The method of claim 6, wherein determining the metric value of the multi-uplink group based on the actual total capacity comprises: determining the number of hops from the first AP to a root AP of the mesh network; determining a reduction factor per hop; and determining the metric value of the multi-uplink group based on the actual total capacity, the number of hops, and the per-hop reduction factor. The method of claim 4, wherein the determination of the maximum data rate of the first uplink comprises: determining a bandwidth, a number of spatial streams and a capability of the first uplink; and determining the maximum data rate of the first uplink based on the bandwidth, the number of spatial streams and the capability of the first uplink. A method comprising: Obtaining, by a first access point (AP), a first number of sibling APs of the first AP and a second number of neighbor APs of the first AP by scanning on a radio of the first AP, wherein the first AP is a multi-link device; Determining an uplink from the first AP to a second AP via the radio by the first AP; Determining, by the first AP, an uplink metric value based on the first number of sibling APs and the second number of neighbor APs, wherein the metric value indicates an uplink capacity; and enabling the uplink for data transmission in a mesh network by the first AP and based on the determination that the metric value satisfies a predetermined condition. The method of claim 9, wherein the uplink is a first uplink, the metric value is a first metric value, and the determination that the metric value satisfies the predetermined condition comprises: determining a plurality of candidate uplinks connected to a plurality of candidate parent APs of the first AP, wherein the plurality of candidate uplinks includes the first uplink; determining a plurality of metric values ​​for the plurality of candidate uplinks; and determining that the first metric value satisfies the predetermined condition by determining that the first metric value is a largest value in the plurality of metric values. The method of claim 9, wherein the uplink is a first uplink, the metric value for the first uplink is a first metric value, the predetermined condition is a first predetermined condition, and the method further comprises: determining a second uplink from the first AP to the second AP after activating the first uplink; determining a second metric value for the second uplink; and verifying that the first metric value and the second metric value satisfy a second predetermined condition; and enabling the second uplink for data transmission in the mesh network. The method of claim 11, wherein the determination that the first metric value and the second metric value satisfy the predetermined condition comprises: determining a ratio between the second metric value and the first metric value; and establishing that the first metric value and the second metric value satisfy the predetermined condition by determining that the ratio is greater than a predetermined ratio threshold. The method of claim 9, wherein determining the metric value for the uplink based on the first number of sibling APs and the second number of neighbor APs comprises: determining a maximum data rate for the uplink; determining a reduction coefficient based on the first number of sibling APs and the second number of neighbor APs of the first AP; determining an actual capacity of the uplink based on the maximum data rate and the reduction coefficient; and determining the metric value for the uplink based on the actual capacity of the first uplink. The method of claim 13, wherein determining the reduction coefficient based on the first number of sibling APs and the second number of neighboring APs of the first AP comprises: determining a first coefficient based on the first number of sibling APs of the first AP, wherein the first coefficient indicates a first reduction in the actual capacity of the uplink caused by competition between the first AP and the sibling APs of the first AP; determining a second coefficient based on the second number of neighboring APs of the first AP, wherein the second coefficient indicates a second reduction in the actual capacity of the uplink caused by interference between the first AP and the neighboring APs of the first AP; and determining the reduction coefficient based on the first coefficient and the second coefficient. The method of claim 13, wherein the determination of the metric value for the uplink based on the actual capacity of the first uplink comprises: determining the number of hops from the first AP to a root AP of the mesh network; determining a per-hop reduction factor; and determining the uplink metric value based on the actual capacity, the number of hops, and the per-hop reduction factor. Electrical device comprising: at least one processor; and a memory connected to the at least one processor, wherein the memory stores instructions to cause the at least one processor to: determine a topology of a mesh network and a first access point (AP) to be added to the mesh network, wherein the topology includes a second AP and the first AP and the second AP are multi-link devices; determine a multi-uplink group between the first AP and the second AP, wherein the multi-uplink group includes one or more uplinks from the first AP to the second AP; determine a first number of sibling APs of the first AP in the topology and a second number of neighbor APs of the first AP in the topology by designating the second AP as the parent AP of the first AP;Determining a metric value for the multi-uplink group based on the first number of sibling APs and the second number of neighboring APs of the first AP, where the metric value indicates a capacity of the multi-uplink group; and, based on the finding that the metric value satisfies a predetermined condition, adding the first AP to the mesh network according to the multi-uplink group. Electrical device according to claim 16, wherein the topology is a first topology and the instructions that cause the at least one processor to determine that the metric value satisfies the predetermined condition further cause the at least one processor to: generate a second topology by adding the first AP to the first topology according to the multi-uplink group; determine a comprehensive metric value for the second topology based on the metric value for the multi-uplink group, wherein the comprehensive metric value specifies a total capacity of the second topology; and determine that the metric value satisfies the predetermined condition by determining that the comprehensive metric value for the second topology satisfies the predetermined condition. Electrical device according to claim 17, wherein the multi-uplink group is a first multi-uplink group, the comprehensive metric value is a first comprehensive metric value, and the instructions that cause the at least one processor to determine that the comprehensive metric value for the second topology satisfies the predetermined condition further cause the at least one processor to: generate a plurality of candidate topologies based on a plurality of candidate multi-uplink groups, wherein the plurality of candidate multi-uplink groups includes the first multi-uplink group and the plurality of candidate topologies includes the second topology; determine a plurality of comprehensive metric values ​​for the plurality of candidate topologies, wherein the plurality of comprehensive metric values ​​includes the first comprehensive metric value;and determine that the first comprehensive metric value for the second topology satisfies the given condition by determining that the first comprehensive metric value is a largest value from the plurality of comprehensive metric values. Electrical device according to claim 16, wherein the multi-uplink group comprises a first uplink, and the instructions that cause the at least one processor to determine the metric value for the multi-uplink group based on the first number of sibling APs and the second number of neighbor APs of the first AP, further cause the at least one processor to determine the metric value for the multi-uplink group: determining a maximum data rate for the first uplink; determining a reduction coefficient based on the first number of sibling APs and the second number of neighbor APs of the first AP; determining an actual capacity of the first uplink based on the maximum data rate and the reduction coefficient; and determining the metric value for the multi-uplink group based on the actual capacity of the first uplink. Electrical device according to claim 19, wherein the instructions that cause the at least one processor to determine the reduction coefficient based on the first number of sibling APs and the second number of neighbor APs of the first AP further cause the at least one processor to determine the reduction coefficient: determining a first coefficient based on the first number of sibling APs of the first AP, wherein the first coefficient indicates a first reduction in the actual capacity of the first uplink caused by the competition between the first AP and the sibling APs of the first AP;Determining a second coefficient based on the second number of neighboring APs of the first AP, where the second coefficient indicates a second reduction in the actual capacity of the first uplink caused by interference between the first AP and the neighboring APs of the first AP; and determining the reduction coefficient based on the first and second coefficients.

Images