CN115119275B - Service slice switching method aiming at network fine granularity - Google Patents
Service slice switching method aiming at network fine granularity Download PDFInfo
- Publication number
- CN115119275B CN115119275B CN202210759143.5A CN202210759143A CN115119275B CN 115119275 B CN115119275 B CN 115119275B CN 202210759143 A CN202210759143 A CN 202210759143A CN 115119275 B CN115119275 B CN 115119275B
- Authority
- CN
- China
- Prior art keywords
- user
- slice
- base station
- available
- slices
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000005457 optimization Methods 0.000 claims description 9
- 238000005516 engineering process Methods 0.000 description 11
- 238000004891 communication Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for switching network fine granularity service slices, which comprises the steps of firstly introducing a slice layer, converting the traditional matching relationship between a user and a base station into the matching relationship between the user and the slice and the base station, and switching an access slice by a user request so as to realize the switching of the access base station by the user request and obtain the matching relationship between the user and the slice and the base station in a target area; and completing access selection of users and slices and access selection of slice users and base stations through a Gersapril algorithm. The method can maximize the user rate under the premise of ensuring the service continuity from the aspect of slicing, solves the problems that the traditional method which takes the signal strength as a switching standard cannot adapt to a new network architecture, and how to improve the user rate and the like under the fine-granularity slicing environment, can not only meet the user slicing switching under the new network architecture, but also improve the service rate sum obtained by the users 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 advent and development of 5G technology, a large number of vertical industries have been rushing into the internet, which has greatly facilitated the application and development of internet technology, but has also created new impacts on traditional networks. A large number of vertical industries bring new network demands, such as three large typical applications of 5G: ultra-high reliability low-delay communication uRLLC, and mobile broadband eMBB and mass machine communication mMTC are enhanced. Because there may be many differences between different industry requirements, and even mutually exclusive technical indexes appear, 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. By constructing a logical end-to-end network according to different service demands, different demands of the service are met. Under new network architecture, network slicing technology has become a vital new technology.
Because of the advent of network slicing technology, different slices can be deployed for different base stations to meet different requirements, and the situation that a traditional received signal is used as a switching standard cannot be adapted to a new network architecture, because the base station with the highest signal strength may not be deployed with a slice meeting the service requirements, a new user switching algorithm is needed to meet the user switching under the new network architecture.
The data base stations for providing service demands in the 5G network have the characteristics of compact distribution and small coverage range, when a user is moving, if the current base station cannot meet the user demands, the situation that a plurality of base stations can be selected can occur, and for a coarse-granularity slice layer, the screening can be completed according to different types of slice numbers. With the continuous development of network demands, the method is faced with finer granularity of slice division, for example, the requirements of uRLLC business on automatic driving and telemedicine are different, and the best experience can be obtained by switching the business according to the same business type but the difference in requirements, so that the method is a direction needing to be studied.
Disclosure of Invention
The technical problem to be solved by the invention is to solve the problems that the traditional method which takes the signal strength as the switching standard cannot adapt to a new network architecture, how to improve the speed and the like of a user in a fine granularity slicing environment; the invention provides a service slice switching method aiming at network fine granularity, which not only can meet the requirement of user slice switching under a new network architecture, but also can improve the user rate and the user rate of a system.
In order to solve the technical problems, the invention adopts the following technical scheme:
The method for switching the service slices aiming at the network fine granularity comprises the following steps of aiming at a target area comprising base stations and a network environment comprising slices respectively constructed by all the base stations, switching access slices by a user request, and further realizing switching of the user request access base stations, and obtaining a matching relationship of the user-slice-base stations 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 the 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;
step S2: based on all the slices and all the base stations which can be accessed by each user in the target area, taking the slices and all the base stations which can be accessed by each user as an access selection object of the user, and constructing an optimization model by taking the service rate and the maximum obtained by the user in the target area as targets;
step S3: based on all the slices and all the base stations which can be accessed by each user in the target area, the following steps are executed, and the optimization model which aims at the maximum user rate in the target area is solved, so that the matching relation of the user in the target area, the slice and the base station is obtained:
Step S3.1: based on the information of all the slice resources which can be accessed by the user in the target area, each user respectively obtains the corresponding available slices; for each available slice, combining the service rates provided by the available slices to users, and each user respectively obtaining a corresponding available slice preference list; combining service request information of each user in the coverage area of the available slices, and each available slice respectively obtaining a corresponding user preference list;
step S3.2: obtaining a user-slice matching relationship in a target area based on the available slice preference list corresponding to each user and the user preference list corresponding to each available slice;
step S3.3: based on the user-slice matching relationship in the target area, combining the user to obtain all the base station resource information which can be accessed by the user in the target area, and each user respectively obtains the corresponding available base stations; for each available base station, combining the resource information of the available base station and the matching relation between each user and the slice, each user respectively obtains a corresponding available base station preference list; combining the service request information of each user matched with the slice on the base station, and each available base station respectively obtaining a corresponding user preference list;
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 matching relationship of the user-slice-base station in the target area.
Further, in the step S2, an optimization model is constructed with the maximum user rate sum in the target area as a target, and the objective function is as follows:
in the method, in the process of the invention,is a {0, 1} variable, }>When 1, it indicates that user i accesses j slices on k base stations, ">When 0, the j slices on the k base stations are not accessed by the user i; k represents the total number of base stations in the target area; m representsTotal number of slices within the target region; i represents the total number of users in the target area; r is R req Representing user traffic rate demand,/->Indicating the band resources allocated by base station k for slice j, < >>Indicating the power resource allocated by base station k for slice j, < >>Representing the power resources i obtained by accessing user i to j slices on k base stations j Representing the number of users accessing slice j +.>Representing the maximum number of users carrying slices j of base station k, b k Representing the band resources of base station k, p k Representing the power resource of the base station k, and m represents the number of slices accessed to the base station k; / >Indicating the rate of service provided by j slices at base station k for user i.
Further, in the step S3.1, the following steps are specifically performed:
step S3.1.1: all the slices which can be accessed by each user in the target area are screened through the following formula, and the available slices which correspond to each user respectively are obtained:
wherein,,
in the method, in the process of the invention,indicating the band resources allocated by base station k for slice j, < >>Indicating the power resource allocated by base station k for slice j, < >>Is a {0, 1} variable, }>When 1, it indicates that user i accesses j slices on k base stations, ">When 0, it indicates that user i has not accessed j slices on k base stations, +>Representing the power resources i obtained by accessing user i to j slices on k base stations j Representing the number of users accessing slice j +.>Indicating that the slice fulfils the band resources that the minimum guaranteed rate needs to provide, +.>The maximum number of users to be carried for slice j of 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 slices corresponding to each user and the service rate provided for the user by combining the slices, wherein the higher the service rate provided for the user by the slices is, the higher the preference degree of the user on the slices is; and each available slice in the target area is based on the user service rate requirements of each user in the coverage area of the slice, and each available slice respectively obtains a corresponding user preference list, and the higher the user service rate requirement is, the higher the preference degree of the slice to the user is.
Further, in the 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 has iterated, and a user-slice matching relationship in the target area is obtained:
step S3.2.1: the user sends a matching request to the available slices with highest preference degree, which are not sent with the request, in the corresponding available slice preference list, and if the available slice preference list of the user does not have the slices which are not sent with the request, the user iterates; if the available slice preference list of the user has the slice which is not sent with the request, the user sends a matching request to the available slice with highest preference degree which is not sent with the request 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 the available slice receiving the matching request of the user does not reach the maximum bearing user number, the matching request is temporarily matched with the user; if the available slice reaches the maximum number of users to be loaded, comparing the service rate requirements of the users currently paired with the users currently transmitting the request based on the corresponding user preference list, if the users smaller than the service rate requirements of the users currently transmitting the request exist in the users currently paired, removing the user with the minimum service rate requirements of the users currently paired, adding the users currently transmitting the request into the temporary pairing of the slice, and executing a step S3.2.1 by the removed user; if there is no user less than the user service rate requirement of the current request, the step S3.2.1 is executed for the current request user.
Further, in the step S3.3, based on the user-slice matching relationship in the target area, the following steps are specifically executed:
step S3.1: all the base stations which can be accessed by the users in the target area are screened based on the user-slice matching relationship in the target area by combining the following formulas to obtain available base stations corresponding to the users respectively:
wherein b is k Representing the band resources of base station k, p k Indicating the power resources of base station k,indicating that base station k allocates band resources for slice j,/->Representing the power resource allocated by the base station k for the slice j, and m represents the number of slices accessed to the base station k;
step S3.2: based on the available base stations corresponding to the users respectively in the target area, combining the resource information of the base stations and the matching relation between the users and the slices, the users respectively obtain the corresponding available base station preference lists by combining the service rates provided by the slices on the base stations to the users through the following formulas:
wherein,,
in the method, in the process of the invention,indicating the number of users currently accessed by j slices on base station k,/>Representing the maximum number of users carrying slices j on base station k, alpha, beta representing a preset constant,/>Representing the degree of matching of user i selecting slice j to base station k, the higher the degree of matching, the higher the degree of preference of user to base station, the +. >Representing the service rate offered by j slices on base station k for user i,/>Representing the highest service rate, k, that user i can obtain in its corresponding available base station containing slice j j Indicating the available base stations corresponding to the user and containing the slice j;
each available base station in the target area obtains a corresponding user preference list based on the service rate requirement of each user matched with the slice on the base station, and 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 iterates the following steps until all the users on each slice in the target area iterate, thereby obtaining the user-slice-base station matching relationship in the target area:
step S3.4.1: the user sends a matching request to the available base stations with the user access slices deployed in the highest preference degree, which are not sent with the request, in the corresponding available base station preference list, and if the available base station preference list of the user does not have the base stations with the user access slices deployed without the request, the user iteration is ended; if the available base station preference list of the user has a base station which is not transmitted and is provided with the user access slice, the user sends a matching request to the available base station which is not transmitted and is provided with the user access slice and has the highest preference degree in the corresponding available base station preference list, and the step S3.4.2 is entered;
Step S3.4.2: aiming at a matching request sent by a user, if an available base station receiving the user matching request does not reach the maximum bearing user number, the base station is temporarily paired with the user; if the available base station reaches the maximum bearing user number, the base station compares the service rate requirements of each user currently paired with the user currently transmitting the request based on the corresponding user preference list aiming at the matching request sent by the user, if the user which is smaller than the service rate requirement of the user currently transmitting the request exists in each user currently paired, the user with the minimum service rate requirement of the user in each user currently paired is removed, the user currently transmitting 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 less than the user service rate requirement of the current request, the step S3.4.1 is executed for the current request user.
The beneficial effects of the invention are as follows: 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 comprising slices respectively constructed by each base station, switching of user request access slices is realized by switching the user request access base stations, and a matching relationship of the user-slice-base stations in the target area is obtained; firstly, a slice level is introduced, the traditional matching relation of the user and the base station is converted into the matching relation of the user, the slice and the base station, and the method is suitable for a new architecture after the network slicing technology appears. User service switching is embodied on slice switching, and the complete switching flow is divided into two stages to complete matching selection. And finally, based on a Gersapril algorithm, completing access selection of users and slices and access selection of slice users and base stations. The method can use the user rate and the maximum as far as possible on the premise of ensuring the service continuity from the aspect of slicing, solves the problems that the traditional method which takes the signal strength as a switching standard cannot adapt to a new network architecture, and how to improve the user rate and the like in a fine-granularity slicing environment, can not only meet the user slicing switching under the new network architecture, but also improve the service rate sum obtained by the user in a target area.
Drawings
Fig. 1 is an access network system diagram of a deployed network slice under the network architecture of the present embodiment;
fig. 2 is a schematic diagram of the matching and splitting of the user-slice-base station in this embodiment;
fig. 3 is a flowchart of an algorithm for solving the matching relationship between the user and the slice and the base station in the present 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 the access network system for deploying network slices under the network architecture shown in fig. 1, the invention provides a fine-granularity service slice switching method based on a Gersapril algorithm, which divides the matching of a user, a slice and a base station into two-stage matching, as shown in fig. 2, and uses the Gersapril algorithm to finish matching solution.
The invention applies the matching idea of the Gersapril algorithm to the user service slicing switching scene, firstly introduces a slicing level, converts the traditional matching relation of the user-base station into the matching relation of the user-slicing-base station, and adapts to a new architecture after the network slicing technology appears. User service switching is embodied on slice switching, and the complete switching flow is divided into two stages to complete matching selection. And finally, based on a Gersapril algorithm, completing access selection of users and slices and access selection of slice users and base stations. From the aspect of slicing, the method can maximize the user rate and the service continuity under 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 which takes the signal strength as the switching standard cannot adapt to a new network architecture, how to improve the speed and the like of a user in a fine granularity slicing environment; the invention provides a service slice switching method aiming at network fine granularity, which not only can meet the requirement of user slice switching under a new network architecture, but also can improve the user rate and the user rate of a system.
The invention adopts the following technical scheme: the service slice switching method for network fine granularity aims at a target area comprising base stations and a network environment comprising slices respectively constructed by the base stations, wherein the target area is an overall scene, for example, an area of 300 x 300 only considers that the total number of the base stations, the total number of the slices and the total number of users are all in the area; the following steps are executed, and the switching of the user request access slice is further realized, so that the matching relationship of the user-slice-base station 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 the user in the target area; and aiming at each slice in the target area, each slice respectively obtains the service request information of each user in the coverage area of each slice.
In the network architecture, both the user and the base station have basic perceptibility, that is, the user can obtain all available slice resource information in the current environment, the base station can perceive the user and obtain the request access information of the user in the coverage area, so that the switching architecture is changed from the matching of the user and the base station to the matching of the base station and the slice and the user. Under the matching relation, under the condition that the matching parties are required to negotiate with each other, a Gersapril algorithm is used, and the method can maximize the user rate and the maximum value under the premise of ensuring the service continuity from the aspect of slicing.
Step S2: and constructing an optimization model by taking all the slices and all the base stations which can be accessed by each user in the target area as the user access selection object and taking the service rate and the maximum obtained by the user in the target area as targets.
In the step S2, an optimization model is constructed with the maximum user rate sum in the target area as a target, and the objective function is as follows:
in the method, in the process of the invention,is a {0, 1} variable, }>When 1, it indicates that user i accesses j slices on k base stations, ">When 0, the j slices on the k base stations are not accessed by the user i; 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 Representing user traffic rate demand,/->Indicating the band resources allocated by base station k for slice j, < >>Indicating the power resource allocated by base station k for slice j, < >>Representing the power resources i obtained by accessing user i to j slices on k base stations j Representing the number of users accessing slice j +.>Representing the maximum number of users carrying slices j of base station k, b k Representing the band resources of base station k, p k Representing the power resource of the base station k, and m represents the number of slices accessed to the base station k; />Indicating the rate of service provided by j slices at base station k for user i.
C1 represents that the number of users accessing slice j on base station k is smaller than the maximum number of users, and C2 represents that the power of users accessing slice j on base station k and the power allocated to them are smaller. C3 represents that the bandwidth resources allocated by all slices on base station k are smaller than the total bandwidth of base station k, and C4 represents that the power resources allocated by all slices on base station k are smaller than the total power of base station k. C5 denotes the rate expression for user traffic demand as R req When a user switches, the target slice should be guaranteedThat is, the user only sends a request to the slice with the lowest service rate greater than or equal to the demand rate, and performs service to ensure service continuity, and C6 indicates that one user can only access one slice of one base station.
Step S3: based on all the slices and all the base stations which can be accessed by each user in the target area, the following steps are executed, the optimization model which aims at the maximum user rate in the target area is solved, the matching relation of the user, the slices and the base stations is completed in two stages through a Gersapril algorithm as shown in fig. 3, firstly, the matching relation of the user and the slices is obtained, a slice user set is obtained, then, the base stations in the second stage are selected, and the matching relation of the user, the slices and the base stations in the target area is obtained.
One user can only access one slice, and one slice can receive multiple users. The relationship between slices and base stations is established at deployment time, one slice can be deployed on a plurality of base stations, and a plurality of slices can be deployed on one base station, so that 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 the information of all the slice resources which can be accessed by the user in the target area, each user respectively obtains the corresponding available slices; for each available slice, combining the service rates provided by the available slices to users, and each user respectively obtaining a corresponding available slice preference list; combining service request information of each user in the coverage area of the available slices, and each available slice respectively obtaining a corresponding user preference list;
In the step S3.1, the following steps are specifically executed:
step S3.1.1: all the slices which can be accessed by each user in the target area are screened through the following formula, and the available slices which correspond to each user respectively are obtained:
slicing frequency band resources provided to meet minimum guaranteed rate requirements asThe maximum number of bearers for slice j of base station k is:
the bandwidth constraint may be translated into that the number of slice service users does not exceed their maximum number of bearers:
in summary, each user in the target area screens all the slices that can be accessed by the user through the following formula, and available slices corresponding to each user are obtained respectively:
in the method, in the process of the invention,indicating the band resources allocated by base station k for slice j, < >>Indicating the power resource allocated by base station k for slice j, < >>Is a {0, 1} variable, }>When 1, it indicates that user i accesses j slices on k base stations, ">When 0, it indicates that user i has not accessed j slices on k base stations, +>Representing the power resources i obtained by accessing user i to j slices on k base stations j Representing the number of users accessing slice j +.>Indicating that the slice fulfils the band resources that the minimum guaranteed rate needs to provide, +.>The maximum number of users to be carried for slice j of base station k; the first constraint indicates that the bandwidth resources allocated by the user accessing the slice j on the base station k cannot exceed the bandwidth allocated by the base station k for the slice j; the second constraint indicates that the power resources allocated by the user accessing slice j at base station k cannot exceed the power allocated by base station k for slice j.
Step S3.1.2: each user in the target area respectively obtains a corresponding available slice preference list based on the available slices corresponding to each user and the service rate provided for the user by combining the slices, wherein the higher the service rate provided for the user by the slices is, the higher the preference degree of the user on the slices is; and each available slice in the target area is based on the user service rate requirements of each user in the coverage area of the slice, and each available slice respectively obtains a corresponding user preference list, 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 relationship in a target area based on the available slice preference list corresponding to each user and the user preference list corresponding to each available slice;
in the 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 iterates the following steps until each user in the target area iterates, and a user-slice matching relationship in the target area is obtained:
step S3.2.1: the user sends a matching request to the available slices with highest preference degree, which are not sent with the request, in the corresponding available slice preference list, and if the available slice preference list of the user does not have the slices which are not sent with the request, the user iterates; if the available slice preference list of the user has the slice which is not sent with the request, the user sends a matching request to the available slice with highest preference degree which is not sent with the request 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 the available slice receiving the matching request of the user does not reach the maximum bearing user number, the matching request is temporarily matched with the user; if the available slice reaches the maximum number of users to be loaded, comparing the service rate requirements of the users currently paired with the users currently transmitting the request based on the corresponding user preference list, if the users smaller than the service rate requirements of the users currently transmitting the request exist in the users currently paired, removing the user with the minimum service rate requirements of the users currently paired, adding the users currently transmitting the request into the temporary pairing of the slice, and executing a step S3.2.1 by the removed user; if there is no user less than the user service rate requirement of the current request, the step S3.2.1 is executed for the current request user.
As shown in fig. 3, in the user-slice matching stage, for the user side, each user hopes to obtain the best service experience, under the current service, the user selects the slice access with the maximum minimum rate index, so the preference list order of the users is the user rate obtained by the user access In order, for the slice side, the access request for the incoming user can be accessed before the maximum bearing number is reached, when the maximum bearing number is reached, the access request is accessed according to the rate requirement R of the user req Selecting a user with high service requirement as a candidate user,cutting out users with low service rate requirements in the users to be selected, and sequentially taking a preference list on the slicing side as R of user service requirements req . The cut-out users are added into a switching user set, the user to be selected exits from the slicing user set, the cut-out users perform the next matching request until all users traverse the corresponding available slices, the selection is finished, the switching user level is exited for the users which traverse the corresponding available slices and are not accessed into the slices, no corresponding service is provided in the matching process, the users initiate the service request again, and finally each available slice respectively obtains the slicing user set corresponding to the slice.
Step S3.3: based on the user-slice matching relationship in the target area, combining the user to obtain all the base station resource information which can be accessed by the user in the target area, and each user respectively obtains the corresponding available base stations; for each available base station, combining the resource information of the available base station and the matching relation between each user and the slice, each user respectively obtains a corresponding available base station preference list; and combining the service request information of each user matched with the slice on the base station, and each available base station respectively obtains a corresponding user preference list.
In the step S3.3, based on the user-slice matching relationship in the target area, the following steps are specifically executed:
step S3.1: all the base stations which can be accessed by the users in the target area are screened based on the user-slice matching relationship in the target area by combining the following formulas to obtain available base stations corresponding to the users respectively:
wherein b is k Representing the band resources of base station k, p k Indicating the power resources of base station k,indicating that base station k allocates band resources for slice j,/->Representing the power resource allocated by the base station k for the slice j, and m represents the number of slices accessed to the base station k; these two constraints represent the resources of the base station for the deployment of slices and resources that are smaller than the base station itself.
The first stage user-base station matching is affected by the first stage user-slicing, since the deployment of the base station and the slicing has been initialized, the list of base station candidates for the slicing has been determined, and only the base station deploying the slicing can be selected. Let k be the set of base stations with the j-th slice deployed j Where j is {1,2,.. A., M }, k is { k } 1 ,k 2 ,......,k j }. For user i, after the slice j selected in the first-stage match, the selectable base stations can only be limited to k j . For the same slice deployed by different base stations, the guaranteed rate provided by the slice is the same, but because the distances between the user and the base stations are different, the rates obtained by the user accessing the same slice are different, and the user side can complete rate normalization according to the ratio of the rates provided by different base stations to the maximum rates available in all the base stations, as follows:
Step S3.2: based on the available base stations corresponding to the users respectively in the target area, combining the resource information of the base stations and the matching relation between the users and the slices, the users respectively obtain the corresponding available base station preference lists by combining the service rates provided by the slices on the base stations to the users through the following formulas:
wherein,,considering load balancing, accessing user number +_ by using current slice of base station>And maximum number of bearer subscribers->The ratio of (2) expresses the saturation of the current base station, and when N is larger, the load pressure is larger, and the probability of selecting access is smaller.
In the method, in the process of the invention,indicating the number of users currently accessed by j slices on base station k,/>The maximum number of users of the slice j on the base station k is represented, alpha and beta represent preset constants, and the weights of the load balance and the user rate are represented, and for the convenience of expression, the embodiment takes 0.5 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 represented, 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 higher the probability of being selected is, and the +.>Representing the service rate offered by j slices on base station k for user i,/>Representing 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 available base station, k j Indicating that the user corresponds to an available base station containing slice j.
Each available base station in the target area obtains a corresponding user preference list based on the service rate requirement of each user matched with the slice on the base station, and 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 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 matching relationship of the user-slice-base station in the target area.
In the 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 iterates 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: the user sends a matching request to the available base stations with the user access slices deployed in the highest preference degree, which are not sent with the request, in the corresponding available base station preference list, and if the available base station preference list of the user does not have the base stations with the user access slices deployed without the request, the user iteration is ended; if the available base station preference list of the user has a base station which is not transmitted and is provided with the user access slice, the user sends a matching request to the available base station which is not transmitted and is provided with the user access slice and has the highest preference degree in the corresponding available base station preference list, and the step S3.4.2 is entered;
Step S3.4.2: aiming at a matching request sent by a user, if an available base station receiving the user matching request does not reach the maximum bearing user number, the base station is temporarily paired with the user; if the available base station reaches the maximum bearing user number, the base station compares the service rate requirements of each user currently paired with the user currently transmitting the request based on the corresponding user preference list aiming at the matching request sent by the user, if the user which is smaller than the service rate requirement of the user currently transmitting the request exists in each user currently paired, the user with the minimum service rate requirement of the user in each user currently paired is removed, the user currently transmitting 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 less than the user service rate requirement of the current request, the step S3.4.1 is executed for the current request user.
As shown in fig. 3, in the slice user-base station selection stage, after the user-slice matching stage is completed, a user list to be accessed, namely a slice user set, is obtained on each slice, and the access load condition of the base station and the rate provided by the base station are considered as matching indexes, and the slice users are allocated to the base stations which can be accessed by combining the available base station preference list corresponding to each user and the user preference list corresponding to each available base station respectively until all slice users traverse the available base stations corresponding to the slice users, so that the selection is finished, the re-access of the users is completed, and the complete switching is realized; and for the users traversing the corresponding available base stations and still not accessing the base stations, the users quit the corresponding sliced user sets and do not provide corresponding services in the matching process, and the users initiate service requests again.
Based on the generation of the network slicing technology, the logical end-to-end network can be constructed according to different service demands, so as to meet different service demands. Therefore, under the network architecture which is respectively constructed by each base station and comprises the slices, the corresponding slices for processing the corresponding services can be accessed through the division of the user request service types, and then the base stations are accessed, so that the rate of receiving and processing the user services is increased, and the utilization rate of network resources is improved.
The invention designs a service slicing switching method aiming at network fine granularity, aiming at a target area comprising base stations and a network architecture comprising slices respectively constructed by the base stations, a slicing layer is firstly introduced, the traditional matching relationship of users and the base stations is converted into the matching relationship of the users, the slices and the base stations, and the method is suitable for a new architecture after the network slicing technology appears. User service switching is embodied on slice switching, and the complete switching flow is divided into two stages to complete matching selection. And finally, based on a Gersapril algorithm, completing access selection of users and slices and access selection of slice users and base stations. The method can maximize the user rate under the premise of ensuring the service continuity from the aspect of slicing, solves the problems that the traditional method which takes the signal strength as a switching standard cannot adapt to a new network architecture, and how to improve the user rate and the like under the fine-granularity slicing environment, can not only meet the user slicing switching under the new network architecture, but also improve the service rate sum obtained by the users 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 the present invention may be modified or equivalents substituted for some of the features thereof. All equivalent structures made by the content of the specification and the drawings of the invention are directly or indirectly applied to other related technical fields, and are also within the scope of the invention.
Claims (6)
1. A business slice switching method aiming at network fine granularity is characterized in that: aiming at a target area comprising base stations and a network environment comprising slices, which is respectively constructed by the base stations, the following steps are executed, the switching of the user request access slices is further realized, and the switching of the user request access base stations is further realized, so that the matching relation of the user-slice-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 the 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;
Step S2: based on all the slices and all the base stations which can be accessed by each user in the target area, taking the user access selection object as a target, and constructing an optimization model by taking the service rate and the maximum obtained by the user in the target area as targets;
step S3: based on all the slices and all the base stations which can be accessed by each user in the target area, the following steps are executed, and the optimization model which aims at the maximum user rate in the target area is solved, so that the matching relation of the user in the target area, the slice and the base station is obtained:
step S3.1: based on the information of all the slice resources which can be accessed by the user in the target area, each user respectively obtains the corresponding available slices; for each available slice, combining the service rates provided by the available slices to users, and each user respectively obtaining a corresponding available slice preference list; combining service request information of each user in the coverage area of the available slices, and each available slice respectively obtaining a corresponding user preference list;
step S3.2: obtaining a user-slice matching relationship in a target area based on the available slice preference list corresponding to each user and the user preference list corresponding to each available slice;
Step S3.3: based on the user-slice matching relationship in the target area, combining the user to obtain all the base station resource information which can be accessed by the user in the target area, and each user respectively obtains the corresponding available base stations; for each available base station, combining the resource information of the available base station and the matching relation between each user and the slice, each user respectively obtains a corresponding available base station preference list; combining service request information of each user matched with the slice on the base station, and each available base station respectively obtains a corresponding user preference list;
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 matching relationship of the user-slice-base station in the target area.
2. The traffic slice switching method for network fine granularity according to claim 1, wherein: in the step S2, an optimization model is constructed with the sum of the maximum user rates in the target area as a target, and the objective function is as follows:
in the method, in the process of the invention,is a {0, 1} variable, }>When 1, it indicates that user i accesses j slices on k base stations, ">When 0, the j slices on the k base stations are not accessed by the user i; 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 is R req Representing user traffic rate demand,/->Indicating the band resources allocated by base station k for slice j,indicating the power resource allocated by base station k for slice j, < >>Representing the power resources i obtained by accessing user i to j slices on k base stations j Representing the number of users accessing slice j +.>Representing the maximum number of users carrying slices j of base station k, b k Representing the band resources of base station k, p k Representing the power resource of the base station k, and m represents the number of slices accessed to the base station k; />Indicating the rate of service provided by j slices at base station k for user i.
3. The traffic slice switching method for network fine granularity according to claim 1, wherein: in the step S3.1, the following steps are specifically executed:
step S3.1.1: all the slices which can be accessed by each user in the target area are screened through the following formula, and the available slices which correspond to each user respectively are obtained:
wherein,,
in the method, in the process of the invention,indicating the band resources allocated by base station k for slice j, < >>Indicating the power resources allocated by base station k for slice j,is a {0, 1} variable, }>When 1, it indicates that user i accesses j slices on k base stations, ">When 0, it indicates that user i has not accessed j slices on k base stations, +>Representing the power resources i obtained by accessing user i to j slices on k base stations j Representing the number of users accessing slice j +.>Indicating that the slice fulfils the band resources that the minimum guaranteed rate needs to provide, +.>The maximum number of users to be carried for slice j of 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 slices respectively corresponding to each user and the service rate provided by the slices to the users, and the higher the service rate provided by the slices to the users is, the higher the preference degree of the users to the slices is; and each available slice in the target area is based on the user service rate requirements of each user in the coverage area of the slice, and each available slice respectively obtains a corresponding user preference list, and the higher the user service rate requirement is, the higher the preference degree of the slice to the user is.
4. The traffic slice switching method for network fine granularity according to claim 1, wherein: in the 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 iterates the following steps until each user in the target area iterates, and a user-slice matching relationship in the target area is obtained:
Step S3.2.1: the user sends a matching request to the available slices with highest preference degree, which are not sent with the request, in the corresponding available slice preference list, and if the available slice preference list of the user does not have the slices which are not sent with the request, the user iterates; if the available slice preference list of the user has the slice which is not sent with the request, the user sends a matching request to the available slice with highest preference degree which is not sent with the request 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 the available slice receiving the matching request of the user does not reach the maximum bearing user number, the matching request is temporarily matched with the user; if the available slice reaches the maximum number of users to be loaded, comparing the service rate requirements of the users currently paired with the users currently transmitting the request based on the corresponding user preference list, if the users smaller than the service rate requirements of the users currently transmitting the request exist in the users currently paired, removing the user with the minimum service rate requirements of the users currently paired, adding the users currently transmitting the request into the temporary pairing of the slice, and executing a step S3.2.1 by the removed user; if there is no user less than the user service rate requirement of the current request, the step S3.2.1 is executed for the current request user.
5. The traffic slice switching method for network fine granularity according to claim 1, wherein: in the step S3.3, based on the user-slice matching relationship in the target area, the following steps are specifically executed:
step S3.1: all the base stations which can be accessed by the users in the target area are screened based on the user-slice matching relationship in the target area by combining the following formulas to obtain available base stations corresponding to the users respectively:
wherein b is k Representing the band resources of base station k, p k Indicating the power resources of base station k,indicating the band resources allocated by base station k for slice j, < >>Representing the power resource allocated by the base station k for the slice j, and m represents the number of slices accessed to the base station k;
step S3.2: based on the available base stations corresponding to the users respectively in the target area, combining the resource information of the base stations and the matching relation between the users and the slices, the users respectively obtain the corresponding available base station preference lists by combining the service rates provided by the slices on the base stations to the users through the following formulas:
wherein,,
in the method, in the process of the invention,indicating the number of users currently accessed by j slices on base station k,/>Representing the maximum number of users carrying slices j on base station k, alpha, beta representing a preset constant,/ >Representing the degree of matching of user i selecting slice j to base station k, the higher the degree of matching, the higher the degree of preference of user to base station, the +.>Representing the service rate offered by slice j on base station k for user i,/>Representing the highest service rate, k, that user i can obtain in its corresponding available base station containing slice j j Indicating the available base stations corresponding to the user and containing the slice j;
each available base station in the target area obtains a corresponding user preference list based on the service rate requirement of each user matched with the slice on the base station, and 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 traffic slice switching method for network fine granularity according to claim 1, wherein: in the 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 iterates 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: the user sends a matching request to the available base stations with the user access slices deployed in the highest preference degree, which are not sent with the request, in the corresponding available base station preference list, and if the available base station preference list of the user does not have the base stations with the user access slices deployed in the request, the user iteration is ended; if the available base station preference list of the user has a base station which is not transmitted and is provided with the user access slice, the user sends a matching request to the available base station which is not transmitted and is provided with the user access slice and has the highest preference degree in the corresponding available base station preference list, and the step S3.4.2 is entered;
Step S3.4.2: aiming at a matching request sent by a user, if an available base station receiving the user matching request does not reach the maximum bearing user number, the base station is temporarily paired with the user; if the available base station reaches the maximum bearing user number, the base station compares the service rate requirements of each user currently paired with the user currently transmitting the request based on the corresponding user preference list aiming at the matching request sent by the user, if the user which is smaller than the service rate requirement of the user currently transmitting the request exists in each user currently paired, the user with the minimum service rate requirement of the user in each user currently paired is removed, the user currently transmitting 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 less than the user service rate requirement of the current request, the step S3.4.1 is executed for the current request user.
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 CN115119275A (en) | 2022-09-27 |
| CN115119275B true 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 (1)
| 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 |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110972107B (en) * | 2018-09-29 | 2021-12-31 | 华为技术有限公司 | Load balancing method and device |
| US11129214B2 (en) * | 2019-10-25 | 2021-09-21 | Kabushiki Kaisha Toshiba | Resource slicing in a wireless communication network |
| US11284288B2 (en) * | 2019-12-31 | 2022-03-22 | 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 |
-
2022
- 2022-06-29 CN CN202210759143.5A patent/CN115119275B/en active Active
Patent Citations (1)
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115119275A (en) | 2022-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109600262B (en) | Resource self-configuration and self-optimization method and device in URLLC transmission network slice | |
| EP2304899B1 (en) | Priority-based admission control in a network with variable channel data rates | |
| WO2023024219A1 (en) | Joint optimization method and system for delay and spectrum occupancy in cloud-edge collaborative network | |
| US8134946B2 (en) | System and method for scheduling in relay-assisted wireless networks | |
| CN108718446B (en) | L TE-A network D2D mode selection and resource allocation method | |
| CN109194763A (en) | Caching method based on small base station self-organizing cooperative in a kind of super-intensive network | |
| CN108076531B (en) | Multi-service provider-oriented dynamic allocation method for wireless network slice resources | |
| US20220167346A1 (en) | Concurrent connectivity with both 4g and 5g networks for mobile devices | |
| CN109743751B (en) | Resource allocation method and device for wireless access network | |
| CN112423267A (en) | Vehicle networking heterogeneous resource dynamic slicing method based on Lyapunov random optimization | |
| KR101872658B1 (en) | Method and apparatus for adjusting air interface capacity density | |
| US7061986B2 (en) | Method for adaptive bit assignment and fine gain setting in a multi-carrier communications system | |
| EP1048185B1 (en) | Bandwidth provision in a communication system | |
| CN115119275B (en) | Service slice switching method aiming at network fine granularity | |
| CN111083121B (en) | Panoramic video multicast method and device in satellite-ground converged network | |
| CN112911687A (en) | Method for establishing connection between terminal and access equipment, wireless local area network and storage medium | |
| CN103582005B (en) | A kind of method and apparatus carrying out traffic assignments between network | |
| CN112954806A (en) | Chord graph coloring-based joint interference alignment and resource allocation method in heterogeneous network | |
| CN115633383A (en) | Multi-cooperation server deployment method in edge computing scene | |
| CN113115401B (en) | Access control method for maximizing satisfied user number in cellular network | |
| CN112911708A (en) | Resource allocation method, server and storage medium | |
| US20220116842A1 (en) | Dynamic client segregation in 802.11ax networks | |
| CN107835514B (en) | Modeling method for wireless network resource matching in multi-host service scene | |
| CN107124726B (en) | Multi-beam GEO system access control method based on maximized throughput | |
| CN113810914A (en) | User pairing method of user separation type uplink non-orthogonal multiple access technology |
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 |