CN115119275A - Service slice switching method for network fine granularity - Google Patents
Service slice switching method for network fine granularity Download PDFInfo
- Publication number
- CN115119275A CN115119275A CN202210759143.5A CN202210759143A CN115119275A CN 115119275 A CN115119275 A CN 115119275A CN 202210759143 A CN202210759143 A CN 202210759143A CN 115119275 A CN115119275 A CN 115119275A
- Authority
- CN
- China
- Prior art keywords
- user
- slice
- base station
- available
- users
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/06—Reselecting a communication resource in the serving access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/16—Performing reselection for specific purposes
- H04W36/165—Performing reselection for specific purposes for reducing network power consumption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/24—Reselection being triggered by specific parameters
- H04W36/26—Reselection being triggered by specific parameters by agreed or negotiated communication parameters
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a slice switching method for network fine-grained service, which comprises the steps of firstly introducing a slice layer, converting the traditional matching relationship of a user-a base station into the matching relationship of the user-the slice-the base station, and realizing the switching of the user request access base station by the switching of the user request access slice to obtain the matching relationship of the user-the slice-the base station in a target area; and completing the access selection of the user and the slice, and the slice user and the base station through a Galshapril algorithm. The method can maximize the user rate as far as possible on the premise of ensuring the service continuity from the slicing angle, solves the problems that the traditional method taking the signal intensity as the switching standard cannot adapt to a new network architecture, how to improve the user rate and the like in a fine-grained slicing environment, can meet the user slicing switching under the new network architecture, and can improve the service rate sum obtained by the user in a target area.
Description
Technical Field
The invention belongs to the technical field of communication networks, and particularly relates to a service slice switching method aiming at network fine granularity.
Background
With the emergence and development of 5G technology, a great deal of industry verticals are coming into the internet, which greatly facilitates the application and development of internet technology, but also creates new impacts on traditional networks. A number of vertical industries bring new network requirements, such as three typical applications of 5G: the ultra-high reliability low-time delay communication uRLLC enhances mobile broadband eMBB and mass machine communication mMTC. Because different industry requirements may have many differences, even mutually exclusive technical indexes, the traditional network architecture of "one fit all" cannot meet the service requirements. The generation of network slicing technology becomes a key technology for solving the requirement of multiple services. Different requirements of services are met by constructing a logical end-to-end network according to different service requirements. Therefore, under a new network architecture, the network slicing technology has become a crucial new technology.
Due to the emergence of the network slicing technology, different slices are deployed for different base stations to meet different requirements, the situation that the traditional received signal is taken as a switching standard cannot adapt to a new network architecture, and a base station with the highest signal strength may not deploy a slice meeting the service requirement, so that a new user switching algorithm is urgently needed to meet the user switching under the new network architecture.
The data base stations for providing service requirements in the 5G network have the characteristics of tight distribution and small coverage range, when a user moves, if the current base station cannot meet the user requirements, the situation that a plurality of base stations can be selected can occur, and for the coarse-grained slice level, screening can be completed according to different types of slice numbers. With the continuous development of network requirements, in the face of slicing with finer granularity, for example, requirements of the urrllc service on automatic driving and telemedicine are different, how to switch the urrllc service according to the difference between the same service type and the requirements enables a user to obtain the best experience, and the direction of research becomes necessary.
Disclosure of Invention
The technical problem to be solved by the invention is to solve the problems that the traditional method based on signal strength as the switching standard can not adapt to a new network architecture, and how to improve the speed of a user in a fine-grained slicing environment; the invention provides a service slice switching method aiming at network fine granularity, which can not only meet the requirement of user slice switching under a new network architecture, but also improve the user rate of a system.
In order to solve the technical problems, the invention adopts the following technical scheme:
a service slice switching method aiming at network fine granularity executes the following steps aiming at a target area comprising base stations and a network environment which is respectively constructed by each base station and contains slices, and further realizes the switching of a user request access base station through the switching of the user request access slice so as to obtain the matching relation of the user-slice-base station in the target area:
step S1: aiming at each user in the target area, each user respectively obtains all slice resource information and all base station resource information which can be accessed by each user in the target area; aiming at each slice in the target area, each slice respectively obtains service request information of each user in the coverage area of the slice;
step S2: based on all slices and all base stations which are respectively corresponding to all users in a target area and can be accessed by the users, the users are used as user access selection objects, and an optimization model is constructed according to the maximum target and the service rate obtained by the users in the target area;
step S3: based on all slices and all base stations which can be accessed by each user in the target area respectively, the following steps are executed, the optimization model which takes the maximum user speed in the target area as the target is solved, and the matching relation of the users in the target area, the slices and the base stations is obtained:
step S3.1: based on all slice resource information which can be accessed by the user in the target area, each user respectively obtains the corresponding available slice; aiming at each available slice, combining the service rate provided by the available slice to the user, and respectively obtaining an available slice preference list corresponding to each user; combining the service request information of each user in the coverage area of the available slice, and respectively obtaining a corresponding user preference list by each available slice;
step S3.2: obtaining a user-slice matching relation in a target area based on the available slice preference lists respectively corresponding to the users and the user preference lists respectively corresponding to the available slices;
step S3.3: based on the user-slice matching relationship in the target area, combining the user to obtain all base station resource information which can be accessed in the target area, and each user respectively obtaining the corresponding available base station; aiming at each available base station, combining the resource information of the available base station and the matching relation between each user and the slice, and respectively obtaining a corresponding available base station preference list by each user; combining the service request information of each user matched with the sliced sheet on the base station, and respectively obtaining a corresponding user preference list by each available base station;
step S3.4: and obtaining the matching relation of the users, slices and the base stations in the target area based on the matching relation of the users and the slices in the target area by combining and based on the preference lists of the available base stations corresponding to the users and the preference lists of the users corresponding to the available base stations.
Further, in step S2, an optimization model is constructed with the maximum sum of user rates in the target area as a target, and an objective function is as follows:
in the formula (I), the compound is shown in the specification,
is a variable of 0, 1,
a 1 indicates that user i accesses the j slice on the k base station,
when the value is 0, the user i does not access the j slice on the k base station; k represents the total number of base stations in the target area; m represents the total number of slices in the target area; i represents the total number of users in the target area; r req Which is indicative of the traffic rate requirements of the user,
indicating the frequency band resources allocated by base station k for slice j,
indicating the power resources allocated by base station k for slice j,
representing the power resource obtained by the j slice of the user i accessing the k base station, i j Indicates the number of users accessing slice j,
represents the maximum number of bearer users of slice j of base station k, b k Denotes the frequency band resource of base station k, p k Representing the power resource of a base station k, and m represents the number of slices accessed to the base station k;
representing the service rate provided by the slice j for user i at base station k.
Further, in step S3.1, the following steps are specifically executed:
step S3.1.1: screening all slices which can be accessed by each user in the target area through the following formula to obtain the available slices corresponding to each user respectively:
wherein the content of the first and second substances,
in the formula (I), the compound is shown in the specification,
indicating the frequency band resources allocated by base station k for slice j,
indicating the power resources allocated by base station k for slice j,
is a variable of {0, 1},
a 1 indicates that user i accesses the j slice on the k base station,
a value of 0 indicates that user i does not access the j slice on the k base station,
indicating j slice acquisition for user i accessing k base stationPower resource of i j Indicates the number of users accessing slice j,
indicating the frequency band resources that the slice needs to provide to meet the minimum guaranteed rate,
representing the maximum number of load bearing users of a slice j of a base station k;
step S3.1.2: each user in the target area obtains a corresponding available slice preference list based on the available slices respectively corresponding to each user and the service rate provided to the user by the slices, wherein the higher the service rate provided to the user by the slices is, the higher the preference degree of the user to the slices is; each available slice in the target area respectively obtains a corresponding user preference list based on the user service rate requirement of each user in the slice coverage area, and the higher the user service rate requirement is, the higher the preference degree of the slice to the user is.
Further, in step S3.2, based on the available slice preference list corresponding to each user and the user preference list corresponding to each available slice, each user iteratively executes the following steps until each user in the target area is iterated, so as to obtain a user-slice matching relationship in the target area:
step S3.2.1: a user sends a matching request to an available slice with highest preference degree which does not send a request in a corresponding available slice preference list, and if the available slice preference list of the user does not have the slice which does not send the request, the user iteration is ended; if there is a slice that has not sent the request in the user's available slice preference list, the user sends a matching request to the available slice with the highest preference degree that has not sent the request in its corresponding available slice preference list, and then the process goes to step S3.2.2;
step S3.2.2: aiming at a matching request sent by a user, if an available slice receiving the matching request of the user does not reach the maximum number of bearing users, temporarily pairing the available slice with the user; if the available slice reaches the maximum number of the bearer users, and the matching request sent by the user is aimed at, the slice compares the service rate requirements of the current provisionally paired users and the current request sending user based on the corresponding user preference list, if the current provisionally paired users have users less than the current request sending user service rate requirement, the user with the minimum service rate requirement in the current provisionally paired users is removed, the current request sending user is added to the provisional pairing of the slice, and the removed user executes step S3.2.1; if there is no user with a traffic rate less than the traffic rate requirement of the user currently sending the request among the users currently provisionally paired, the user currently sending the request is executed to step S3.2.1.
Further, in step S3.3, based on the user-slice matching relationship in the target region, the following steps are specifically performed:
step S3.1: all users in the target area are screened by combining the following formula based on the user-slice matching relation in the target area, and all base stations which can be accessed by the users are obtained, wherein the available base stations respectively correspond to the users:
in the formula, b k Denotes the frequency band resource of base station k, p k Which represents the power resources of the base station k,
indicating the frequency band resources allocated by base station k for slice j,
the power resource distributed by the base station k for the slice j is represented, and m represents the number of slices accessed to the base station k;
step S3.2: each user in the target area combines the resource information of the base station and the matching relation between each user and the slice based on the available base station corresponding to each user, and combines the service rate provided to the user by the slice on the base station through the following formula, and each user respectively obtains the corresponding available base station preference list:
wherein the content of the first and second substances,
in the formula (I), the compound is shown in the specification,
representing the number of users on base station k for which j slices are currently accessed,
represents the maximum number of the bearing users of the slice j on the base station k, alpha and beta represent preset constants,
indicating the matching degree of the user i selecting the slice j to the base station k, the higher the matching degree, the higher the preference degree of the user to the base station,
representing the service rate provided by the slice j at base station k for user i,
represents the highest service rate, k, that user i can obtain in its corresponding available base station containing slice j j Indicating that the user corresponds to an available base station containing slice j;
and each available base station in the target area respectively obtains a corresponding user preference list based on the service rate requirement of each user matched with the sliced sheet on the base station, wherein the higher the service rate requirement of the user is, the higher the preference degree of the base station to the user is.
Further, in step S3.4, based on the user-slice matching relationship in the target area, in combination with the available base station preference list corresponding to each user and the user preference list corresponding to each available base station, each user iteratively performs the following steps until the user on each slice in the target area is iterated, so as to obtain the user-slice-base station matching relationship in the target area:
step S3.4.1: a user sends a matching request to an available base station which has not sent a request and has the highest preference degree and is provided with a user access slice, and if the available base station preference list of the user does not have a base station which has not sent a request and is provided with a user access slice, the user iteration is finished; if there is a base station which has not sent a request to deploy a user access slice in the preference list of the available base station of the user, the user sends a matching request to the available base station which has not sent a request and has the highest preference degree and deploys a user access slice in the preference list of the available base station corresponding to the user, and the step S3.4.2 is entered;
step S3.4.2: aiming at a matching request sent by a user, if the number of available base stations receiving the matching request of the user does not reach the maximum bearing user number, temporarily pairing the available base stations with the user; if the available base station reaches the maximum number of users carrying the user, aiming at the matching request sent by the user, the base station compares the service rate requirements of the current temporarily paired users and the current user sending the request based on the corresponding user preference list, if the current temporarily paired users have the user less than the current user service rate requirement sending the request, the user with the minimum service rate requirement in the current temporarily paired users is removed, the current user sending the request is added into the temporary pairing of the base station, and the removed user executes step S3.4.1; if there is no user with a traffic rate less than the traffic rate requirement of the user currently sending the request among the users currently provisionally paired, the user currently sending the request is executed to step S3.4.1.
The invention has the beneficial effects that: the invention provides a service slice switching method aiming at network fine granularity, aiming at a target area comprising base stations and a network architecture which is respectively constructed by each base station and comprises slices, switching of a user request access slice is realized through switching of the user request access base station, and the matching relation of the user-slice-base station in the target area is obtained; firstly, a slicing level is introduced, and the traditional matching relationship of a user and a base station is converted into the matching relationship of the user, the slice and the base station, so that the method is suitable for a new architecture after the network slicing technology appears. The user service switching is embodied on the slice switching, and the complete switching flow process is divided into two stages to complete the matching selection. And finally, completing the access selection between the user and the slice and between the slice user and the base station based on a Galshapril algorithm. The method can maximize the user rate as far as possible on the premise of ensuring the service continuity from the slicing angle, solves the problems that the traditional method taking the signal intensity as the switching standard cannot adapt to a new network architecture, how to improve the user rate and the like in a fine-grained slicing environment, can meet the user slicing switching under the new network architecture, and can improve the service rate sum obtained by the user in a target area.
Drawings
Fig. 1 is a system diagram of an access network for deploying network slices in a network architecture according to the present embodiment;
fig. 2 is a schematic diagram illustrating the matching and splitting of the user-slice-base station in the present embodiment;
fig. 3 is a flowchart of an algorithm for solving the matching relationship between the user, the slice and the base station according to the embodiment.
Detailed Description
The invention is further described below with reference to the accompanying drawings. The following examples will provide those skilled in the art with a more complete understanding of the present invention, but are not intended to limit the invention in any way.
Based on an access network system for deploying network slices under a network architecture shown in figure 1, the invention provides a fine-grained service slice switching method based on a Gelseapril algorithm, which divides the matching of a user, a slice and a base station into two-stage matching, as shown in figure 2, and completes the matching solution by using the Gelseapril algorithm.
The invention applies the matching idea of the Gelseapril algorithm to the user service slice switching scene, firstly introduces the slice level, converts the traditional user-base station matching relationship into the user-slice-base station matching relationship, and adapts to the new architecture after the network slice technology appears. The user service switching is embodied on the slice switching, and the complete switching process is divided into two stages to complete the matching selection. And finally, completing the access selection between the user and the slice and between the slice user and the base station based on a Galshapril algorithm. The method starts from the slicing angle, and can maximize the user speed as much as possible on the premise of ensuring the service continuity.
The technical problem to be solved by the invention is to solve the problems that the traditional method based on signal strength as the switching standard can not adapt to a new network architecture, and how to improve the speed of a user in a fine-grained slicing environment; the invention provides a service slice switching method aiming at network fine granularity, which can not only meet the requirement of user slice switching under a new network architecture, but also improve the user rate of a system.
The invention adopts the following technical scheme: a service slice switching method for network fine granularity is aimed at a target area comprising base stations and a network environment which is respectively constructed by the base stations and contains slices, wherein the target area is an overall scene, for example, a 300-300 area only considers that the total number of the base stations, the total number of the slices and the total number of users in the area; and executing the following steps, namely switching the user request access slice so as to realize the switching of the user request access base station, and obtaining the matching relation of the user-slice-base station in the target area.
Step S1: aiming at each user in the target area, each user respectively obtains all slice resource information and all base station resource information which can be accessed by each user in the target area; aiming at each slice in the target area, each slice respectively obtains the service request information of each user in the coverage area.
In the network architecture, both the user and the base station have basic sensing capability, that is, the user can obtain all available slice resource information in the current environment, and the base station can sense the user and obtain the request access information of the user in the coverage area, so that the switched architecture is changed from the matching of the user and the base station to the matching of the base station, the slice and the user. In the face of the matching relation, under the condition that the two matching parties need to negotiate with each other, a Galsaipril algorithm is used, and the method can maximize the user rate as much as possible on the premise of ensuring the service continuity from the viewpoint of slicing.
Step S2: and constructing an optimization model by taking the maximum target and the service rate obtained by the users in the target area as targets based on that all the users in the target area respectively correspond to all slices and all base stations which can be accessed by the users as user access selection objects.
In step S2, an optimization model is constructed with the maximum user rate sum in the target area as a target, and an objective function is as follows:
in the formula (I), the compound is shown in the specification,
is a variable of {0, 1},
a 1 indicates that user i accesses the j slice on the k base station,
when the value is 0, the user i does not access the j slice on the k base station; k represents the total number of base stations in the target area; m represents the total number of slices in the target area; i represents the total number of users in the target area; r req Which is indicative of the traffic rate requirements of the user,
indicating the frequency band resources allocated by base station k for slice j,
indicating the power resources allocated by base station k for slice j,
representing the power resource obtained by the j slice of the user i accessing the k base station, i j Indicates the number of users accessing slice j,
represents the maximum number of bearer users of slice j of base station k, b k Denotes the frequency band resource of base station k, p k Representing the power resource of a base station k, and m represents the number of slices accessed to the base station k;
representing the service rate provided by the j slice for user i at base station k.
C1 denotes slice j access at base station kThe number of users is smaller than the maximum number of users, and C2 represents the power of the user accessing the slice j on the base station k and the power smaller than the allocated power. C3 indicates that the bandwidth resource allocated to all slices at base station k is less than the total bandwidth of base station k, and C4 indicates that the power resource allocated to all slices at base station k is less than the total power of base station k. C5 denotes the required rate for user traffic expressed as R req When the user switches, the target slice should be guaranteed
That is, the user only sends a request to the slice whose minimum service rate is greater than or equal to the required rate, and performs a service to ensure service continuity, C6 indicates that a user can only access one slice of a base station.
Step S3: based on all slices and all base stations which can be accessed by each user in the target area respectively, the following steps are executed, the optimization model which takes the maximum user speed in the target area as the target is solved, the matching relation of the users, the slices and the base stations is completed in two stages through a Galshapril algorithm as shown in figure 3, firstly, the matching relation of the users and the slices is obtained, then, the base stations in the second stage are selected, and the matching relation of the users, the slices and the base stations in the target area is obtained.
One user can access only one slice, and one slice can receive multiple users. The relation between the slice and the base station is established when the slice is deployed, one slice can be deployed on a plurality of base stations, a plurality of slices can be deployed on one base station, and the matching of the user-slice-base station is decomposed into two matching stages of the user-slice and the slice user-base station.
Step S3.1: based on all slice resource information which can be accessed by the user in the target area, each user respectively obtains the corresponding available slice; aiming at each available slice, combining the service rate provided by the available slice to the user, and respectively obtaining an available slice preference list corresponding to each user; combining the service request information of each user in the coverage area of the available slice, and respectively obtaining a corresponding user preference list by each available slice;
in step S3.1, the following steps are specifically performed:
step S3.1.1: screening all slices which can be accessed by each user in the target area through the following formula to obtain the available slices corresponding to each user respectively:
slicing the frequency band resource provided by meeting the minimum guaranteed rate requirement as
The maximum number of bearers for slice j of base station k is:
the bandwidth constraint can be converted into that the number of slice service users does not exceed the maximum bearer number:
in summary, each user in the target area filters all slices that can be accessed by the user through the following formula, and obtains an available slice corresponding to each user:
in the formula (I), the compound is shown in the specification,
indicating the frequency band resources allocated by base station k for slice j,
indicating the power resources allocated by base station k for slice j,
is a variable of {0, 1},
a 1 indicates that user i accesses the j slice on the k base station,
a value of 0 indicates that user i does not access the j slice on the k base station,
representing the power resource obtained by the j slice of the user i accessing the k base station, i j Indicates the number of users accessing slice j,
indicating the frequency band resources that the slice needs to provide to meet the minimum guaranteed rate,
representing the maximum number of bearing users of the slice j of the base station k; the first constraint indicates that bandwidth resources allocated to a user accessing to a slice j on a base station k cannot exceed the bandwidth allocated to the slice j by the base station k; the second constraint indicates that the power resources allocated to a user accessing a slice j at base station k cannot exceed the power allocated to the slice j by base station k.
Step S3.1.2: each user in the target area respectively obtains a corresponding available slice preference list based on the available slice corresponding to each user and the service rate provided by the slice to the user, wherein the higher the service rate provided by the slice to the user is, the higher the preference degree of the user to the slice is; each available slice in the target area respectively obtains a corresponding user preference list based on the user service rate requirement of each user in the slice coverage area, and the higher the user service rate requirement is, the higher the preference degree of the slice to the user is.
Step S3.2: obtaining a user-slice matching relation in a target area based on the available slice preference lists respectively corresponding to the users and the user preference lists respectively corresponding to the available slices;
in the step S3.2, based on the available slice preference lists corresponding to the users respectively and the user preference lists corresponding to the available slices respectively, each user iteratively executes the following steps until each user in the target area is iterated, so as to obtain a user-slice matching relationship in the target area:
step S3.2.1: a user sends a matching request to an available slice with highest preference degree which does not send a request in a corresponding available slice preference list, and if the available slice preference list of the user does not have the slice which does not send the request, the user iteration is ended; if there is a slice that has not sent the request in the user's available slice preference list, the user sends a matching request to the available slice with the highest preference degree that has not sent the request in its corresponding available slice preference list, and then the process goes to step S3.2.2;
step S3.2.2: aiming at a matching request sent by a user, if an available slice receiving the matching request of the user does not reach the maximum number of bearing users, temporarily pairing the available slice with the user; if the available slice reaches the maximum number of the bearer users, and the matching request sent by the user is aimed at, the slice compares the service rate requirements of the current provisionally paired users and the current request sending user based on the corresponding user preference list, if the current provisionally paired users have users less than the current request sending user service rate requirement, the user with the minimum service rate requirement in the current provisionally paired users is removed, the current request sending user is added to the provisional pairing of the slice, and the removed user executes step S3.2.1; if there is no user with a traffic rate less than the traffic rate requirement of the user currently sending the request among the users currently provisionally paired, the user currently sending the request is executed to step S3.2.1.
As shown in fig. 3, in the user-slice matching stage, for the user side, each user wants to obtain the best service experience, and under the current service, the user will select the slice access with the largest minimum rate index, so the order of the user's preference list is the user rate obtained by the user access
The sequence is that for the slice side, the slice can be accessed for the incoming user access request before reaching the maximum load number, when reaching the maximum load number, according to the speed requirement R of the user req Selecting users with high service requirement as candidate users, switching out users with low service rate requirement from the candidate users, and sequentially setting the preference list at the slice side as R of the service requirement of the users req . And adding the cut-out user into the switching user set, quitting the slice user set by the user to be selected, carrying out next matching request on the cut-out user until all the users traverse the corresponding available slices, finishing selection, quitting the switching user level for the user which does not access the slice by traversing the corresponding available slices, not providing corresponding service in the matching process, re-initiating the service request by the user, and finally respectively obtaining the slice user sets corresponding to the slices by the available slices.
Step S3.3: based on the user-slice matching relationship in the target area, combining the user to obtain all base station resource information which can be accessed in the target area, and each user respectively obtaining the corresponding available base station; aiming at each available base station, combining the resource information of the available base station and the matching relation between each user and the slice, and respectively obtaining a corresponding available base station preference list by each user; and combining the service request information of each user matched with the sliced sheet on the base station, and respectively obtaining the corresponding user preference list by each available base station.
In step S3.3, based on the user-slice matching relationship in the target region, the following steps are specifically performed:
step S3.1: all users in the target area are screened by combining the following formula based on the user-slice matching relation in the target area, and all base stations which can be accessed by the users are obtained, wherein the available base stations respectively correspond to the users:
in the formula, b k Denotes the frequency band resource of base station k, p k Which represents the power resources of the base station k,
indicating the frequency band resources allocated by base station k for slice j,
the power resource distributed by the base station k for the slice j is represented, and m represents the number of slices accessed to the base station k; these two constraints represent the base station versus the deployed slice resources and the resources that are smaller than the base station itself.
The first stage user-base station matching is affected by the first stage user-slice, and since the deployment of base stations and slices has been initialized, a candidate list of base stations for a slice is determined and only the base station deploying the slice can be selected. Assume that the set of base stations deployed with the jth slice is k j Where j ∈ {1, 2.,..,. M }, and k ∈ { k }, M }, k ∈ 1 ,k 2 ,......,k j }. For user i, after the slice j selected in the first stage matching, the selectable base stations can only be limited to k j . For the same slice deployed by different base stations, the guaranteed rates provided by the slices are the same, but because the distances between the users and the base stations are different, the rates obtained by the users accessing the same slice are different, and the user side can complete rate normalization according to the ratio of the rates provided by the different base stations to the maximum rate available in all the base stations, as shown below:
step S3.2: each user in the target area combines the resource information of the base station and the matching relation between each user and the slice based on the available base station corresponding to each user, and combines the service rate provided by the slice on the base station to the user through the following formula, and each user respectively obtains the corresponding available base station preference list:
wherein the content of the first and second substances,
considering load balance, number of users accessing current slice of base station
And maximum number of bearer users
The saturation of the current base station is expressed by the ratio of the load pressure to the base station, and when the N is larger, the load pressure is larger, and the probability of selecting access is smaller.
In the formula (I), the compound is shown in the specification,
representing the number of users on base station k for which j slices are currently accessed,
the maximum number of the bearing users of the slice j on the base station k is represented, alpha and beta represent preset constants, the weight of load balance and user rate is represented, and for convenient expression, the weight is 0.5 in the embodiment and can be adjusted according to actual conditions;
the matching degree of the user i selecting the slice j to the base station k is shown, the higher the matching degree is, the higher the preference degree of the user to the base station is, the higher the priority of the base station is, the greater the probability of being selected is,
representing the service rate provided by the slice j at base station k for user i,
indicates the highest service rate available to user i in its corresponding available base station containing slice j, i.e., the highest service rate available in the selected base station, k j Indicating that the user corresponds to an available base station containing slice j.
And each available base station in the target area respectively obtains a corresponding user preference list based on the service rate requirement of each user matched with the slice on the base station, wherein the higher the service rate requirement of the user is, the higher the preference degree of the base station to the user is.
Step S3.4: and obtaining the matching relation of the users, slices and the base stations in the target area based on the matching relation of the users and the slices in the target area by combining and based on the preference lists of the available base stations corresponding to the users and the preference lists of the users corresponding to the available base stations.
In step S3.4, based on the user-slice matching relationship in the target area, combining the available base station preference lists corresponding to the users respectively and the user preference lists corresponding to the available base stations respectively, each user iteratively performs the following steps until the user on each slice in the target area is completely iterated, thereby obtaining the user-slice-base station matching relationship in the target area:
step S3.4.1: a user sends a matching request to an available base station which has not sent a request and has the highest preference degree and is provided with a user access slice, and if the available base station preference list of the user does not have a base station which has not sent a request and is provided with a user access slice, the user iteration is finished; if there is a base station which has not sent a request to deploy a user access slice in the preference list of the available base station of the user, the user sends a matching request to the available base station which has not sent a request and has the highest preference degree and deploys a user access slice in the preference list of the available base station corresponding to the user, and the step S3.4.2 is entered;
step S3.4.2: aiming at a matching request sent by a user, if the available base station receiving the user matching request does not reach the maximum bearing user number, temporarily pairing the available base station with the user; if the available base station reaches the maximum number of users carrying the user, aiming at the matching request sent by the user, the base station compares the service rate requirements of the current temporarily paired users and the current user sending the request based on the corresponding user preference list, if the current temporarily paired users have the user less than the current user service rate requirement sending the request, the user with the minimum service rate requirement in the current temporarily paired users is removed, the current user sending the request is added into the temporary pairing of the base station, and the removed user executes step S3.4.1; if there is no user with a traffic rate less than the traffic rate requirement of the user currently sending the request among the users currently provisionally paired, the user currently sending the request is executed to step S3.4.1.
As shown in fig. 3, in the slice user-base station selection stage, after the user-slice matching stage is completed, a user list that needs to be accessed on each slice, that is, a slice user set, is obtained, and in consideration of the access load condition of the base station and the rate provided by the base station as matching indexes, and in combination with the available base station preference list corresponding to each user and the user preference list corresponding to each available base station, slice users are allocated to the accessible base stations until all slice users traverse their corresponding available base stations, and the selection is completed, thereby completing the re-access of the users and realizing complete handover; for the user which traverses the corresponding available base station and still has no access to the base station, the corresponding slice user set is exited, corresponding service is not provided in the matching process, and the user initiates a service request again.
Moreover, based on the generation of the network slicing technology, a logical end-to-end network can be constructed as required according to different service requirements, so that different requirements of services can be met. Therefore, under the network architecture which is respectively constructed by each base station and contains slices, the corresponding slices for processing the corresponding services can be accessed through the division of the service types requested by the user, and then the base stations are accessed, so that the receiving and processing speed of the user services is increased, and the utilization rate of network resources is improved.
The invention designs a service slice switching method aiming at network fine granularity, aiming at a target area comprising base stations and a network architecture which is respectively constructed by each base station and comprises slices, firstly, a slice layer is introduced, the traditional user-base station matching relation is converted into the user-slice-base station matching relation, and the new architecture is adapted to the new architecture after the network slice technology appears. The user service switching is embodied on the slice switching, and the complete switching process is divided into two stages to complete the matching selection. And finally, completing the access selection between the user and the slice and between the slice user and the base station based on a Galshapril algorithm. The method can maximize the user rate as far as possible on the premise of ensuring the service continuity from the slicing angle, solves the problems that the traditional method taking the signal intensity as the switching standard cannot adapt to a new network architecture, how to improve the user rate and the like in a fine-grained slicing environment, can meet the user slicing switching under the new network architecture, and can improve the service rate sum obtained by the user in a target area.
Although the present invention has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that modifications may be made to the embodiments described in the foregoing detailed description, or equivalent changes may be made in some of the features of the embodiments described above. All equivalent structures made by using the contents of the specification and the attached drawings of the invention can be directly or indirectly applied to other related technical fields, and all the equivalent structures are within the protection scope of the invention.
Claims (6)
1. A service slice switching method aiming at network fine granularity is characterized in that: aiming at a target area comprising base stations and a network environment which is respectively constructed by each base station and contains slices, the following steps are executed, the switching of the user request access slices is realized, the switching of the user request access base stations is further realized, and the matching relation of the user-slices-base stations in the target area is obtained:
step S1: aiming at each user in the target area, each user respectively obtains all slice resource information and all base station resource information which can be accessed by each user in the target area; aiming at each slice in the target area, each slice respectively obtains service request information of each user in the coverage area of the slice;
step S2: based on all slices and all base stations which are respectively corresponding to all users in a target area and can be accessed by the users, the users are used as user access selection objects, and an optimization model is constructed according to the maximum target of the sum of service rates obtained by the users in the target area;
step S3: based on all slices and all base stations which can be accessed by each user in the target area respectively, the following steps are executed, the optimization model which takes the maximum user speed in the target area as the target is solved, and the matching relation of the users in the target area, the slices and the base stations is obtained:
step S3.1: based on all slice resource information which can be accessed by the user in the target area, each user respectively obtains the corresponding available slice; aiming at each available slice, combining the service rate provided by the available slice to the user, and respectively obtaining an available slice preference list corresponding to each user; combining the service request information of each user in the coverage area of the available slice, and respectively obtaining a corresponding user preference list by each available slice;
step S3.2: obtaining a user-slice matching relation in a target area based on the available slice preference lists corresponding to the users respectively and the user preference lists corresponding to the available slices respectively;
step S3.3: based on the user-slice matching relationship in the target area, combining the user to obtain all base station resource information which can be accessed in the target area, and each user respectively obtaining the corresponding available base station; aiming at each available base station, combining the resource information of the available base station and the matching relation between each user and the slice, and respectively obtaining a corresponding available base station preference list by each user; combining the service request information of each user matched with the slicing on the base station, and respectively obtaining a corresponding user preference list by each available base station;
step S3.4: and based on the user-slice matching relationship in the target area, combining the available base station preference list corresponding to each user and the user preference list corresponding to each available base station to obtain the user-slice-base station matching relationship in the target area.
2. The method for switching the traffic slice aiming at the network fine granularity according to claim 1, characterized in that: in step S2, an optimization model is constructed with the maximum user rate sum in the target area as a target, and an objective function is as follows:
in the formula (I), the compound is shown in the specification,
is a variable of 0, 1,
a 1 indicates that user i accesses the j slice on the k base station,
when the value is 0, the user i does not access the j slice on the k base station; k represents the total number of base stations in the target area; m represents the total number of slices in the target region; i represents the total number of users in the target area; r req Which is indicative of the traffic rate requirements of the user,
indicating the frequency band resources allocated by base station k for slice j,
indicating the power resources allocated by base station k for slice j,
representing the power resource obtained by the j slice of the user i accessing the k base station, i j Indicates the number of users accessing slice j,
represents the maximum number of bearer users of slice j of base station k, b k Denotes the frequency band resource of base station k, p k Representing the power resource of a base station k, and m represents the number of slices accessed to the base station k;
representing the service rate provided by the j slice for user i at base station k.
3. The method for switching the service slice aiming at the network fine granularity according to claim 1, characterized in that: in step S3.1, the following steps are specifically performed:
step S3.1.1: screening all slices which can be accessed by each user in the target area through the following formula to obtain the available slices corresponding to each user respectively:
wherein the content of the first and second substances,
in the formula (I), the compound is shown in the specification,
indicating the frequency band resources allocated by base station k for slice j,
indicating the power resources allocated by base station k for slice j,
is a variable of {0, 1},
a 1 indicates that user i accesses the j slice on the k base station,
a value of 0 indicates that user i does not access the j slice on the k base station,
representing the power resource obtained by the j slice of the user i accessing the k base station, i j Showing and connectingThe number of users to enter slice j,
indicating the frequency band resources that the slice needs to provide to meet the minimum guaranteed rate,
representing the maximum number of load bearing users of a slice j of a base station k;
step S3.1.2: each user in the target area respectively obtains a corresponding available slice preference list based on the available slice corresponding to each user and the service rate provided by the slice to the user, wherein the higher the service rate provided by the slice to the user is, the higher the preference degree of the user to the slice is; and each available slice in the target area respectively obtains a corresponding user preference list based on the user service rate requirement of each user in the slice coverage area, and the higher the user service rate requirement is, the higher the preference degree of the slice to the user is.
4. The method for switching the service slice aiming at the network fine granularity according to claim 1, characterized in that: in step S3.2, based on the available slice preference lists corresponding to the users and the user preference lists corresponding to the available slices, the users perform the following steps iteratively until the users in the target area complete the iteration, so as to obtain the user-slice matching relationship in the target area:
step S3.2.1: a user sends a matching request to an available slice with highest preference degree which does not send a request in a corresponding available slice preference list, and if the available slice preference list of the user does not have the slice which does not send the request, the user iteration is ended; if there is a slice which has not sent the request in the available slice preference list of the user, the user sends a matching request to the available slice which has not sent the request and has the highest preference degree in the corresponding available slice preference list, and the step S3.2.2 is entered;
step S3.2.2: aiming at a matching request sent by a user, if an available slice receiving the matching request of the user does not reach the maximum number of bearing users, temporarily pairing the available slice with the user; if the available slice reaches the maximum number of the bearer users, and the matching request sent by the user is aimed at, the slice compares the service rate requirements of the current provisionally paired users and the current request sending user based on the corresponding user preference list, if the current provisionally paired users have users less than the current request sending user service rate requirement, the user with the minimum service rate requirement in the current provisionally paired users is removed, the current request sending user is added to the provisional pairing of the slice, and the removed user executes step S3.2.1; if there is no user with a traffic rate less than the traffic rate requirement of the user currently sending the request among the users currently provisionally paired, the user currently sending the request is executed to step S3.2.1.
5. The method for switching the service slice aiming at the network fine granularity according to claim 1, characterized in that: in step S3.3, based on the user-slice matching relationship in the target region, the following steps are specifically performed:
step S3.1: all users in the target area are screened by combining the following formula based on the user-slice matching relation in the target area, and all base stations which can be accessed by the users are obtained, wherein the available base stations respectively correspond to the users:
in the formula, b k Denotes the frequency band resource of base station k, p k Which represents the power resources of the base station k,
indicating the frequency band resources allocated by base station k for slice j,
the power resource distributed by the base station k for the slice j is represented, and m represents the number of slices accessed to the base station k;
step S3.2: each user in the target area combines the resource information of the base station and the matching relation between each user and the slice based on the available base station corresponding to each user, and combines the service rate provided by the slice on the base station to the user through the following formula, and each user respectively obtains the corresponding available base station preference list:
wherein, the first and the second end of the pipe are connected with each other,
in the formula (I), the compound is shown in the specification,
representing the number of users on base station k for which j slices are currently accessed,
represents the maximum number of the bearing users of the slice j on the base station k, alpha and beta represent preset constants,
indicating the matching degree of the user i selecting the slice j to the base station k, the higher the matching degree, the higher the preference degree of the user to the base station,
representing the service rate provided by slice j for user i at base station k,
indicating that user i is available in its corresponding available base station containing slice jThe maximum service rate, k, obtained j Indicating that the user corresponds to an available base station containing slice j;
and each available base station in the target area respectively obtains a corresponding user preference list based on the service rate requirement of each user matched with the sliced sheet on the base station, wherein the higher the service rate requirement of the user is, the higher the preference degree of the base station to the user is.
6. The method for switching the service slice aiming at the network fine granularity according to claim 1, characterized in that: in step S3.4, based on the user-slice matching relationship in the target area, combining the available base station preference lists corresponding to the users respectively and the user preference lists corresponding to the available base stations respectively, each user iteratively executes the following steps until the user on each slice in the target area is iterated, thereby obtaining the user-slice-base station matching relationship in the target area:
step S3.4.1: a user sends a matching request to an available base station which has not sent a request and has the highest preference degree and is provided with a user access slice, and if the available base station preference list of the user does not have a base station which has not sent a request and is provided with a user access slice, the user iteration is finished; if there is a base station that has not sent a request to deploy a user access slice in the preference list of the available base station of the user, the user sends a matching request to the available base station that has not sent a request and has the highest preference degree to deploy a user access slice in the preference list of the corresponding available base station, and the process goes to step S3.4.2;
step S3.4.2: aiming at a matching request sent by a user, if the number of available base stations receiving the matching request of the user does not reach the maximum bearing user number, temporarily pairing the available base stations with the user; if the available base station reaches the maximum number of the bearer users, the base station compares the service rate requirements of the current provisionally paired users and the current user sending the request based on the corresponding user preference list aiming at the matching request sent by the user, if the current provisionally paired users have a user less than the service rate requirement of the current user sending the request, the user with the minimum service rate requirement in the current provisionally paired users is removed, the current user sending the request is added into the provisional pairing of the base station, and the removed user executes step S3.4.1; if there is no user with a traffic rate less than the traffic rate requirement of the user currently sending the request among the users currently provisionally paired, the user currently sending the request is executed to step S3.4.1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210759143.5A CN115119275B (en) | 2022-06-29 | 2022-06-29 | Service slice switching method aiming at network fine granularity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210759143.5A CN115119275B (en) | 2022-06-29 | 2022-06-29 | Service slice switching method aiming at network fine granularity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115119275A true CN115119275A (en) | 2022-09-27 |
| CN115119275B CN115119275B (en) | 2023-07-25 |
Family
ID=83331321
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210759143.5A Active CN115119275B (en) | 2022-06-29 | 2022-06-29 | Service slice switching method aiming at network fine granularity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115119275B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107682135A (en) * | 2017-09-30 | 2018-02-09 | 重庆邮电大学 | A kind of network slice adaptive virtual resource allocation method based on NOMA |
| US20210127437A1 (en) * | 2019-10-25 | 2021-04-29 | Kabushiki Kaisha Toshiba | Resource slicing in a wireless communication network |
| US20210204164A1 (en) * | 2019-12-31 | 2021-07-01 | Celona, Inc. | Method and apparatus for microslicing wireless communication networks with device groups, service level objectives, and load/admission control |
| US20210219204A1 (en) * | 2018-09-29 | 2021-07-15 | Huawei Technologies Co., Ltd. | Load balancing method and apparatus |
| US20210258430A1 (en) * | 2020-01-24 | 2021-08-19 | Parallel Wireless, Inc. | 5G Slice Pricing Function |
-
2022
- 2022-06-29 CN CN202210759143.5A patent/CN115119275B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107682135A (en) * | 2017-09-30 | 2018-02-09 | 重庆邮电大学 | A kind of network slice adaptive virtual resource allocation method based on NOMA |
| US20210219204A1 (en) * | 2018-09-29 | 2021-07-15 | Huawei Technologies Co., Ltd. | Load balancing method and apparatus |
| US20210127437A1 (en) * | 2019-10-25 | 2021-04-29 | Kabushiki Kaisha Toshiba | Resource slicing in a wireless communication network |
| US20210204164A1 (en) * | 2019-12-31 | 2021-07-01 | Celona, Inc. | Method and apparatus for microslicing wireless communication networks with device groups, service level objectives, and load/admission control |
| US20210258430A1 (en) * | 2020-01-24 | 2021-08-19 | Parallel Wireless, Inc. | 5G Slice Pricing Function |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115119275B (en) | 2023-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7865192B2 (en) | Radio frequency selection device, a radio communication system and radio control channel establishing method | |
| CN109194763B (en) | Caching method based on small base station self-organizing cooperation in ultra-dense network | |
| US8520639B2 (en) | Apparatus and method for performing handover in advanced mobile communication system | |
| CN108966285B (en) | 5G network load balancing method based on service type | |
| US11729746B2 (en) | Base station, system, and method | |
| US11019563B1 (en) | Customer premises equipment (CPE) self-organization in fixed wireless access (FWA) network | |
| Zhu et al. | Adaptive multi-access algorithm for multi-service edge users in 5G ultra-dense heterogeneous networks | |
| CN108076531B (en) | Multi-service provider-oriented dynamic allocation method for wireless network slice resources | |
| KR101872658B1 (en) | Method and apparatus for adjusting air interface capacity density | |
| CN111510926A (en) | Visible light communication and WiFi heterogeneous convergence network and resource scheduling method | |
| CN113784373A (en) | Combined optimization method and system for time delay and frequency spectrum occupation in cloud edge cooperative network | |
| CN111465066A (en) | Network selection and mobility management method for multi-connection technology of power internet of things | |
| JP2015507418A (en) | Group terminal mobility management method, mobility management system, and mobility management apparatus | |
| CN115190436A (en) | Communication method, device and system | |
| CN100547952C (en) | N frequency point networking method | |
| CN108834003B (en) | Electric power optical carrier communication multidimensional resource distribution optimization method for quantum communication service | |
| Aljbour et al. | An inter/intra slice handover scheme for mobility management in 5G network | |
| Wang et al. | Millimeter-wave mobile communications | |
| CN115119275A (en) | Service slice switching method for network fine granularity | |
| JP2002171574A (en) | Method for assigning channel code to synchronous reverse link in mobile communication wireless network | |
| CN107835514B (en) | Modeling method for wireless network resource matching in multi-host service scene | |
| CN107071911B (en) | Virtual cell carrier allocation method based on maximum SNR | |
| CN110324869A (en) | A kind of user access method and base station | |
| CN107124726B (en) | Multi-beam GEO system access control method based on maximized throughput | |
| KR20220152069A (en) | Method and apparatus for supporting selecting user plane function in a wireless communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |