CN110602715A

CN110602715A - Wireless access network and baseband function deployment method based on minimum spanning tree

Info

Publication number: CN110602715A
Application number: CN201910911853.3A
Authority: CN
Inventors: 张佳玮; 纪越峰; 肖玉明
Original assignee: Beijing University of Posts and Telecommunications
Current assignee: Beijing University of Posts and Telecommunications
Priority date: 2019-09-25
Filing date: 2019-09-25
Publication date: 2019-12-20
Anticipated expiration: 2039-09-25
Also published as: CN110602715B

Abstract

The invention discloses a wireless access network and a baseband function deployment method based on a minimum spanning tree, wherein the method comprises the following steps: according to the network topological graph of the wireless access network, generating a tree topological graph with a data center DC node of the wireless access network as a root node by using a minimum spanning tree algorithm according to the link length; under the premise of meeting the time delay requirement of the RRU nodes in the wireless access network, all functional modules FU of the baseband functions corresponding to all the RRU nodes are deployed in the upper layer processing pool nodes of the tree topology graph as much as possible. The invention can improve the resource and cost benefit of network operators, greatly improve the flexibility of FU deployment, and effectively adapt to the objective requirements of future diversified services, low-cost operation and maintenance and expandability network establishment.

Description

Wireless access network and baseband function deployment method based on minimum spanning tree

Technical Field

The present invention relates to the field of wireless access networks, and in particular, to a wireless access network and a baseband function deployment method based on a minimum spanning tree.

Background

With the continuous evolution of the mobile communication technology to the fifth generation (5G) and the later 5G (B5G), the future wireless access network will move towards a higher speed, a lower time delay and more connection directions, so as to support a larger mobile user group and more diverse service scenes, thereby greatly improving the service experience of the internet with people as the center and fully supporting the perception application of the internet of things with things as the center. However, while mobile communication technologies are iteratively updated, radio access networks also face serious challenges.

Currently, centralized radio access network (C-RAN) architecture is applied in large scale in existing networks. The traditional macro base station consists of a radio frequency unit (RRU) and a base band processing unit (BBU): the RRU is connected with an antenna through a feeder line and is responsible for completing power amplification, digital/analog signal conversion, radio frequency/baseband frequency conversion processing and the like on a sent/received wireless signal; the BBU is responsible for carrying out digital processing and wireless resource scheduling on the baseband signals. In the C-RAN mode, the RRUs and BBUs in a conventional macro base station are separated. The RRU is still deployed at the base station side, the BBU is centrally deployed in a remote processing pool to realize processing resource sharing, and the RRU and the BBU complete high-speed transmission of wireless data through an optical fronthaul network. Wherein, as BBU is concentrated to the remote processing pond, its infrastructure and computing resource such as cooling system, power supply system can be shared by a plurality of RRU sites, and the construction and the power consumption input of base station side will reduce greatly simultaneously.

For the C-RAN networking mode, two important defects exist while gains in the aspects of network construction cost, operation and maintenance investment, energy consumption and the like are obtained. On one hand, with the introduction of wider radio spectrum and massive MIMO technology, the C-RAN generates a great fronthaul bandwidth requirement. This is mainly because the fronthaul network carries the transmission of unprocessed I/Q sampled signals between RRUs and BBUs, the amount of data is proportional to the number of antennas and the wireless carrier bandwidth, so the fronthaul bandwidth consumption will be extremely large if this architecture is continued to be used in the future era of 5G/B5G. On the other hand, it is difficult for the C-RAN to meet the 5G ultra-low latency transmission requirements. Because the delay-sensitive BBU functions (e.g., HARQ, ARQ, etc.) are all deployed in the processing pool at the remote end, the delay consumption of data transmission and retransmission is increased, and the quality of service of low-delay traffic (e.g., autopilot, etc.) is compromised. Essentially, the two problems arise from the over-centralized, fixed deployment of baseband functionality. Therefore, how to improve resource efficiency and reduce latency through efficient baseband function deployment is an important issue in wireless access networks.

In the conventional C-RAN, since the BBU physical layer functions are all concentrated in the remote processing pool, a huge forwarding bandwidth is consumed for the transmission of wireless signals between the RRU and the BBU. In this regard, baseband functionality partitioning techniques are proposed to relocate part of the BBU functionality back to the base station side (i.e., co-located with the RRU) to reduce bandwidth consumption. Currently, the 5G-related standards are actively developed by several standardization organizations worldwide, wherein 3GPP (3rd Generation Partnership Project) standardization organization proposes an alternative to baseband function segmentation, as shown in fig. 1. By defining 8 splitting options to Split (Split) the baseband function into several Functional modules (FUs), the baseband function to be deployed can be selected from the processing pool and the base station. However, virtualization technology is essential to implement flexible deployment of baseband functions on the side of the processing pool and the base station. Virtualization technology can decouple software functions from underlying hardware so that network functions no longer rely on dedicated hardware, but can be configured on-demand on a general-purpose server. Thus, virtualization provides powerful technical support for flexible deployment of baseband functionality.

Therefore, the current baseband function deployment methods can be divided into two categories: BBU deployment without functional partitioning, and DU/CU deployment based on functional partitioning.

The BBU deployment under the non-functional division is a scheme adopted in the traditional C-RAN, and the scheme takes all BBU functions (FU 1-FU 8) as a whole and deploys the BBU on a general server (such as an x86 architecture server) in each processing pool in a software manner through a virtualization technology. Then, according to the remaining computing resource capacity of each processing pool, the service load of each RRU, the service delay requirement, and the network bandwidth resource state, a suitable processing pool is flexibly selected for each virtualized BBU to meet the bandwidth, delay, and processing pool resource multiplexing requirements.

In the functional partitioning-based DU/CU deployment scheme, as shown in fig. 1, the conventional BBU is subdivided into two logical functional entities, namely, DU (Distributed Unit) and CU (Centralized Unit), where DU is mainly responsible for processing the delay-sensitive baseband functions (i.e., FU 1-FU 6), and CU is responsible for processing the non-sensitive functions (i.e., FU 7-FU 8). Similarly, in the scheme, the DU and the CU are converted into two virtual network functions through a virtualization technology, and are flexibly deployed in an optimal processing pool according to the network resource state and the service delay requirement. In this way, the DUs partitioned from the BBU are placed in the processing pool close to the user side as much as possible, so as to realize the optimization of time delay and bandwidth; CUs are aggregated in a processing pool at the base station side of the far end, and the efficiency of computing resource reuse is improved.

Although the conventional C-RAN mode network architecture scheme without function partition has significantly improved resource efficiency and delay performance compared to the DU/CU deployment scheme with function partition, there are still drawbacks: the selection of function segmentation is relatively fixed, so that the development potential of the service diversified network is limited on one hand, and the whole bandwidth consumption is still high on the other hand. Therefore, the existing baseband function deployment scheme has certain limitations, and is difficult to effectively adapt to objective requirements of future diversified services, low-cost operation and maintenance and scalable network establishment.

Disclosure of Invention

The invention provides a wireless access network and a baseband function deployment method based on a minimum spanning tree, which can improve the resource and cost benefits of network operators, greatly improve the flexibility of FU deployment, and effectively adapt to the objective requirements of future diversified services, low-cost operation and maintenance and expandability network establishment.

Based on the above object, the present invention provides a baseband function deployment method based on a minimum spanning tree, comprising:

according to the network topological graph of the wireless access network, generating a tree topological graph with a data center DC node of the wireless access network as a root node by using a minimum spanning tree algorithm according to the link length;

under the premise of meeting the time delay requirement of the RRU nodes in the wireless access network, all functional modules FU of the baseband functions corresponding to all the RRU nodes are deployed in the upper layer processing pool nodes of the tree topology graph as much as possible.

On the premise of meeting the delay requirement of the RRU nodes in the radio access network, the deploying, as much as possible, each functional module FU having a corresponding baseband function for each RRU node in the upper processing pool node of the tree topology includes:

deploying all functional modules FU of the baseband functions corresponding to all RRU nodes at PP nodes serving as DC sub-nodes;

performing initial deployment adjustment of FUs according to the time delay requirement of each RRU node: for each RRU node, calculating the service transmission delay of the RRU node according to the current deployment condition of the FU corresponding to the RRU node; if the calculated service transmission delay is larger than the delay requirement of the RRU node, the FU corresponding to the RRU node is moved to a first PP node meeting the delay requirement of the RRU node along a branch of the RRU node and the DC sub-node.

Preferably, after the preliminary deployment and adjustment of the FUs are performed according to the delay requirement of each RRU node, the method further includes: and further deploying and adjusting FUs according to the calculation capacity of each PP node:

for each PP node, calculating the sum of the calculation resource requirements of all functional modules FU deployed at the PP node; if the sum of the calculated computing resource requirements is larger than the computing capacity of the PP node, the following method is adopted to transfer part FU in the PP node to other PP nodes:

arranging all functional modules FU deployed at the PP node in a descending order according to the computing resource requirement; and taking the FUs with high computing resource requirements sequenced in the front as FUs to be migrated, and migrating the FUs to subnodes of the PP node along the branch of the PP node and the RRU node corresponding to the FUs to be migrated.

Preferably, after the further deployment adjustment of the FU according to the computation capacity of each PP node, the method further includes: and further deploying and adjusting FUs according to the time delay requirement of each RRU node:

for each RRU node, calculating the service transmission delay of the RRU node according to the current deployment condition of the FU corresponding to the RRU node; and if the calculated service transmission delay is larger than the delay requirement of the RRU node, determining the PP node which is farthest away from the RRU node, and moving the RRU node to a sub-node of the PP node along a branch of the RRU node and the determined PP node corresponding to the FU.

Preferably, after the further deployment and adjustment of the FU according to the delay requirement of each RRU node, the method further includes: and carrying out further deployment adjustment on FUs according to the bandwidth capacity of each link of the tree topology graph:

determining the bandwidth requirement sum of each RRU node on each link according to the bandwidth requirement of the FU corresponding to each RRU node deployed on the link for each link in the tree topology graph based on the current deployment state of the FU corresponding to each RRU node; if the sum of the bandwidth requirements of each RRU node on the link is greater than the bandwidth capacity of the link, migrating FUs deployed on father nodes in nodes at two ends of the link out by the following method until the sum of the bandwidth requirements of each RRU node on the link is not greater than the bandwidth capacity of the link:

carrying out descending sequencing on FUs on father nodes in nodes at two ends of the link according to bandwidth requirements;

taking FUs with large bandwidth requirements sequenced at the front as FUs to be migrated, and determining RRU nodes corresponding to the FUs to be migrated as target RRU nodes;

and taking the father node as a source PP node, taking the child nodes of the source PP node as target PP nodes along the branches of the source PP node and the target RRU node, and moving the FU to be migrated to the target PP node.

Preferably, after the further deployment adjustment of the FU is performed according to the delay requirement of each RRU node, or the further deployment adjustment of the FU is performed according to the delay requirement of each RRU node, the method further includes: and further deploying and adjusting FUs according to the calculation capacity of each PP node:

The generating, according to the network topology map of the radio access network, a tree topology map using a data center DC node of the radio access network as a root node by using a minimum spanning tree algorithm according to a link length specifically includes:

deleting the DC node and a link taking the DC node as an endpoint from the obtained network topology map of the wireless access network to obtain a modified network topology map;

generating a new tree topology map by using a minimum spanning tree algorithm according to the link length for the modified network topology map;

and adding the DC node and the deleted shortest link into the newly generated tree topology graph to obtain the final tree topology graph taking the DC node as a root node.

The present invention also provides a radio access network, comprising: the method comprises the following steps: the system comprises a plurality of RRU nodes, a plurality of PP nodes, a DC node, links connected among the nodes and FUs deployed in the PP nodes;

wherein the FU is deployed according to the baseband function deployment method based on the minimum spanning tree.

Preferably, in the radio access network, for each RRU node, a PP node is locally deployed for the RRU node.

In the technical scheme of the invention, according to the network topological graph of the wireless access network, a tree topological graph which takes a Data Center (DC) node of the wireless access network as a root node is generated by using a minimum spanning tree algorithm according to the link length; under the premise of meeting the time delay requirement, deploying all function modules (FU) with the baseband function in an upper layer processing pool node of the tree-shaped topological graph as much as possible; FU deployment is carried out by using the tree topology graph, and the FU deployment is carried out in the uppermost layer processing pool node of the tree topology as far as possible on the premise of meeting time delay, so that the target requirement of using the least processing pool can be met, the centralization of the baseband function is better supported, the whole bandwidth consumption is reduced, and the resource and cost benefits of a network operator are improved; meanwhile, FUs with the baseband function corresponding to the RRU nodes can be dispersedly deployed in the PP nodes, compared with a DU/CU deployment scheme in the prior art, the flexible deployment scheme greatly improves the flexibility of FU deployment, and can effectively meet the objective requirements of future diversified services, low-cost operation and maintenance and expandability network establishment.

Drawings

FIG. 1 is a diagram of a prior art baseband functional partitioning model;

fig. 2 is a schematic network topology diagram of a radio access network according to an embodiment of the present invention;

fig. 3 is a flowchart of a baseband function deployment method based on a minimum spanning tree according to an embodiment of the present invention;

fig. 4 is a flowchart of a method for generating a tree topology according to a network topology of the radio access network according to an embodiment of the present invention;

fig. 5 is a tree topology diagram of a radio access network according to an embodiment of the present invention;

fig. 6 is a flowchart of a method for performing preliminary arrangement on an FU according to a delay requirement of an RRU node according to an embodiment of the present invention;

fig. 7 is a schematic diagram illustrating adjustment of the disposition of FUs corresponding to RRU nodes whose delay requirements are not met according to the embodiment of the present invention;

fig. 8 is a flowchart of a method for performing deployment adjustment of an FU according to a computation capacity of a PP node according to an embodiment of the present invention;

fig. 9 is a schematic diagram illustrating the adjustment of the disposition of FUs on a PP node with overloaded computing resources according to an embodiment of the present invention;

fig. 10 is a flowchart of a method for performing a deployment adjustment of an FU according to a bandwidth capacity of a link according to an embodiment of the present invention;

fig. 11 is a schematic diagram illustrating the adjustment of the disposition of FUs on a link whose bandwidth requirement is not met according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to specific embodiments and the accompanying drawings.

Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative only and should not be construed as limiting the invention.

As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may also be present. Further, "connected" or "coupled" as used herein may include wirelessly connected or wirelessly coupled. As used herein, the term "and/or" includes all or any element and all combinations of one or more of the associated listed items.

It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.

The inventor of the invention considers that the existing BBU deployment scheme has defects in the aspects of network and computing resource efficiency, so that the technical scheme of the invention takes the idea of combining function segmentation and flexible deployment as a starting point, and provides a baseband function deployment scheme based on a minimum spanning tree, and the scheme uses a minimum spanning tree algorithm to generate a tree topology map which takes a Data Center (DC) node of a wireless access network as a root node according to a link length and a network topology map of the wireless access network; under the premise of meeting the time delay requirement, deploying all function modules (FU) with the baseband function in an upper layer processing pool node of the tree-shaped topological graph as much as possible; FU deployment is carried out by using the tree topology graph, and the FU deployment is carried out in the uppermost layer processing pool node of the tree topology as far as possible on the premise of meeting time delay, so that the target requirement of using the least processing pool can be met, the centralization of the baseband function is better supported, the whole bandwidth consumption is reduced, and the resource and cost benefits of a network operator are improved; meanwhile, FUs with the baseband function corresponding to the RRU nodes can be dispersedly deployed in the PP nodes, compared with a DU/CU deployment scheme in the prior art, the flexible deployment scheme greatly improves the flexibility of FU deployment, and can effectively meet the objective requirements of future diversified services, low-cost operation and maintenance and expandability network establishment.

The technical scheme of the invention is suitable for the BBU function deployment problem in uplink transmission and the BBU function deployment problem in downlink transmission.

The technical solution of the embodiments of the present invention is described in detail below with reference to the accompanying drawings.

The embodiment of the invention provides a wireless access network, which comprises: a plurality of radio frequency unit (RRU) nodes, a plurality of Processing Pool (PP) nodes, a Data Center (DC) node, links connected between the nodes, and a functional module FU of baseband function deployed in the Processing Pool (PP) nodes;

the network topology of the radio access network may be as shown in fig. 2, and specifically includes the following nodes: a plurality of radio frequency unit (RRU) nodes, a plurality of Processing Pool (PP) nodes, a Data Center (DC) node; in addition, the network topology also comprises links connected between the nodes.

For each RRU node in the radio access network, a Processing Pool (PP) node may be locally deployed for the RRU node; the RRU node is directly connected with a local PP node through an optical fiber;

each Processing Pool (PP) node comprises an Electrical Switch (ES) and a ROADM (Reconfigurable Optical Add-Drop Multiplexer), and completes the exchange of data traffic in the electrical domain and the Optical domain respectively; the Processing Pool (PP) node further includes a plurality of General Purpose servers (GPP) in which Virtual Machines (VMs) are created, and FUs (functional modules) partitioned from the BBU can be deployed in the VMs.

In the technical scheme of the invention, the user flow borne by the RRU node can be processed in the local PP node and can also be processed in other PP nodes; that is, each FU of the baseband function corresponding to the RRU node may be deployed in the local PP node, and may also be deployed in multiple PP nodes in a distributed manner, which greatly improves the flexibility of FU deployment compared with the DU/CU deployment scheme in the prior art.

Finally, the user traffic of all RRU nodes can be imported into the DC node through links in the network for content processing.

For the above radio access network, a specific flow of a baseband function deployment method based on a minimum spanning tree provided in an embodiment of the present invention is shown in fig. 3, and includes the following steps:

step S301: network topology information of a wireless access network is obtained.

In this step, a network topology of the radio access network, for example, the network topology shown in fig. 2, may be obtained. The network topology graph comprises nodes and link information among the nodes; the nodes comprise an RRU node, a PP node and a DC node.

For example, the network topology shown in fig. 2 includes 6 RRU nodes, 6 PP nodes, and 1 DC node; wherein, 6 RRU nodes are respectively marked as RRUs₁～RRU₆Respectively recording 6 PP nodes as PP₁～PP₆。

Step S302: and generating a tree topology map according to the obtained network topology map of the wireless access network.

In this step, according to the network topology of the radio access network, a tree topology using a minimum spanning tree algorithm as a root node is generated according to the link length, and a specific process is shown in fig. 4, which includes the following sub-steps:

substep S401: and deleting the DC node and the link taking the DC node as an endpoint from the obtained network topology map of the wireless access network to obtain a modified network topology map.

Substep S402: and generating a new tree topology graph according to the link length by using a minimum spanning tree algorithm (MST) for the modified network topology graph.

Substep S403: and adding the DC node and the deleted shortest link into the newly generated tree topology graph to obtain a final tree topology graph taking the DC node of the wireless access network as a root node.

For example, according to the network topology shown in fig. 2, a tree topology shown in fig. 5 may be finally generated.

Step S303: and performing preliminary deployment on the FU according to the time delay requirement of the RRU node.

In this step, on the premise of meeting the delay requirement of the RRU node in the radio access network, each functional module FU of the baseband function corresponding to each RRU node is deployed as much as possible in the upper processing pool node of the tree topology, and as shown in fig. 6, the specific process includes the following sub-steps:

substep S601: the deployment position of each functional module FU of the baseband function is initialized.

In this sub-step, each functional module FU of the baseband function corresponding to all RRU nodes is deployed at a PP node that is a sub-node of the DC node (hereinafter referred to as DC sub-node).

For example, for the tree topology shown in fig. 5, in this sub-step, all functional modules FU of the baseband functions corresponding to all RRU nodes are deployed in the PP₁And a node.

Substep S602: and carrying out the deployment adjustment of the functional module FU according to the time delay requirement of each RRU node.

In the sub-step, for each RRU node, calculating the service transmission delay of the RRU node according to the current deployment condition of the FU corresponding to the RRU node; if the calculated service transmission delay is larger than the delay requirement of the RRU node, the FU corresponding to the RRU node is moved to a first PP node meeting the delay requirement of the RRU node along a branch of the RRU node and the DC sub-node.

For example, as shown in FIG. 7, after deployment via sub-step S601，RRU₄Node and RRU₆If the time delay requirement of the node is not met, in this sub-step, the RRU can be followed₄A node and a DC sub-node, RRU₄All FUs of the node are put down to PP₂At least one of (1) and (b); along the RRU₆A node and a DC sub-node, RRU₆All FUs of the node are also put down to the PP₂To (3).

The service transmission delay of the RRU node includes transmission delay of a service of the RRU node on a link and switching delay of the PP node, and the delay calculation range is a delay from the RRU node to the completion of FU processing corresponding to the last RRU node. Wherein the transmission delay is related to the link length; the switching delay is related to whether the FU corresponding to the RRU node is processed at the PP node, and if the FU corresponding to the RRU node is processed, the delay is introduced.

Step S304: and carrying out the deployment adjustment of the FU according to the calculation capacity of the PP node.

In this step, for a PP node whose computational resource required by the deployed FU exceeds the computational capacity, migrating a part of FUs in the PP node to another PP node, and performing adjustment of FU deployment, as shown in fig. 8, the specific process includes the following sub-steps:

substep S801: for each PP node, calculating the sum of the calculation resource requirements of all functional modules FU deployed at the PP node; and if the sum of the calculated computing resource requirements is larger than the computing capacity of the PP node, migrating the part FU in the PP node to other PP nodes.

Specifically, for each PP node, the sum of the computing resource requirements of the functional modules FU deployed at the PP node is calculated; if the sum of the computing resource requirements obtained by computing is greater than the computing capacity of the PP node, migrating the part FU in the PP node to other PP nodes by adopting the following method until the sum of the computing resource requirements of the functional modules FU at the PP node is less than or equal to the computing capacity of the PP node:

arranging all functional modules FU deployed at the PP node in a descending order according to the computing resource requirement; taking FUs with high computing resource requirements sequenced in the front as FUs to be migrated, taking sub-nodes of the PP node on a branch of the PP node and the RRU node corresponding to the FUs to be migrated as target nodes, and migrating the FUs to be migrated to the target nodes; that is to say, FU with a high demand on computational resources ordered in the front is taken as an FU to be migrated, and the FU is migrated to a child node of the PP node along a branch of the RRU node corresponding to the PP node and the FU to be migrated.

For example, as shown in FIG. 9, PP₁Compute resource requirements of FUs deployed in excess of PP₁So that in this sub-step, RRU can be used₂FU of, along PP₁Node and RRU₂Branches of nodes, migrating to PP₁Child node PP of a node₂And (4) nodes.

Substep S802: and for the PP node to which the functional module FU is migrated, further FU deployment adjustment is carried out according to the calculation capacity of the PP node until the requirement of the calculation capacity of all PP nodes is met.

In this sub-step, for the PP node to which the functional module FU is migrated, further FU deployment adjustment is performed according to the computation capacity of the PP node until, for each PP node, the sum of the computation resource requirements of the FU deployed by the PP node does not exceed the computation capacity of the PP node.

Wherein, for the PP node to which the functional module FU is migrated, the method for further adjusting the FU deployment according to the calculation capacity of the PP node comprises the following steps: calculating the sum of the calculation resource requirements of all functional modules FU deployed at the PP node to which the functional modules FU are migrated; and if the sum of the calculated computing resource requirements is larger than the computing capacity of the PP node, migrating the part FU in the PP node to other PP nodes.

Specifically, for a PP node to which a functional module FU is migrated, calculating a total sum of calculation resource requirements of each functional module FU deployed at the PP node; if the sum of the computational resource requirements obtained by the computation is greater than the computation capacity of the PP node, the same method as mentioned in the above substep S801 is adopted to migrate the part FU in the PP node to other PP nodes until the sum of the computational resource requirements of the functional modules FU at the PP node is less than or equal to the computation capacity of the PP node:

For example, as shown in FIG. 9, PP₁The sum of the computing resource requirements of all functional modules FU at the node is larger than PP₁The calculation capacity of the node, PP can be obtained₁Corresponding RRU at node₂FU migration to PP of node₂And (4) nodes.

Substep S803: and further deploying and adjusting FUs according to the time delay requirement of each RRU node.

Since the FU is initially deployed in step S303 according to the delay requirement of the RRU node, and then the FU deployment is adjusted in sub-steps S801 and S802, in this sub-step, it is necessary to verify whether the delay requirement of each RRU node satisfies:

Substep S804: judging whether the requirement of the calculation capacity of each PP node is met; if yes, go on to the following substep S805; otherwise, it jumps to substep S801.

In this sub-step, for each PP node, the total computing resource requirement of each functional module FU deployed at the PP node is calculated; if the sum of the calculated computing resource requirements is larger than the computing capacity of the PP node, judging that the requirement of the computing capacity of the PP node is not met, skipping to the substep S801, and carrying out FU deployment adjustment;

if for each PP node the requirement of the computation capacity of the PP node is satisfied, i.e. the sum of the computation resource requirements of the functional modules FU deployed at the PP node is not greater than the computation capacity of the PP node, the following sub-step S805 is continued.

Substep S805: and allocating wavelength and bandwidth to each RRU node on the link.

In this sub-step, based on the current deployment state of the FU corresponding to each RRU node, for each link in the tree topology, determining the bandwidth requirement of each RRU node on the link according to the bandwidth requirement of the FU corresponding to each RRU node deployed on the link; and allocating the wavelength and the bandwidth to each RRU node on the link based on the bandwidth requirement of each RRU node on the link.

Step S305: judging whether the requirement of the bandwidth capacity of each link in the tree topology graph is met; if yes, jumping to step S306; otherwise, the FU is further deployed and adjusted according to the bandwidth capacity of each link, and then the procedure goes to step S304.

In this step, based on the current deployment state of the FU corresponding to each RRU node, for each link in the tree topology, determining the bandwidth requirement sum of each RRU node on the link according to the bandwidth requirement of the FU corresponding to each RRU node deployed on the link; if the sum of the bandwidth requirements of each RRU node on the link is greater than the bandwidth capacity of the link, migrating FUs deployed on parent nodes in nodes at two ends of the link by the following method flow shown in fig. 10 until the sum of the bandwidth requirements of each RRU node on the link is not greater than the bandwidth capacity of the link, specifically including the following sub-steps:

substep S1001: and carrying out descending sequencing on FUs on father nodes in the nodes at two ends of the link according to the bandwidth requirement.

Substep S1002: and taking the FUs with high bandwidth requirement in the front sequence as FUs to be migrated, and determining the RRU node corresponding to the FUs to be migrated as the target RRU node.

Substep S1003: and taking the father node as a source PP node, taking the child nodes of the source PP node as target PP nodes along the branches of the source PP node and the target RRU node, and moving the FU to be migrated to the target PP node.

For example, as shown in FIG. 11, PP₁Node and PP₂The sum of the bandwidth requirements of FUs corresponding to RRU nodes deployed on the links between the nodes is larger than the bandwidth capacity of the links, and then the PP is used₁Corresponding RRU on node₂Partial FU migration to PP of node₂And (4) nodes.

Step S306: and allocating wavelength and bandwidth to each RRU node on the link.

In this step, based on the current deployment state of the FU corresponding to each RRU node, for each link in the tree topology, determining the bandwidth requirement of each RRU node on the link according to the bandwidth requirement of the FU corresponding to each RRU node deployed on the link; and allocating the wavelength and the bandwidth to each RRU node on the link based on the bandwidth requirement of each RRU node on the link.

Those of skill in the art will appreciate that various operations, methods, steps in the processes, acts, or solutions discussed in the present application may be alternated, modified, combined, or deleted. Further, various operations, methods, steps in the flows, which have been discussed in the present application, may be interchanged, modified, rearranged, decomposed, combined, or eliminated. Further, steps, measures, schemes in the various operations, methods, procedures disclosed in the prior art and the present invention can also be alternated, changed, rearranged, decomposed, combined, or deleted.

Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the idea of the invention, also features in the above embodiments or in different embodiments may be combined, steps may be implemented in any order, and there are many other variations of the different aspects of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements and the like that may be made without departing from the spirit and principles of the invention are intended to be included within the scope of the invention.

Claims

1. A baseband function deployment method based on a minimum spanning tree is characterized by comprising the following steps:

2. The method according to claim 1, wherein on the premise that the delay requirement of the RRU node in the radio access network is satisfied, deploying, as much as possible, each function module FU having a corresponding baseband function for each RRU node in an upper processing pool node of the tree topology, specifically comprises:

3. The method of claim 2, wherein after the preliminary deployment adjustment of the FUs according to the delay requirement of each RRU node, further comprising: and further deploying and adjusting FUs according to the calculation capacity of each PP node:

4. The method according to claim 3, further comprising, after said further deployment adjustment of FUs according to the computational capacities of the PP nodes: and further deploying and adjusting FUs according to the time delay requirement of each RRU node:

5. The method of claim 4, wherein after the further deployment adjustment of the FU according to the delay requirement of each RRU node, further comprising: and carrying out further deployment adjustment on FUs according to the bandwidth capacity of each link of the tree topology graph:

6. The method according to claim 4 or 5, wherein after the further deployment adjustment of the FU according to the delay requirement of each RRU node or the further deployment adjustment of the FU according to the delay requirement of each RRU node, the method further comprises: and further deploying and adjusting FUs according to the calculation capacity of each PP node:

7. The method of claim 6, further comprising: allocating wavelength and bandwidth to each RRU node on the link:

determining the bandwidth requirement of each RRU node on each link according to the bandwidth requirement of the FU corresponding to each RRU node deployed on the link for each link in the tree topology graph based on the current deployment state of the FU corresponding to each RRU node; and allocating the wavelength and the bandwidth to each RRU node on the link based on the bandwidth requirement of each RRU node on the link.

8. The method according to any one of claims 1 to 5, wherein the generating, according to the network topology of the radio access network, a tree topology using a minimum spanning tree algorithm according to link lengths and taking a data center DC node of the radio access network as a root node specifically comprises:

9. A radio access network, comprising: the system comprises a plurality of RRU nodes, a plurality of PP nodes, a DC node, links connected among the nodes and FUs deployed in the PP nodes; it is characterized in that the preparation method is characterized in that,

the FU is deployed according to the minimal spanning tree based baseband functionality deployment method of any of claims 1-7.

10. The radio access network of claim 9, wherein for each RRU node, one PP node is locally deployed for the RRU node.