WO2022001510A1

WO2022001510A1 - Method for managing sharing of base station resources by multiple slices

Info

Publication number: WO2022001510A1
Application number: PCT/CN2021/096025
Authority: WO
Inventors: 袁春经; 刘树峥; 王园园; 田霖; 石晶林
Original assignee: 中国科学院计算技术研究所
Priority date: 2020-06-30
Filing date: 2021-05-26
Publication date: 2022-01-06
Also published as: CN111769988B; CN111769988A

Abstract

The present invention provides a method for managing soft-sharing of base station resources by multiple slices, wherein each slice is allocated with a protection resource R_px and a protection DRB number D_px, and the base station at least comprises a list of slices of which the occupied resources exceeds the protection resource. Said method comprises: step 1) receiving a request of a slice x to establish a new service m, the number of DRBs required to be used by the new service m being recorded as D_{x, m}, and the number of DRBs established by the slice x at a current moment t being recorded as D_{ox, t}; step 2) determining whether the current base station has sufficient free resources to establish the new service m; and step 3) in cases where the current base station does not have sufficient free resources to establish the new service m, if D_{ox, t}+ D_{x, m}≤ D_px, triggering the exit of resources for the slices in the slice list of which the occupied resources exceed the protection resource, and after the exit of the resources succeeds, establishing the new service m and the required DRBs, and configuring a protocol stack. On the basis of the embodiments of the present invention, multiple slices share the base station resources, isolation between the slices is ensured, the characteristic of not affecting each other is implemented, and deployment and management costs are reduced.

Description

A management method for sharing base station resources among multiple slices

technical field

The present invention relates to a wireless communication system, and in particular, to slice management of a base station.

Background technique

Slicing technology can satisfy differentiated services or terminals in the same network for effective communication, new application scenarios and services emerge one after another, and terminal devices are constantly being updated. Compared with the upgrade of services and terminals, the upgrade of the network has a longer update cycle. In order to adapt to various scenarios of rapid development, flexible slicing technology is introduced into the network. The slicing technology can fully invoke core network functions in the core network according to the needs of services or terminals. At present, the existing standards describe the management of slices in the core network in more detail, but there is a lack of relevant technical regulations on how to manage and control the base station side of the access network. Sharing the same base station among multiple slices is a big problem, because multiple slices need to share the same set of protocol stacks and computing and wireless resources, but at the same time, the principle that different slices do not affect each other must be satisfied. On the access network side, in order to satisfy the isolation, the method of deploying independent base station software and hardware resources for different slices is usually adopted. Although the isolation between base stations can be well ensured, it greatly increases the deployment cost of slices, and for the sake of Manage the administrative costs that come with managing numerous pieces of hardware.

SUMMARY OF THE INVENTION

In view of the above problems, the present invention proposes a method for sharing a base station with multiple slices, including:

According to a first aspect of the present invention, a method for managing multi-slice soft-shared base station resources is provided, wherein each slice is allocated a protection resource R _px and a protection DRB number D _px , and the base station includes at least one occupied resource exceeding protection A list of slices of resources, the method includes:

Step 1) receive the request of slice x to establish new service m, the number of DRBs that the new service m needs to use is denoted as D _x,m , and the number of DRBs established by slice x at the current moment t is denoted as D _ox,t ;

Step 2) judging whether the current base station has enough idle resources to establish a new service m;

Step 3) In the case that the current base station does not have enough free resources to establish a new service m, if D _ox,t +D _x,m ≤D _px , trigger the exit of resources for the slices in the slice list that belong to the occupied resources exceeding the protection resources, and in After the resource exits successfully, a new service m and its required DRB are established, and a protocol stack is configured.

In an embodiment of the present invention, the step 3) further comprises:

In the case that the current base station does not have enough idle resources to establish a new service m, if D _ox,t +D _x,m >D _px , a waiting time T _Sx is established to wait for the idle resources of the base station; if there are enough _{idle resources within the waiting time T Sx} If there are idle resources, a new service m and its required DRB are established, and the protocol stack is configured. If there are no idle resources within the waiting time, the establishment of the service is abandoned.

In one embodiment of the present invention, the method further comprises step 4):

In the case that the current base station has enough idle resources to establish a new service m, the new service m and its required DRB are established, and a protocol stack is configured.

In an embodiment of the present invention, it also includes:

According to the statistical laws of the MAC layer, in the slice x, R & lt access to resources established DRB number _x D _x by the following equation:

D _x =f _x (R _x )

where f _x (R) is a function of the statistics of _{resource R x in slice x.}

In an embodiment of the present invention, in step 3), according to the principle of maximizing energy efficiency and minimizing the resources to be withdrawn, the slices in the list of slices whose occupied resources exceed the protected resources are triggered to withdraw resources.

In an embodiment of the present invention, the objective function of maximum energy efficiency is

represents the total capacity of n slices,

Indicates the total capacity of the services exited by n slices, C _x,m is the capacity of the services to be established by slice x, and P _total is the total power consumed in the process.

In an embodiment of the present invention, the following two qualification conditions must be satisfied when triggering the exit of resources for slices in the slice list whose occupied resources exceed the protected resources

(1) After exiting the resources, the resource requirements for establishing DRBs for slice x are met, that is,

Wherein, R _BS is the total number of resources of the base station BS, R _ox is the occupied resource of the slice x, R _x,m is the resource corresponding to the number of DRBs used by the slice to establish a new service m; and

(2) The slice cannot exit the radio resource within the protection resource, that is

R _oi -R _ri ≥R _px i=1,2,...,n

Among them, _Roi is the occupied resource _{of slice i, and R ri} is the exit resource of slice i.

According to a second aspect of the present invention, there is provided a management method for sharing base station resources among multiple slices, wherein each slice is allocated a protection resource R _px and a protection DRB number D _px , and the base station at least includes a soft shared slice list, a list of hard-isolated slices and a list of slices that take up more resources than protected resources, and the method includes:

Step H1) receiving a request for establishing a new service m by slice x, the number of DRBs that the new service m needs to use is denoted as D _x,m , and the number of DRBs established by slice x at the current moment t is denoted as D _ox,t ,

Step H2) judging whether the slice x belongs to the soft-shared slice list, and if so, execute the multi-slice soft-sharing base station resource management method of the present invention;

Step H3) judge whether the slice x belongs to the hard isolation slice list, if it belongs, then

If D _ox,t +D _x,m ≤D _px , establish a new service m and its required DRB, and configure the protocol stack;

If D _ox,t +D _x,m >D _px , set up waiting time _THx to wait for idle resources of slice x; if _{there are idle resources within waiting time THx} , set up new service m and its required DRB, And configure the protocol stack. If there is no idle resource within the waiting time, the establishment of the service will be abandoned.

According to a third aspect of the present invention, a computer-readable storage medium is provided, in which one or more computer programs are stored, and when the computer programs are executed, are used to implement the multi-slice soft-shared base station resource management method of the present invention and the management method for sharing base station resources with multiple slices of the present invention.

According to a fourth aspect of the present invention, a computing system is provided, comprising:

a storage device, and one or more processors;

Wherein, the storage device is used to store one or more computer programs, and the computer programs are used to implement the multi-slice soft-sharing base station resource management method of the present invention and the multi-slice sharing of the present invention when the computer programs are executed by the processor. A method for managing base station resources.

Compared with the prior art, the embodiments of the present invention have the advantages of realizing that multiple slices share base station resources, ensuring isolation between slices, realizing the feature of not affecting each other, and reducing deployment and management costs.

Description of drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description serve to explain the principles of the invention. Obviously, the drawings in the following description are only some embodiments of the present invention, and for those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative effort. In the attached image:

FIG. 1 shows a flowchart of establishing a slice service according to an embodiment of the present invention.

FIG. 2 shows a flow chart of establishing a soft shared slice service according to an embodiment of the present invention.

detailed description

As described in the Background Art, at present, there is no standard on the access network side to describe how to manage slices, and the base station adopts the method of deploying independent base station software and hardware resources for different slices, which greatly increases the cost of slice deployment and management. To this end, the inventor of the present patent analyzes the control plane, user plane and various protocol layers of the base station protocol stack, and studies the management of slices in the control plane. In general, the present invention effectively manages multiple slices sharing base station resources on the access network side on the control plane, establishes and trains slice templates according to service requirements, assigns an average QoS value to slices by the operator according to service attributes, and negotiates slices. The maximum amount of resources that can be allocated on the current base station, and the number of DRBs that can be established is estimated from the allocated resources, and the number of DRBs that can be established is used as the basis for resource soft sharing and hard isolation.

First, several concepts used in the present invention are given below.

1) The relationship between the sliced radio resources and the number of DRBs

According to the resource statistics rule of the MAC layer, the radio resources allocated when the data radio bearer DRB (Data Radio Bearer) is established in the slice can be calculated according to the QoS value of the service. That is, for a certain slice x, according to the statistical rule of the MAC layer, the average value of the number of resource blocks (RBs) occupied by one DRB can be obtained. Therefore there is a function f _x (R) of the number of DRBs D _x _{established by resource R x in slice x:}

D _x = f _x (R _x ) (1)

f _x (R) is a function of the statistics of the _{resource R x} in the slice x, and the _{unit of R x} is the number of resource blocks RB.

2) Allocate the protection resource R _px and the protection DRB number D _{px for the slice}

The base station allocates a resource threshold for slice x according to slice attributes or user payment conditions, which is called the protection resource R _{px of} slice x, and the unit is the number of RBs. According to the statistical law formula (1) of the MAC layer, the _{corresponding protection DRB number of the R px of the} slice x on the user plane is D _px .

The resource used by the slice x to establish the service in the base station is the occupied resource _Rox of the slice x. According to the statistical law formula (1) of the MAC layer, the number of DRBs established on the user plane by Ro _{ox of} _{slice x can be calculated as D ox} .

The total number of resources of the base station BS is R _BS , which can support N slices to share resources, and the sum of the protection resources allocated by the base station for these slices should not be greater than the total wireless resources that the base station can provide, that is,

When the base station resources are hard isolated, in addition to satisfying formula (2), the slice x cannot use resources beyond its protection resource R _px , that is,

R _ox ≤R _px

as well as

D _ox ≤ D _px

The following describes resource soft sharing and its resource exit algorithm

When the base station resources are softly shared, formula (2) is still satisfied, but the slice can use resources beyond its protection resource R _px for resource sharing, and the sum of the resources occupied by these slices cannot be greater than the total wireless resources that the base station can provide, that is

When the slice x will make the occupied resource _Rox greater than the protection resource _Rpx to establish a new service, if the current base station has available resources, the slice can continue to establish the service, and the used resources exceed its protection resource _Rpx is the borrowed resource R _bx . According to the above statistical law formula (1) of the MAC layer, the number D _bx of DRBs borrowed by the slice x in the user plane can be calculated.

When slice x uses the borrowed resource R _{bx to} establish a service, and there are other slices that do not reach the protection resource and need to establish a new service, it is possible that slice x needs to withdraw from the resource, and the withdrawn resource of slice x is R _rx . According to the above statistical law formula (1) of the MAC layer, correspondingly, the number of DRBs D _rx released by the slice x on the user plane can be calculated.

The number of DRBs occupied by slice x at time t is D _ox , the number of DRBs used by slice x to establish a new service m is D _x,m , and the corresponding wireless resources are R _x,m , if the base station does not have enough available resources, but Satisfying D _ox +D _x,m ≤D _px , there are n slices with borrowed resources, and they can withdraw from the resources to make the idle resources reach R _x,m for the slice x to establish a new service m for use.

When considering the resource exit algorithm, it is necessary to consider maximizing the energy efficiency, and the objective function with the highest energy efficiency is

Represents the total capacity of n slices and is a constant;

Represents the total capacity of services withdrawn by n slices, which is a function of withdrawing resources; C _{x, m} is the capacity of the services to be established by slice x, which is a constant; P _total is the total power consumed in this process, assuming power It is related to resources, and the total resources exited by n slices will be used to serve slice x, and it can be considered that P _total is also constant. Therefore, the objective function with maximum energy efficiency can be simplified to:

That is, the resources to be withdrawn should be as small as possible, but the resources to be withdrawn need the following two qualifications

After exiting the resource, meet the resource requirements of slice x to establish DRB;

(2) The base station cannot require the slice to withdraw from the radio resource in the protection resource, that is, the resource occupied by any slice after exiting the resource is not less than the protection resource,

R _oi -R _ri ≥R _px i=1,2,...,n

The following describes the method for the base station to perform hard isolation and soft shared resource allocation management on slices

The base station may perform hard isolation for all slices, or may perform soft sharing for all slices. The base station can also perform hard isolation on some slices and soft sharing on other slices. The base station maintains a list of all slices {S ₁ , S ₂ ,...,S _N }, and also maintains a list of hard isolated slices, a list of soft shared slices, and a list of slices that occupy more resources than protected resources.

For example, a base station manages 6 slices {S ₁ , S ₂ , ..., S ₆ }, S ₁ , S ₂ , S ₃ belong to hard isolation slices, S ₄ , S ₅ , S ₆ belong to soft shared slices, S ₅ , S _{6 The} occupied resources have exceeded the protection resources. The list of hard isolated slices maintained by the base station is {S ₁ , S ₂ , S ₃ }, the list of soft shared slices is { S ₄ , S ₅ , S ₆ }, and the list of slices that occupy more resources than protected resources is { S ₅ , S ₆ }.

FIG. 1 shows a flow chart of establishing a slice service according to an embodiment of the present invention, and the flow is described in detail below.

Step 101: The number of DRBs established by slice x at time t is D _ox,t , and a new service m is requested to be established, and the number of DRBs used by m is D _x,m . If the slice belongs to the hard isolation slice list, such as S ₁ , resource management is performed on it according to the hard isolation method, including

steps

110 , 115 , 120 , 125 and 130 . If the slice belongs to the soft-shared slice list, such as S ₄ , perform resource management on it according to the soft-sharing manner, including

steps

150 , 155 , 160 , 165 , 170 , 175 , 180 , and 185 .

Step 110: For hard isolation slices, determine whether the required resources exceed the protection resources. If D _ox,t +D _x,m ≤D _px , it does not exceed the protection resources, and if D _ox,t +D _x,m >D _px , it exceeds the protection resource.

Step 115: If the protection resources are not exceeded, establish a new service m and its required DRB, and configure the protocol stack.

Step 120: If the protected resources are exceeded, a waiting time T _Hx is established to wait for the idle resources of the slice x.

Step 125: If _{there are idle resources within the waiting time THx} , a new service m and its required DRB are established, and a protocol stack is configured.

Step 130: If there is no idle resource within the waiting time, the establishment of the service is abandoned.

Step 150: For the soft shared slice, determine whether the current base station has enough idle resources to establish a new service m, that is, whether the idle resources are greater than or equal to D _x,m

Step 155: If there are enough free resources, establish a new service m and its required DRB, and configure the protocol stack.

Step 160: If there are not enough free resources, determine whether the required resources exceed the protection resources. If D _ox,t +D _x,m ≤D _px , then the protection resources are not exceeded, and if D _ox,t +D _x,m >D _px , the protection resource is exceeded.

Step 165: belonging footprint than the protection of resources sliced slices exit triggered a list of resources, such as S ₄ in this case, can trigger S _5, S ₆ Exit resources. Slices capable of resource exit are limited to slices that occupy more resources than protected resources.

Step 170: After the resource exit is successful, a new service m and its required DRB are established, and a protocol stack is configured.

Step 175: Set up a waiting time T _Sx to wait for idle resources of the base station.

Step 180: If _{there are enough idle resources within the waiting time T Sx} , a new service m and its required DRB are established, and a protocol stack is configured.

Step 185: If there is no idle resource within the waiting time, the establishment of the service is abandoned.

According to another embodiment of the soft sharing management of the present invention, as long as the resources occupied by the current slice are less than the protection resources, even if the available resources of the base station may not be enough to establish a new service m after the exit is triggered, the resources will be exited, and if the exit resources are insufficient, wait for a period of time time, and if there are still not enough free resources, the establishment of the business is abandoned. Figure 2 shows a flow chart of this embodiment.

Step 250: Same as Step 150, for the soft shared slice, determine whether the current base station has enough idle resources to establish a new service m, that is, whether the idle resources are greater than or equal to D _x,m

Step 255: Same as step 155, if there are enough free resources, establish a new service m and its required DRB, and configure the protocol stack.

Step 260: If there is not enough free resources, it is judged whether the current resource footprint over protection, if D _{ox, t} ≤D _{_px,} no more than the protection of resources, if D _{ox, t>} D _{_px,} over the protected resources.

Step 275: Same as step 175, set up a waiting time T _Sx to wait for the idle resources of the base station.

Step 280: Same as Step 180, if _{there are enough idle resources within the waiting time T Sx} , a new service m and its required DRB are established, and a protocol stack is configured.

Step 285: Same as Step 185, if there is no idle resource within the waiting time, the establishment of the service is abandoned.

Step 265: belonging footprint than the protection of resources sliced slices exit triggered a list of resources, such as S ₄ in this case, can trigger S _5, S ₆ Exit resources. Slices capable of resource exit are limited to slices that occupy more resources than protected resources.

Step 266: Determine whether the base station has enough resources to establish a service m for the slice x after the resources are withdrawn.

Step 270: If there are enough resources, establish service m for slice x.

Step 267: If there are not enough resources, set up a waiting time T _Sx to wait for the idle resources of the base station.

Step 268: If there are enough resources, establish service m for slice x.

Step 269: If there are not enough resources, the establishment of the service is abandoned.

Claims

A method for managing multi-slice soft-shared base station resources, wherein each slice is allocated a protection resource R px and a protection DRB number D px , the base station at least includes a list of slices whose occupied resources exceed the protection resources, and the method includes :

Step 1) receive the request of slice x to establish new service m, the number of DRBs that the new service m needs to use is denoted as D x,m , and the number of DRBs established by slice x at the current moment t is denoted as D ox,t ;

Step 2) judging whether the current base station has enough idle resources to establish a new service m;

Step 3) In the case that the current base station does not have enough free resources to establish a new service m, if D ox,t +D x,m ≤D px , trigger the exit of resources for the slices in the list of slices whose occupied resources exceed the protection resources, and in After the resource exits successfully, a new service m and its required DRB are established, and a protocol stack is configured.
The method according to claim 1, the step 3) further comprising:

In the case that the current base station does not have enough idle resources to establish a new service m, if D ox,t +D x,m >D px , a waiting time T Sx is established to wait for the idle resources of the base station; if there are enough idle resources within the waiting time T Sx If there are idle resources, a new service m and its required DRB are established, and the protocol stack is configured. If there are no idle resources within the waiting time, the establishment of the service is abandoned.
The method according to claim 1, further comprising step 4):

In the case that the current base station has enough idle resources to establish a new service m, the new service m and its required DRB are established, and a protocol stack is configured.
The method of claim 1, further comprising:

According to the statistical laws of the MAC layer, in the slice x, R & lt access to resources established DRB number x D x by the following equation:

D x =f x (R x )

where f x (R) is a function of the statistics of resource R x in slice x.
The method according to claim 1, wherein in step 3), according to the principle that the energy efficiency is the greatest and the resources to be withdrawn should be as small as possible, the slices in the list of slices that belong to the occupied resources exceeding the protection resources are triggered to exit the resources.
According to the method of claim 5, the objective function of maximum energy efficiency is

represents the total capacity of n slices,
Indicates the total capacity of the services exited by n slices, C x,m is the capacity of the services to be established by slice x, and P total is the total power consumed in the process.
According to the method of claim 6, the following two qualification conditions shall be satisfied when triggering the exit of resources for the slices in the slice list whose occupied resources exceed the protected resources

(1) After exiting the resources, the resource requirements for establishing DRBs for slice x are met, that is,

Wherein, R BS is the total number of resources of the base station BS, R ox is the occupied resource of the slice x, R x,m is the resource corresponding to the number of DRBs used by the slice to establish a new service m; and

(2) The slice cannot exit the radio resource within the protection resource, that is

R oi -R ri ≥R px i=1,2,...,n

Among them, Roi is the occupied resource of slice i, and R ri is the exit resource of slice i.
A method for managing base station resources shared by multiple slices, wherein each slice is allocated with a protection resource R px and a protection DRB number D px , and the base station at least includes a soft shared slice list, a hard isolation slice list and an occupied resource Exceeding the slice list of protected resources, the method includes:

Step H1) receiving a request for establishing a new service m by slice x, the number of DRBs that the new service m needs to use is denoted as D x,m , and the number of DRBs established by slice x at the current moment t is denoted as D ox,t ,

Step H2) judge whether the slice x belongs to the soft shared slice list, if it belongs, then execute the method as one of claims 1-7;

Step H3) judge whether the slice x belongs to the hard isolation slice list, if it belongs, then

If D ox,t +D x,m ≤D px , establish a new service m and its required DRB, and configure the protocol stack;

If D ox,t +D x,m >D px , set up waiting time THx to wait for idle resources of slice x; if there are idle resources within waiting time THx , set up new service m and its required DRB, And configure the protocol stack. If there is no idle resource within the waiting time, the establishment of the service will be abandoned.
A computer-readable storage medium in which one or more computer programs are stored, which when executed, are used to implement the method according to any one of claims 1-8.
A computing system comprising:

a storage device, and one or more processors;

Wherein, the storage device is used for storing one or more computer programs, and the computer programs are used for implementing the method according to any one of claims 1-8 when executed by the processor.