CN109862591B - Bandwidth borrowing and cache sharing method based on Qos air interface slice - Google Patents
Bandwidth borrowing and cache sharing method based on Qos air interface slice Download PDFInfo
- Publication number
- CN109862591B CN109862591B CN201910149489.1A CN201910149489A CN109862591B CN 109862591 B CN109862591 B CN 109862591B CN 201910149489 A CN201910149489 A CN 201910149489A CN 109862591 B CN109862591 B CN 109862591B
- Authority
- CN
- China
- Prior art keywords
- real
- user
- time
- resource
- slice
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a bandwidth borrowing and cache sharing method based on a Qos air interface slice, which comprises three steps of resource information collection and updating, matching decision and matching execution. Compared with the traditional resource allocation mode, the invention avoids the situation of real-time user service discarding caused by the fact that the real-time user resources cannot be met due to network congestion. The invention effectively solves the problem that the real-time user can not obtain the resource requirement when the network is in a crowded state under the traditional condition, and provides a matching relation for borrowing the RB resource of the non-real-time user, and the real-time user can borrow the RB resource of the non-real-time user to meet the real-time requirement of the real-time user; when the real-time user borrows the RB resources of the non-real-time user, the non-real-time user can also find the corresponding real-time user according to the matching relation provided by the invention, and the target cache resources of the non-real-time user are used for storing the data to be sent.
Description
Technical Field
The invention belongs to the technical field of network slicing and service quality, and particularly relates to a design of a bandwidth borrowing and cache sharing method based on a Qos air interface slice.
Background
In the network, due to different Qos (Quality of Service) requirements of end users, users can BE classified according to Qos, that is, Users (UEs) are classified into real-time traffic type (ULL) and non-real-time traffic type (BE) based on Qos slices. The real-time service has a high requirement on time delay, and because of the real-time requirement, the buffer (cache) utilization rate of the real-time service is low, when the network is crowded, the real-time service is likely to be discarded because the bandwidth cannot be met; the non-real-time service is insensitive to the time delay requirement, and the data can be temporarily stored through the buffer to delay the transmission. The terminal users can communicate with each other, one terminal can send own data to another terminal, temporarily store in the buffer of the terminal, and wait for the other terminal to replace the terminal to send the data. In the prior art, when the network is in a crowded state, it is difficult to guarantee the real-time requirement of the user in the real-time service slice.
Disclosure of Invention
The invention aims to provide a bandwidth borrowing and cache sharing method based on a Qos empty slice, which can ensure the real-time requirement of a user in a real-time service slice when a network is in a crowded state, and provides a solution for matching terminal resources of bandwidth borrowing and cache sharing for real-time services and non-real-time services.
The technical scheme of the invention is as follows: a bandwidth borrowing and cache sharing method based on a Qos air interface slice comprises the following steps:
s1, collecting and updating resource information: and reporting the user resource information to a controller through a wireless base station, and maintaining and updating a slice resource information table and a user resource information table in the controller according to the user resource information.
S2, matching decision: and obtaining a matching relation table of user bandwidth borrowing and cache sharing by adopting a Hungarian algorithm according to the slice resource information table and the user resource information table.
S3, matching and executing: and issuing the matching relation table to a wireless base station from a controller, issuing resource block resource indexes to real-time users through the wireless base station, issuing buffer resource indexes to non-real-time users, and realizing resource borrowing and sharing according to the resource indexes.
Further, the contents in the slice resource information table in step S1 include:
the time delay requirement, namely whether the slice service type is real-time service or non-real-time service;
the number of resource blocks, i.e., the size of the bandwidth allocated to the slice;
the target number, i.e. the available buffer size under the slice.
Further, the user resource information table in step S1 includes a real-time service user resource information table and a non-real-time service user resource information table.
Further, the content in the real-time service user resource information table includes:
a user ID, i.e. which user under which slice belongs;
resource block requirements, namely the bandwidth size required by the real-time requirements of the user is met;
target number, i.e. the available buffer size under the slice;
target index, i.e. the specific location of the user buffer.
Further, the content in the non-real-time service user resource information table includes:
a user ID, i.e. which user under which slice belongs;
target requirements, i.e. the buffer size required by the user;
the number of resource blocks, i.e. the size of bandwidth that the user can borrow;
resource block index, i.e. the specific location of the user resource block.
Further, step S2 includes the following substeps:
s21, slice matching: and selecting a non-real-time slice with mutually satisfied resources according to the information in the slice resource information table through the time delay requirement.
S22, node screening: and obtaining the user association relationship between the real-time slices and the non-real-time slices according to the information in the user resource information table, and screening out users in the non-real-time slices which cannot establish the association relationship with any real-time user to obtain a new user association relationship.
S23, weight calculation: and calculating the distance between the users with the association relationship according to the new user association relationship as the weight between the users.
S24, node matching: a matching relation table of user bandwidth borrowing and cache sharing is obtained through a weighted Hungarian algorithm, and the weight between users is enabled to be minimum.
Further, the specific method of step S22 is:
constructing a matrix A with M rows and N columns, wherein M is the number of real-time users with real-time service requirements, N is the number of users in the non-real-time slice selected in the step S21, and the element a in the matrix AijIndicating whether the buffer resource of the ith real-time user and the resource block resource of the jth non-real-time user meet each other, namely whether an association relationship can be established, if so, aijHas a value of1, otherwise aijIs 0; wherein i is not less than 1 but not more than M, j is not less than 1 but not more than N, and aijSatisfy the relation:
judging whether the sum of each column of the matrix A is zero or not, and screening out the non-real-time users corresponding to the columns with the sum of zero to obtain a non-real-time user node set comprising P non-real-time users, wherein P is more than or equal to M; and taking a real-time user node set with the user number M and a non-real-time user node set with the user number P as two vertex sets of the bipartite graph, and connecting the user nodes to obtain a new user association relationship.
Further, the calculation formula of the weight between users in step S23 is:
wherein (x)i,yi) Indicating the location of the ith real-time user, (x)k,yk) And (3) representing the position of the kth non-real-time user, wherein i is more than or equal to 1 and less than or equal to M, and k is more than or equal to 1 and less than or equal to P.
Further, the contents in the matching relationship table in step S24 include:
a real-time user ID, which indicates which real-time user belongs to which real-time slice;
target index, namely the concrete position of the buffer provided by the real-time user;
a non-real-time user ID, which indicates which non-real-time user under which non-real-time slice belongs;
resource block index, i.e. the specific location of the resource block provided by the non-real time user.
The invention has the beneficial effects that:
(1) the invention provides a solution for matching terminal resources of bandwidth borrowing and cache sharing for real-time services and non-real-time services in a Qos-based slice network under a network congestion state. Compared with the traditional resource allocation mode, the invention avoids the situation of real-time user service discarding caused by the fact that the real-time user resources cannot be met due to network congestion.
(2) The invention effectively solves the problem that the real-time user can not obtain the resource requirement when the network is in a crowded state under the traditional condition, and provides a matching relation for borrowing the RB resource of the non-real-time user, and the real-time user can borrow the RB resource of the non-real-time user to meet the real-time requirement of the real-time user; when the real-time user borrows the RB resources of the non-real-time user, the non-real-time user can also find the corresponding real-time user according to the matching relation provided by the invention, and the target cache resources of the non-real-time user are used for storing the data to be sent.
Drawings
Fig. 1 is a flowchart illustrating a bandwidth borrowing and cache sharing method based on a Qos air interface slice according to an embodiment of the present invention.
Fig. 2 is a diagram illustrating an indication of a cache resource before sharing according to an embodiment of the present invention.
Fig. 3 is a diagram illustrating an indication of shared cache resources according to an embodiment of the present invention.
Fig. 4 is a flowchart of a resource information collection signaling according to an embodiment of the present invention.
Fig. 5 illustrates a slice resource information representation provided by an embodiment of the present invention.
Fig. 6 shows a representation intention of user resource information of a real-time service provided by an embodiment of the present invention.
Fig. 7 shows a non-real-time service user resource information representation intention provided by an embodiment of the present invention.
Fig. 8 is a flowchart illustrating matching decision steps according to an embodiment of the present invention.
Fig. 9 is a schematic diagram illustrating node screening according to an embodiment of the present invention.
Fig. 10 is a schematic diagram illustrating a user association relationship with weights according to an embodiment of the present invention.
Fig. 11 shows a matching relationship representation provided by the embodiment of the present invention.
Fig. 12 is a signaling flow chart of matching execution according to an embodiment of the present invention.
Fig. 13 is a flowchart illustrating a signaling procedure for a match hit according to an embodiment of the present invention.
Fig. 14 is a scene diagram according to an embodiment of the present invention.
Fig. 15 is a signaling flow chart of information update according to an embodiment of the present invention.
Fig. 16 is a schematic diagram of resource blocks before borrowing according to an embodiment of the present invention.
Fig. 17 is a signaling flow chart of matching execution according to an embodiment of the present invention.
Fig. 18 is a scene diagram provided in the second embodiment of the present invention.
Fig. 19 is a signaling flow chart of information update according to a second embodiment of the present invention.
Fig. 20 is a signaling flow chart of matching execution according to the second embodiment of the present invention.
Fig. 21 is a schematic diagram illustrating centralized resource management according to a third embodiment of the present invention.
Fig. 22 is a scene diagram provided in the third embodiment of the present invention.
Fig. 23 is a schematic diagram illustrating distributed resource management according to a fourth embodiment of the present invention.
Fig. 24 is a scene diagram provided in the fourth embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It is to be understood that the embodiments shown and described in the drawings are merely exemplary and are intended to illustrate the principles and spirit of the invention, not to limit the scope of the invention.
An embodiment of the present invention provides a bandwidth borrowing and cache sharing method based on a Qos air interface slice, as shown in fig. 1, including the following steps S1 to S3:
s1, collecting and updating resource information: reporting User (UE) resource information to a controller through a wireless Base Station (BS), and maintaining and updating a slice resource information table and a user resource information table in the controller according to the user resource information.
Step S1 is mainly that the controller needs to collect some resource information, such as the bandwidth size required by real-time traffic (ULL), i.e. the number of Resource Blocks (RB), the provided buffer size, i.e. the number of objects (Object), and the Object index. As shown in fig. 2 and 3, the buffer size can be abstracted to the number of objects; the number of objects required for non-real time traffic (BE), the number of owned RBs, and the RB index, provide for a matching decision. Controller resource information collection procedure as shown in fig. 4, the controller maintains this type of information, and therefore two data structures are introduced: (1) a slice resource information table; (2) and (4) a user resource information table.
The slice resource information table is shown in fig. 5, the controller needs to maintain and update a slice resource information table, the table is used for matching and selecting different types of slices (with different delay requirements) when the real-time service bandwidth resource is insufficient, the real-time user borrows the non-real-time user bandwidth resource, and the non-real-time user shares the real-time user cache resource, and the content in the slice resource information table includes:
the time delay requirement, namely whether the slice service type is real-time service or non-real-time service;
the number of Resource Blocks (RBs), i.e., the size of the bandwidth allocated to the slice;
the number of objects (Object), i.e. the available buffer size under the slice.
The selection of the bandwidth borrowing of the super real-time service and the non-super real-time service and the slice matching of the cache sharing can be made through the number of RBs and the number of available objects (the bandwidth and the cache meet each other).
The controller also maintains and updates a user resource information table for each slice, i.e. service provider SP, which is used for making an association relationship between users between two slices according to the hungarian algorithm after selecting one slice to match. Because the resource providers in the resource sharing relationship matching the association relationship provide different resources due to different delay requirements, the user resource information table will have different information in different (different service) tables according to the delay requirements, and the slice is divided into ULL service and BE service according to the Qos requirements, so the user resource information table includes a real-time service user resource information table and a non-real-time service user resource information table.
As shown in fig. 6, the content in the real-time service user resource information table includes:
a user ID, i.e. which user under which slice belongs;
resource Block (RB) requirements, i.e., the size of bandwidth needed to meet the real-time requirements of the user;
the number of objects (Object), i.e. the available buffer size under the slice;
object index, i.e. the specific location of the user buffer.
As shown in fig. 7, the content in the non-real-time service user resource information table includes:
a user ID, i.e. which user under which slice belongs;
target (Object) requirement, i.e. the buffer size required by the user;
the number of Resource Blocks (RBs), i.e., the size of bandwidth that the user can borrow;
resource Block (RB) index, i.e., the specific location of the user resource block.
S2, matching decision: and obtaining a matching relation table of user bandwidth borrowing and cache sharing by adopting a Hungarian algorithm according to the slice resource information table and the user resource information table.
Step S2 mainly includes a matching decision algorithm, where the matching decision algorithm is used to generate a corresponding relationship between bandwidth borrowing and cache sharing for real-time users and non-real-time users, and in the embodiment of the present invention, the corresponding relationship is abstracted to an optimal matching problem calculated by weighted hungarian algorithm. The optimal matching problem of the weighted Hungarian algorithm is that a one-to-one matching relation is obtained to minimize the weight cost of the weighted bipartite graph, wherein the weight represents the cost for establishing an association relation between two users. In the embodiment of the invention, a controller firstly finds a non-real-time slice with mutually satisfied resources according to a time delay requirement, then finds a non-real-time service (BE) node set capable of satisfying the establishment of a corresponding relation with a real-time service (ULL) node in the slice, and then obtains a matching relation through a Hungarian algorithm.
As shown in fig. 8, step S2 includes the following substeps S21-S24:
s21, slice matching: and selecting a non-real-time slice with mutually satisfied resources according to the information in the slice resource information table through the time delay requirement.
S22, node screening: and obtaining the user association relationship between the real-time slices and the non-real-time slices according to the information in the user resource information table, and screening out users in the non-real-time slices which cannot establish the association relationship with any real-time user to obtain a new user association relationship.
Firstly, a matrix A with M rows and N columns is constructed, wherein M is the number of real-time users with real-time service requirements, N is the number of users in the non-real-time slice selected in the step S21, and an element a in the matrix AijIndicating whether the buffer resource of the ith real-time user and the resource block resource of the jth non-real-time user meet each other, namely whether an association relationship can be established, if so, aij Is 1, otherwise aijIs 0; wherein i is not less than 1 but not more than M, j is not less than 1 but not more than N, and aijSatisfy the relation:
formula (1) indicates that each real-time user has at least one non-real-time user that can satisfy the resource requirement with each other. And judging whether the sum of each column of the matrix A is zero, and screening out the non-real-time users corresponding to the columns with the sum being zero to obtain a non-real-time user node set comprising P non-real-time users, wherein P is more than or equal to M as the real-time users need to correspond to the non-real-time users one by one, otherwise, the non-real-time slices need to be selected again. As shown in fig. 9, in the embodiment of the present invention, taking M equal to 3 and N equal to 5 as an example, a non-real-time user group selection process is shown, and a connection line between users indicates that resources satisfy each other. And taking a real-time user node set with the user number M and a non-real-time user node set with the user number P as two vertex sets of the bipartite graph, and connecting the user nodes to obtain a new user association relationship.
S23, weight calculation: and calculating the distance between the users with the association relationship according to the new user association relationship as the weight between the users.
In the embodiment of the present invention, the distance between the real-time user and the non-real-time user is used as the weight value, and since the controller can know the user position, the distance can be calculated by using the user position, and the calculation formula of the weight between the users is as follows:
wherein (x)i,yi) Indicating the location of the ith real-time user, (x)k,yk) And (3) representing the position of the kth non-real-time user, wherein i is more than or equal to 1 and less than or equal to M, and k is more than or equal to 1 and less than or equal to P. If element a in matrix AijIf the value is zero, the corresponding weight value is set to infinity, and taking the filtered nodes in fig. 9 as an example, the association relationship of the weighted users is shown in fig. 10 after the distance is selected as the weight.
S24, node matching: a matching relation table of user bandwidth borrowing and cache sharing is obtained through a weighted Hungarian algorithm, and the weight between users is enabled to be minimum.
As shown in fig. 11, the contents in the matching relationship table include:
a real-time user ID, which indicates which real-time user belongs to which real-time slice;
target index, namely the concrete position of the buffer provided by the real-time user;
a non-real-time user ID, which indicates which non-real-time user under which non-real-time slice belongs;
resource block index, i.e. the specific location of the resource block provided by the non-real time user.
S3, matching and executing: and issuing the matching relation table to a wireless base station from a controller, issuing resource block resource indexes to real-time users through the wireless base station, issuing buffer resource indexes to non-real-time users, and realizing resource borrowing and sharing according to the resource indexes.
As shown in fig. 12, the controller issues the generated matching relationship table to the wireless Base Station (BS), the BS sends the RB resource index to the real-time user with resource requirement according to the matching relationship table, and sends the buffer resource index to the non-real-time user matching the corresponding borrowed RB resource, the real-time user can send own data through the borrowed RB resource, and the non-real-time user borrowing the RB resource can first send the data to be sent to the corresponding real-time user buffer, and waits for the real-time user to send data instead of the real-time user.
As shown in fig. 13, when a registered real-time user (already including the matching relationship) initiates a real-time service request again, if the state of the corresponding non-real-time service user does not change, that is, the matching relationship of the real-time user still exists, the controller does not need to decide the matching relationship, the BS may directly issue the corresponding RB resource index to the real-time user through the matching relationship table, and the corresponding buffer resource index is issued to the non-real-time user. The real-time user can send own data through the borrowed RB resource, and the non-real-time user which borrows the RB resource can firstly send the data to be sent to the corresponding real-time user cache and wait for the real-time user to replace the real-time user to send the data.
Four specific embodiments are described in detail below for the bandwidth borrowing and cache sharing methods in four different network environments.
The first embodiment is as follows:
the Network in the embodiment of the present invention is a Software Defined Network (SDN). Considering the following scenario, a real-time user under a certain wireless Base Station (BS) initiates a real-time service request, because the network is in a congested state, the real-time user has Resource Block (RB) resource borrowing requirements, the BS reports real-time user resource information, and a controller makes a matching decision.
As shown in fig. 14, assuming that the network is in a congested state, in a scenario of an embodiment of the present invention, a controller is included, which includes two BSs (BS1 and BS2), three unregistered (not including a matching relationship) real-time service subscribers of a handset are assumed under BS1, and three connected (where the controller already includes resource information thereof) non-real-time video monitoring service subscribers under BS2, where the whole process is as follows:
and S1, collecting and updating resource information.
As shown in fig. 15, when an unregistered mobile phone real-time service user under BS1 has an RB resource borrowing requirement, a resource request is sent to BS1 through the RB resource (ULL punture in fig. 16) reserved by the real-time slice, since the current BS1 does not have the matching relationship of this type of user, BS1 sends the resource information (RB requirement, buffer size (number of objects) and index) and ID of the mobile phone real-time user to the controller, and the controller updates the slice resource information table shown in fig. 5 and updates the real-time service user resource information table shown in fig. 6.
And S2, matching decision.
Step S2 includes the following substeps:
s21, slice matching: the controller selects a non-real-time slice whose resources satisfy each other through the delay requirement and the resource information according to the information in the slice resource information table shown in fig. 5, and in this scenario, it is assumed that the BE slice under BS2 satisfies the requirement, and the BE slice is selected.
S22, node screening: the controller may obtain a user resource satisfaction relationship, i.e., an association relationship, between the real-time slice ULL and the non-real-time slice BE through information in the real-time service user resource information table and the non-real-time service user resource information table, as shown in fig. 9, where a connection line indicates that the buffer resource of the real-time user and the RB resource of the non-real-time user satisfy each other. And screening out users which cannot establish the association relationship with any real-time user in the non-real-time slice, thereby forming a new user association relationship.
S23, weight calculation: the controller calculates the inter-user distance having the association relationship according to the formula (2) as the inter-user weight, and calculates the distance by using the UE1 position and the UE6 position as the inter-node weight, assuming that the UE1 and the UE6 can be associated, that is, the resources satisfy each other.
S24, node matching: an optimized matching relation table between the real-time users of the mobile phone and the users of the non-real-time monitoring service is obtained through a Hungarian algorithm with weight, so that the weight is the minimum, and the UE4, the UE5 and the UE6 under BE are supposed to BE matched.
And S3, executing matching.
As shown in fig. 17, the controller issues a matching relationship table including the mobile phone real-time service users and the non-real-time monitoring service users to the BS1 and the BS2, the BS1 sends an RB resource index corresponding to the matching relationship table to the UE1, the UE2, the UE3, and the BS2 sends an Object resource (buffer) index corresponding to the matching relationship table to the UE4, the UE5, the UE6, and the three mobile phone real-time service users can send their own data, and the three non-real-time video monitoring users first send the data to the corresponding real-time user cache to wait for sending.
When the registered real-time users (including the matching relationship) initiate the real-time resource request again, if the corresponding non-real-time user state is not changed, the BS can directly search the corresponding matching relationship of the real-time users from the matching relationship table, so that the RB resource index can be directly sent to the real-time users, and the Object resource index is sent to the corresponding non-real-time users.
Example two:
the network in the embodiment of the invention is a non-software defined network (non-SDN). Considering the following scenario, it is assumed that in a non-SDN conventional network, a BS maintains a slice resource information table shown in fig. 5, updates a user resource information table shown in fig. 6 and 7, and a real-time user under the BS initiates a real-time service request, and since the network is in a congested state and the real-time user has an RB resource borrowing requirement, the BS makes a matching decision through the real-time user resource information, thereby implementing bandwidth borrowing and cache sharing.
As shown in fig. 18, assuming that the network is in a congested state, in the scenario of this embodiment, there is one BS, under which there are three UUL real-time users of mobile phones, assuming that these three real-time users of mobile phones are unregistered users, and three connection state BE non-real-time video monitoring services, the whole process is as follows:
and S1, collecting and updating resource information.
As shown in fig. 19, when an unregistered mobile phone real-time service user under the BS has an RB resource borrowing requirement, a resource request is sent to the BS through an RB resource (ULL grant in fig. 16) reserved by a real-time slice, and since the current BS does not have a matching relationship of the user of this type, the BS updates the slice resource information table shown in fig. 5 and updates the real-time service user resource information table shown in fig. 6 according to the resource information of the mobile phone real-time user.
And S2, matching decision.
Step S2 includes the following substeps:
s21, slice matching: the BS selects a non-real-time slice whose resources satisfy each other according to the information in the slice resource information table shown in fig. 5 and the delay requirement and the resource information, and in this scenario, it is assumed that the BE slice satisfies the requirement, and the BE slice is selected.
S22, node screening: the BS can obtain the user resource satisfaction relationship, i.e. association relationship, between the real-time slice ULL and the non-real-time slice BE through the information in the real-time service user resource information table and the non-real-time service user resource information table, as shown in fig. 9, the connection line indicates that the buffer resource of the real-time user and the RB resource of the non-real-time user satisfy each other. And screening out users which cannot establish the association relationship with any real-time user in the non-real-time slice, thereby forming a new user association relationship.
S23, weight calculation: the BS calculates the inter-user distance having the association as the inter-user weight according to formula (2).
S24, node matching: the BS obtains an optimized matching relation table between the real-time users of the mobile phone and the users of the non-real-time monitoring service through the Hungarian algorithm with the weight, so that the weight is the minimum, and the UE4, the UE5 and the UE6 under the BE are supposed to BE matched.
And S3, executing matching.
As shown in fig. 20, the BS sends the RB resource index corresponding to the matching relationship table to the UE1, the UE2, the UE3, and the BS2 sends the buffer resource index corresponding to the matching relationship table to the UE4, the UE5, the UE6, and three mobile phone real-time service users can send their own data, and the three non-real-time video monitoring users first send the data to the corresponding real-time user caches to wait for sending.
As in the first embodiment, when the registered real-time user (which already includes the matching relationship) initiates the real-time resource request again, if the state of the corresponding non-real-time user does not change, the BS may directly find the corresponding matching relationship of the real-time user from the matching relationship table, so as to directly send the RB resource index to the real-time user, and send the Object resource index to the corresponding non-real-time user.
Example three:
the network in the embodiment of the invention adopts centralized resource management. Considering the following scenario, assuming that resource management on the BS adopts a centralized resource management manner, as shown in fig. 21, when a real-time user under the BS initiates a resource request, and the real-time user has a RB resource borrowing requirement due to a congested state of a network, the ULL resource management module sends a RB borrowing request to the resource management module, assuming that a matching relationship table containing the real-time user does not exist in the current BS, the resource management module reports real-time user resource information to the controller, the controller makes a matching decision, and issues the matching relationship table to the BS, and the resource management module issues a resource indication according to the matching relationship table, as shown in fig. 21, thereby implementing bandwidth borrowing and cache sharing.
As shown in fig. 22, assuming that the network is in a congested state, in the scenario of this embodiment, the network includes a controller, a BS, three unregistered ULL handset real-time service users and three connected BE non-real-time video monitoring service users under the BS, assuming that the BS adopts a centralized resource management manner, the whole process is as follows:
and S1, collecting and updating resource information.
When an unregistered mobile phone real-time service user under the BS has an RB resource borrowing requirement, a resource request is sent to an ULL resource management module in the BS through an RB resource (ULL punture shown in fig. 16) reserved by a real-time slice, as shown in fig. 21, the ULL resource management module sends the RB borrowing request to the resource management module, the resource management module sends resource information of the mobile phone real-time user to a controller, the controller updates a slice resource information table shown in fig. 5, updates a real-time service user resource information table shown in fig. 6, and a corresponding signaling flow is shown in fig. 4.
And S2, matching decision.
Step S2 includes the following substeps:
s21, slice matching: the controller selects a non-real-time slice whose resources satisfy each other according to the information in the slice resource information table shown in fig. 5 and the delay requirement and the resource information, and in this scenario, it is assumed that the BE slice satisfies the requirement, and the BE slice is selected.
S22, node screening: the controller may obtain a user resource satisfaction relationship, i.e., an association relationship, between the real-time slice ULL and the non-real-time slice BE through information in the real-time service user resource information table and the non-real-time service user resource information table, as shown in fig. 9, where a connection line indicates that the buffer resource of the real-time user and the RB resource of the non-real-time user satisfy each other. And screening out users which cannot establish the association relationship with any real-time user in the non-real-time slice, thereby forming a new user association relationship.
S23, weight calculation: the controller calculates the inter-user distance having the association relationship as the inter-user weight according to formula (2).
S24, node matching: the controller obtains an optimized matching relation table between the real-time users of the mobile phone and the users of the non-real-time monitoring service through a Hungarian algorithm with weight, so that the weight is the minimum, and the UE4, the UE5 and the UE6 under BE are supposed to BE matched.
And S3, executing matching.
The controller issues a matching relationship table containing mobile phone real-time service users and non-real-time monitoring service users to the BS, as shown in fig. 21, a resource management module in the BS issues corresponding RB resource indexes to an ULL resource management module according to the matching relationship table, and issues corresponding buffer resource indexes to a BE resource management module, the ULL resource management module issues RB resource indexes to UE1, UE2, and UE3, three mobile phone real-time service users can send their own data, the BE resource management module issues corresponding Object resource indexes to UE4, UE5, and UE6, three non-real-time video monitoring users send data to corresponding real-time user caches first, and wait for sending, and corresponding signaling flows are as shown in fig. 12.
When the registered real-time users (including the matching relationship) initiate the real-time resource request again, if the corresponding non-real-time user state is not changed, the BS can directly search the corresponding matching relationship of the real-time users from the matching relationship table, so that the RB resource index can be directly sent to the real-time users, and the Object resource index is sent to the corresponding non-real-time users.
Example four:
the network in the embodiment of the invention adopts distributed resource management. Considering the following scenario, assuming that resource management on the BS adopts a distributed resource management manner, as shown in fig. 23, when a real-time user under the BS initiates a resource request, and the real-time user has a RB resource borrowing requirement due to a congested state of a network, assuming that a matching relationship table containing the real-time user does not exist in the current BS, the ULL resource management module reports real-time user resource information to the controller, the controller makes a matching decision, and sends the matching relationship table to the BS, the ULL resource management module sends an RB resource index according to the matching relationship table, and notifies the BE resource management module through borrowing information (a borrowing identifier and an ID of the borrowed RB user), and the BE resource management module sends an Object resource (buffer) index according to the matching relationship table, as shown in fig. 23, thereby implementing bandwidth borrowing and cache sharing.
As shown in fig. 24, assuming that the network is in a congested state, in the scenario of this embodiment, the controller and the BS are included, there are three unregistered ULL handset real-time service users and three connected BE non-real-time video monitoring service users under the BS, assuming that the BS adopts a distributed resource management manner, the whole process is as follows:
and S1, collecting and updating resource information.
When an unregistered mobile phone real-time service user under the BS has an RB resource borrowing requirement, a resource request is sent to an ULL resource management module in the BS through an RB resource (ULL standard shown in fig. 16) reserved by a real-time slice, as shown in fig. 23, the ULL resource management module sends resource information of the mobile phone real-time user to a controller, the controller updates a slice resource information table shown in fig. 5, updates a real-time service user resource information table shown in fig. 6, and a corresponding signaling flow is shown in fig. 4.
And S2, matching decision.
Step S2 includes the following substeps:
s21, slice matching: the controller selects a non-real-time slice whose resources satisfy each other according to the information in the slice resource information table shown in fig. 5 and the delay requirement and the resource information, and in this scenario, it is assumed that the BE slice satisfies the requirement, and the BE slice is selected.
S22, node screening: the controller may obtain a user resource satisfaction relationship, i.e., an association relationship, between the real-time slice ULL and the non-real-time slice BE through information in the real-time service user resource information table and the non-real-time service user resource information table, as shown in fig. 9, where a connection line indicates that the buffer resource of the real-time user and the RB resource of the non-real-time user satisfy each other. And screening out users which cannot establish the association relationship with any real-time user in the non-real-time slice, thereby forming a new user association relationship.
S23, weight calculation: the controller calculates the inter-user distance having the association relationship as the inter-user weight according to formula (2).
S24, node matching: the controller obtains an optimized matching relation table between the real-time users of the mobile phone and the users of the non-real-time monitoring service through a Hungarian algorithm with weight, so that the weight is the minimum, and the UE4, the UE5 and the UE6 under BE are supposed to BE matched.
And S3, executing matching.
The controller issues a matching relationship table containing mobile phone real-time service users and non-real-time monitoring service users to the BS, as shown in fig. 23, the ULL resource management module in the BS issues corresponding RB resource indexes to the UE1, the UE2, and the UE3 according to the matching relationship table, and sends IDs of the non-real-time BE users UE4, UE5, and UE6 borrowed with RB resources to the BE resource management module, which issues corresponding Object resource indexes to the UE4, UE5, UE6, and three mobile phone real-time service users can send their own data, and three non-real-time video monitoring users first send data to corresponding real-time user caches and wait for sending, and the corresponding signaling flow chart is shown in fig. 12.
When the registered real-time users (including the matching relationship) initiate the real-time resource request again, if the corresponding non-real-time user state is not changed, the BS can directly search the corresponding matching relationship of the real-time users from the matching relationship table, so that the RB resource index can be directly sent to the real-time users, and the Object resource index is sent to the corresponding non-real-time users.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.
Claims (6)
1. A bandwidth borrowing and cache sharing method based on a Qos air interface slice is characterized by comprising the following steps:
s1, collecting and updating resource information: reporting the user resource information to a controller through a wireless base station, and maintaining and updating a slice resource information table and a user resource information table in the controller according to the user resource information;
s2, matching decision: according to the slice resource information table and the user resource information table, a matching relation table of user bandwidth borrowing and cache sharing is obtained by adopting a Hungarian algorithm;
s3, matching and executing: the matching relation table is issued to a wireless base station from a controller, a resource block resource index is issued to a real-time user through the wireless base station, a buffer resource index is issued to a non-real-time user, and resource borrowing and sharing are achieved according to the resource index;
the contents in the slice resource information table in step S1 include:
the time delay requirement, namely whether the slice service type is real-time service or non-real-time service;
the number of resource blocks, i.e., the size of the bandwidth allocated to the slice;
target number, i.e. the available buffer size under the slice;
the user resource information table in step S1 includes a real-time service user resource information table and a non-real-time service user resource information table;
the step S2 includes the following sub-steps:
s21, slice matching: selecting a non-real-time slice with mutually satisfied resources according to the information in the slice resource information table through a time delay requirement;
s22, node screening: obtaining a user association relation between the real-time slices and the non-real-time slices according to the information in the user resource information table, and screening out users in the non-real-time slices which cannot establish the association relation with any real-time user to obtain a new user association relation;
s23, weight calculation: calculating the distance between the users with the association relationship according to the new user association relationship as the weight between the users;
s24, node matching: a matching relation table of user bandwidth borrowing and cache sharing is obtained through a weighted Hungarian algorithm, and the weight between users is enabled to be minimum.
2. The method according to claim 1, wherein the content in the real-time service user resource information table comprises:
a user ID, i.e. which user under which slice belongs;
resource block requirements, namely the bandwidth size required by the real-time requirements of the user is met;
target number, i.e. the available buffer size under the slice;
target index, i.e. the specific location of the user buffer.
3. The method according to claim 1, wherein the content in the non-real-time service user resource information table comprises:
a user ID, i.e. which user under which slice belongs;
target requirements, i.e. the buffer size required by the user;
the number of resource blocks, i.e. the size of bandwidth that the user can borrow;
resource block index, i.e. the specific location of the user resource block.
4. The method for bandwidth borrowing and cache sharing according to claim 1, wherein the specific method of step S22 is:
constructing a matrix A with M rows and N columns, wherein M is the number of real-time users with real-time service requirements, N is the number of users in the non-real-time slice selected in the step S21, and the element a in the matrix AijIndicating whether the buffer resource of the ith real-time user and the resource block resource of the jth non-real-time user meet each other, namely whether an association relationship can be established, if so, aijIs 1, otherwise aijIs 0; wherein i is not less than 1 but not more than M, j is not less than 1 but not more than N, and aijSatisfy the relation:
judging whether the sum of each column of the matrix A is zero or not, and screening out the non-real-time users corresponding to the columns with the sum of zero to obtain a non-real-time user node set comprising P non-real-time users, wherein P is more than or equal to M; and taking a real-time user node set with the user number M and a non-real-time user node set with the user number P as two vertex sets of the bipartite graph, and connecting the user nodes to obtain a new user association relationship.
5. The method for bandwidth borrowing and cache sharing according to claim 4, wherein the calculation formula of the weight between users in step S23 is:
wherein (x)i,yi) Indicating the location of the ith real-time user, (x)k,yk) And (3) representing the position of the kth non-real-time user, wherein i is more than or equal to 1 and less than or equal to M, and k is more than or equal to 1 and less than or equal to P.
6. The method according to claim 1, wherein the contents of the matching relationship table in step S24 include:
a real-time user ID, which indicates which real-time user belongs to which real-time slice;
target index, namely the concrete position of the buffer provided by the real-time user;
a non-real-time user ID, which indicates which non-real-time user under which non-real-time slice belongs;
resource block index, i.e. the specific location of the resource block provided by the non-real time user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910149489.1A CN109862591B (en) | 2019-02-28 | 2019-02-28 | Bandwidth borrowing and cache sharing method based on Qos air interface slice |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910149489.1A CN109862591B (en) | 2019-02-28 | 2019-02-28 | Bandwidth borrowing and cache sharing method based on Qos air interface slice |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109862591A CN109862591A (en) | 2019-06-07 |
| CN109862591B true CN109862591B (en) | 2021-04-13 |
Family
ID=66899407
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910149489.1A Expired - Fee Related CN109862591B (en) | 2019-02-28 | 2019-02-28 | Bandwidth borrowing and cache sharing method based on Qos air interface slice |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109862591B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111813556B (en) * | 2020-07-21 | 2021-04-09 | 北京东方通软件有限公司 | Elastic expansion method of virtual cluster in cloud computing environment |
| CN112311610B (en) * | 2020-12-25 | 2021-05-18 | 视联动力信息技术股份有限公司 | Communication method and device for realizing QOS guarantee under non-IP system |
| CN113207107A (en) * | 2021-04-25 | 2021-08-03 | 浙江吉利控股集团有限公司 | Multichannel bandwidth regulation and control method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013155673A1 (en) * | 2012-04-17 | 2013-10-24 | 中兴通讯股份有限公司 | Management method and apparatus for on-chip shared cache |
| CN105515880A (en) * | 2016-01-25 | 2016-04-20 | 重庆邮电大学 | Token bucket traffic shaping method suitable for fusion network |
| CN109041132A (en) * | 2018-09-26 | 2018-12-18 | 电子科技大学 | Ultralow time delay uplink service stream resource reservation and distribution method based on slice of eating dishes without rice or wine |
-
2019
- 2019-02-28 CN CN201910149489.1A patent/CN109862591B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013155673A1 (en) * | 2012-04-17 | 2013-10-24 | 中兴通讯股份有限公司 | Management method and apparatus for on-chip shared cache |
| CN105515880A (en) * | 2016-01-25 | 2016-04-20 | 重庆邮电大学 | Token bucket traffic shaping method suitable for fusion network |
| CN109041132A (en) * | 2018-09-26 | 2018-12-18 | 电子科技大学 | Ultralow time delay uplink service stream resource reservation and distribution method based on slice of eating dishes without rice or wine |
Non-Patent Citations (2)
| Title |
|---|
| Low-complexity Dynamic Resource Slicing for Mixed Traffics in Virtualized Radio Access Network;Guolin Sun等;《2018 IEEE 43rd Conference on Local Computer Networks (LCN)》;20190211;全文 * |
| 面向5G RAN的网络切片技术;王燚等;《电信科学》;20180331;第34卷(第3期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109862591A (en) | 2019-06-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20220369204A1 (en) | Method and device for providing service to user device by using network slice in communication system | |
| EP3817449B1 (en) | Methods, device and computer-readable medium for determining background traffic transmission policy | |
| US20190075431A1 (en) | Function Selection Based on Utilization Level in 5G Environments | |
| CN110574439A (en) | Network slice selection in a wireless telecommunications network | |
| US20210176650A1 (en) | Methods, Network Function Entities and Computer Readable Media for Data Collection | |
| CN109862591B (en) | Bandwidth borrowing and cache sharing method based on Qos air interface slice | |
| CN101686497A (en) | Cell load equalization method, and cell load evaluation method and device | |
| US20220408293A1 (en) | Method and device for providing network analysis information for rfsp index selection in mobile communication network | |
| US11212857B2 (en) | Predictive bearer assignment for wireless networks | |
| EP3962171A1 (en) | User equipment centric wide area optimization method and system thereof | |
| WO2021092937A1 (en) | Method, system and apparatus for determining strategy | |
| CN117546451A (en) | Methods, systems, and computer readable media for optimizing network traffic allocation during producer Network Function (NF) selection using producer NF performance based on slot tracking | |
| CN114007204B (en) | Communication selection method and device based on relay communication and direct communication | |
| WO2015106450A1 (en) | Load balancing among wireless access points | |
| CN110019511B (en) | Communication method and communication device thereof | |
| CN103533342A (en) | Method and device for detecting mobile video quality | |
| CN106817734B (en) | Load sharing judgment system, server and method for multiple wireless networks | |
| CN104640177A (en) | Energy-efficiency-based cell selection method for multilevel heterogeneous network | |
| CN116112946A (en) | Communication method and device | |
| WO2023029625A1 (en) | Service quality processing method and apparatus, and communication system | |
| WO2023151586A1 (en) | Method for reporting target plane capability of network function instance or network element, method for acquiring target plane capability of network function instance or network element, and device | |
| KR20210054972A (en) | Method and apparatus for controlling sessions with network quota in a wireless communication system | |
| CN108449281B (en) | Network flow cooperative unloading method and cooperative unloading controller | |
| EP4135413B1 (en) | Communication network arrangement and method for selecting a network component | |
| WO2022088647A1 (en) | Communication method and system, and base station and terminal |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210413 |