CN109862591A - It is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method - Google Patents
It is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method Download PDFInfo
- Publication number
- CN109862591A CN109862591A CN201910149489.1A CN201910149489A CN109862591A CN 109862591 A CN109862591 A CN 109862591A CN 201910149489 A CN201910149489 A CN 201910149489A CN 109862591 A CN109862591 A CN 109862591A
- Authority
- CN
- China
- Prior art keywords
- user
- resource
- slice
- time
- real
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses it is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method, including resource information collect and update, match decision and matching execute three steps.Compared with traditional resource distribution mode, the invention avoids due to active user resource is caused to be unable to satisfy for network congestion bring active user business abandon the case where.The present invention solves the problems, such as that active user can not obtain resource requirement when conventional situation lower network is in congestion state, the present invention provides the matching relationship that one borrows non real time user RB resource, active user can borrow non real time user RB resource to meet oneself requirement of real-time；And when active user borrows non real time user RB resource, the matching relationship that non real time user can equally provide according to the present invention finds corresponding active user, stores data to be sent using its target cache resource.
Description
Technical field
The invention belongs to network slice and service quality technical fields, and in particular to a kind of band for eating dishes without rice or wine to be sliced based on Qos
Width borrows the design with caching sharing method.
Background technique
It in a network, can be with due to the difference that terminal user Qos (Quality of Service, service quality) requires
User is classified according to Qos, i.e., is sliced based on Qos and user (UE) is divided into real time business type (ULL) and non-real-time service class
Type (BE).Real time business is relatively high to delay requirement, and due to requirement of real-time, buffer (caching) utilization rate of real time business is very
Low, when network congestion, real time business is probably because bandwidth is unable to get satisfaction and is dropped；And non-real-time service clock synchronization is prolonged
It is required that it is insensitive, it can delay to send by buffer temporal data.It can be in communication with each other between terminal user, a terminal
Another terminal can be sent by the data of oneself, be temporarily stored into its buffer, another terminal is waited to replace oneself sending data.
And in the prior art, when network is under congestion state, it is difficult to guarantee that real time business is sliced the requirement of real-time of interior user.
Summary of the invention
The purpose of the present invention is to propose to it is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method, work as network
Under congestion state, it can guarantee that real time business is sliced interior user's requirement of real-time, be given for real time business with non-real-time service
The matched solution of terminal resource that a kind of bandwidth borrows out and caching is shared.
The technical solution of the present invention is as follows: it is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method, including with
Lower step:
S1, resource information are collected and are updated: by wireless base station by user resources information reporting to controller, in controller
It is middle that slice resource information table and user resources information table are safeguarded and updated according to user resources information.
S2, match decision: according to slice resource information table and user resources information table, one is obtained using Hungary Algorithm
User bandwidth borrows the matching relationship table shared with caching.
S3, matching execute: matching relationship table being handed down to wireless base station from controller, by wireless base station to active user
Down distributing resource block resource index issues buffer resource index to non real time user, according to resource index realize resource borrowing and
It is shared.
Further, the content in the slice resource information table in step S1 includes:
Delay requirement, i.e. the slice type of service are real time business or non-real-time service；
Resource block quantity distributes to the amount of bandwidth of the slice；
Destination number can use buffer size that is, under the slice.
Further, the user resources information table in step S1 includes real-time traffic users resource information table and non real-time industry
Business user resources information table.
Further, the content in real-time traffic users resource information table includes:
User ID shows which user belonged under which slice；
Resource block demand, that is, amount of bandwidth needed for meeting user's real-time requirement；
Destination number can use buffer size that is, under the slice；
Target index, the i.e. specific location of the user buffer.
Further, the content in non-real-time service user resources information table includes:
User ID shows which user belonged under which slice；
Target requirement, i.e. buffer size needed for user；
The amount of bandwidth that resource block quantity, the i.e. user can be borrowed；
Resource block index, the i.e. specific location of the user resources block.
Further, step S2 include it is following step by step:
S21, slice matching: according to the information in slice resource information table, select a resource mutual by delay requirement
The non real-time slice met.
S22, node screening: it is obtained being sliced the user with non real-time slice in real time according to the information in user resources information table
The user that incidence relation cannot be established with any active user in non real-time slice is screened out, obtains new user by incidence relation
Incidence relation.
S23, weight calculation: according to new user-association relationship, the distance between relevant user conduct is calculated
Weight between user.
S24, node matching: a user bandwidth is obtained by the Hungary Algorithm of Weight and borrows shared with caching
With relation table, so that the weight between user is minimum.
Further, step S22 method particularly includes:
The matrix A of M row N column is constructed, wherein M is the active user quantity for there are real-time traffic demands, and N is step S21
Number of users in the non real-time slice of middle selection, the element a in matrix AijIndicate the buffer resource of i-th of active user with
Whether the resource block resource of j-th of non real time user meets mutually, i.e., whether can establish incidence relation, if then aijValue be 1,
Otherwise aijValue be 0；Wherein 1≤i≤M, 1≤j≤N, and aijMeet relational expression:
The each column of judgment matrix A and whether be zero, non real time user corresponding with the column for zero is screened out, obtains one
Non real time user node set including P non real time user, P >=M；By number of users be M active user node set and
Number of users is two vertex sets of the non real time user node set of P as bipartite graph, and carries out line to each user node, is obtained
To new user-association relationship.
Further, the calculation formula of the weight in step S23 between user are as follows:
Wherein (xi,yi) indicate i-th of active user position, (xk,yk) indicate k-th of non real time user position, 1
≤i≤M,1≤k≤P。
Further, the content in the matching relationship table in step S24 includes:
Active user ID shows which active user belonged under which is sliced in real time；
The specific location for the buffer that target index, the i.e. active user provide；
Non real time user ID shows which non real time user belonged under which non real-time slice；
The specific location for the resource block that resource block index, the i.e. non real time user provide.
The beneficial effects of the present invention are:
(1) the present invention is based on the slice networks of Qos to give under network congestion state to real time business and non-real-time service
The matched solution of terminal resource that a kind of bandwidth borrows and caching is shared is gone out.Compared with traditional resource distribution mode,
The case where the invention avoids bring active user business abandons due to active user resource is caused to be unable to satisfy for network congestion.
(2) present invention, which efficiently solves active user when conventional situation lower network is in congestion state, can not obtain resource need
The problem of asking, the present invention provides the matching relationships that one borrows non real time user RB resource, and active user can borrow non real-time
User RB resource meets oneself requirement of real-time；And when active user borrows non real time user RB resource, non real time user
The matching relationship that can equally provide according to the present invention finds corresponding active user, is stored using its target cache resource to be sent
Data.
Detailed description of the invention
Fig. 1 show provided in an embodiment of the present invention a kind of borrow and the shared side of caching based on the eat dishes without rice or wine bandwidth of slice of Qos
Method flow chart.
Fig. 2 show shared preceding cache resources instruction figure provided in an embodiment of the present invention.
Fig. 3 show shared rear cache resources instruction figure provided in an embodiment of the present invention.
Fig. 4 show resource information provided in an embodiment of the present invention and collects signaling process figure.
Fig. 5 show slice resource information provided in an embodiment of the present invention and indicates to be intended to.
Fig. 6 show real-time traffic users resource information provided in an embodiment of the present invention and indicates to be intended to.
Fig. 7 show non-real-time service user resources information table schematic diagram provided in an embodiment of the present invention.
Fig. 8 show match decision provided in an embodiment of the present invention flow chart step by step.
Fig. 9 show node screening schematic diagram provided in an embodiment of the present invention.
Figure 10 show the user-association relation schematic diagram of Weight provided in an embodiment of the present invention.
Figure 11 show matching relationship provided in an embodiment of the present invention and indicates to be intended to.
Figure 12 show matching provided in an embodiment of the present invention and executes signaling process figure.
Figure 13 show match hit signaling process figure provided in an embodiment of the present invention.
Figure 14 show the scene figure of the offer of the embodiment of the present invention one.
Figure 15 show the information update signaling process figure of the offer of the embodiment of the present invention one.
Figure 16 show resource block resource schematic diagram before borrow provided in an embodiment of the present invention.
The matching that Figure 17 show the offer of the embodiment of the present invention one executes signaling process figure.
Figure 18 show scene figure provided by Embodiment 2 of the present invention.
Figure 19 show information update signaling process figure provided by Embodiment 2 of the present invention.
Figure 20 show matching provided by Embodiment 2 of the present invention and executes signaling process figure.
Figure 21 show the centralized resource management schematic diagram of the offer of the embodiment of the present invention three.
Figure 22 show the scene figure of the offer of the embodiment of the present invention three.
Figure 23 show the distributed resource management schematic diagram of the offer of the embodiment of the present invention four.
Figure 24 show the scene figure of the offer of the embodiment of the present invention four.
Specific embodiment
Carry out detailed description of the present invention illustrative embodiments with reference to the drawings.It should be appreciated that shown in attached drawing and
The embodiment of description is only exemplary, it is intended that is illustrated the principle and spirit of the invention, and is not limited model of the invention
It encloses.
The embodiment of the invention provides it is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method, such as Fig. 1 institute
Show, include the following steps S1~S3:
S1, resource information are collected and are updated: user (UE) resource information is reported to by controller by wireless base station (BS),
Slice resource information table and user resources information table are safeguarded and updated according to user resources information in the controller.
Step S1 is mainly that controller needs to collect some resource informations, the amount of bandwidth as needed for real time business (ULL), i.e.,
Resource block (RB) quantity provides buffer size, i.e. target (Object) quantity and target (Object) index.Such as Fig. 2 and
Shown in Fig. 3, buffer size can be abstracted into Object quantity；Object quantity needed for non-real-time service (BE), possesses RB number
Amount and RB index, prepare for match decision.Controller resource information collects process as shown in figure 4, controller will safeguard this
Category information, therefore introduce two kinds of data structures: (1) it is sliced resource information table；(2) user resources information table.
Wherein resource information table is sliced as shown in figure 5, one slice resource information table of the maintenance of controller needs and update, is somebody's turn to do
Table is used for when real time business bandwidth resource is insufficient, and active user borrows non real time user bandwidth resources and non real time user is total
When enjoying active user cache resources, the match selection of different type slice (delay requirement is different) is sliced in resource information table
Content includes:
Delay requirement, i.e. the slice type of service are real time business or non-real-time service；
Resource block (RB) quantity, that is, distribute to the amount of bandwidth of the slice；
Target (Object) quantity can use buffer size that is, under the slice.
A super real-time industry can be made by RB quantity and available Object quantity (bandwidth and caching meet mutually)
The slice match selection that the bandwidth of business and non-super real time business borrows and caching is shared.
Controller will also be one user resources information table of ISP SP maintenance and update, the table for each slice
For after selecting the matching of slice, according to Hungary Algorithm make two be sliced between incidence relation between user.Due to
The difference of delay requirement matches resource provider in the shared resources of incidence relation and provides resource difference, therefore user provides
Source information table can require slice according to Qos to be divided into ULL here because of information difference in difference (difference service) table of delay requirement
Service and BE service two classes, therefore user resources information table includes real-time traffic users resource information table and non-real-time service user
Resource information table.
As shown in fig. 6, the content in real-time traffic users resource information table includes:
User ID shows which user belonged under which slice；
Resource block (RB) demand, that is, amount of bandwidth needed for meeting user's real-time requirement；
Target (Object) quantity can use buffer size that is, under the slice；
Target (Object) index, the i.e. specific location of the user buffer.
As shown in fig. 7, the content in non-real-time service user resources information table includes:
User ID shows which user belonged under which slice；
Target (Object) demand, i.e. buffer size needed for user；
The amount of bandwidth that resource block (RB) quantity, the i.e. user can be borrowed；
Resource block (RB) index, the i.e. specific location of the user resources block.
S2, match decision: according to slice resource information table and user resources information table, one is obtained using Hungary Algorithm
User bandwidth borrows the matching relationship table shared with caching.
Step S2 mainly includes match decision algorithm, and match decision algorithm is used to generate an active user and non real-time use
Family bandwidth borrows the corresponding relationship shared with caching, which is abstracted into the breast of a Weight in the embodiment of the present invention
The Optimum Matching problem that tooth benefit algorithm calculates.The Optimum Matching problem of the Hungary Algorithm of Weight refers to, ask one it is one-to-one
Matching relationship keep the weight cost of Weight bipartite graph minimum, weight indicates that establishing incidence relation between two users is spent here
Cost size.In the present invention in embodiment, controller first has to find the non-reality that a resource meets mutually according to delay requirement
When be sliced, one is then found in the slice can meet and establish the non real-time industry of corresponding relationship with real time business (ULL) node
Business (BE) node set, then obtains matching relationship by Hungary Algorithm.
As shown in figure 8, step S2 includes following S21~S24 step by step:
S21, slice matching: according to the information in slice resource information table, select a resource mutual by delay requirement
The non real-time slice met.
S22, node screening: it is obtained being sliced the user with non real-time slice in real time according to the information in user resources information table
The user that incidence relation cannot be established with any active user in non real-time slice is screened out, obtains new user by incidence relation
Incidence relation.
The matrix A of M row N column is constructed first, and wherein M is the active user quantity for there are real-time traffic demands, and N is step
The number of users in non real-time slice selected in S21, the element a in matrix AijIndicate the buffer money of i-th of active user
Whether source and the resource block resource of j-th of non real time user meet mutually, i.e., whether incidence relation can be established, if then aijValue
It is 1, otherwise aijValue be 0；Wherein 1≤i≤M, 1≤j≤N, and aijMeet relational expression:
Formula (1) indicates each active user, and at least one can meet mutually the non real time user of resource requirement.Judgement
The each column of matrix A and whether be zero, non real time user corresponding with the column for zero is screened out, obtaining one includes P non-realities
When user non real time user node set, since active user will correspond non real time user, then P >=M, otherwise needs
Reselect non real-time slice.As shown in figure 9, illustrating non real-time use for being equal to 3, N equal to 5 with M in the embodiment of the present invention
Family group selection process, line indicates that resource meets mutually between user.Active user node set and user by number of users for M
Number is two vertex sets of the non real time user node set of P as bipartite graph, and carries out line to each user node, is obtained new
User-association relationship.
S23, weight calculation: according to new user-association relationship, the distance between relevant user conduct is calculated
Weight between user.
In the embodiment of the present invention by active user between non real time user at a distance from be used as weighted value, since controller can be with
Know user location, therefore can use user location and calculate distance, then the calculation formula of the weight between user are as follows:
Wherein (xi,yi) indicate i-th of active user position, (xk,yk) indicate k-th of non real time user position, 1
≤i≤M,1≤k≤P.If the element a in matrix AijValue is zero, then respective weights value is set as infinitely great, with the screening of Fig. 9 node
For afterwards, select after as weight, the user-association relationship of Weight is as shown in Figure 10.
S24, node matching: a user bandwidth is obtained by the Hungary Algorithm of Weight and borrows shared with caching
With relation table, so that the weight between user is minimum.
As shown in figure 11, the content in matching relationship table includes:
Active user ID shows which active user belonged under which is sliced in real time；
The specific location for the buffer that target index, the i.e. active user provide；
Non real time user ID shows which non real time user belonged under which non real-time slice；
The specific location for the resource block that resource block index, the i.e. non real time user provide.
S3, matching execute: matching relationship table being handed down to wireless base station from controller, by wireless base station to active user
Down distributing resource block resource index issues buffer resource index to non real time user, according to resource index realize resource borrowing and
It is shared.
As shown in figure 12, the matching relationship table of generation is handed down to wireless base station (BS) by controller, and BS is according to matching relationship
RB resource index is sent to the active user of resource requirement by table, and it is corresponding that buffer resource index is sent to matching
It is borrowed the non real time user of RB resource, active user can be sent the data of oneself by the RB resource of borrow, be borrowed RB
The non real time user of resource then can the data first to be sent oneself be first sent in corresponding active user caching, wait the reality
When user replace oneself send data.
As shown in figure 13, when registered active user (its included matching relationship) initiates real-time business request again
When, if corresponding non-real-time service User Status does not change, i.e., the active user matching relationship still has, then need not
By its matching relationship of controller decision, BS can directly pass through matching relationship table, and corresponding RB resource index is handed down to reality
When user, corresponding buffer resource index is sent to non real time user.Active user can be sent by the RB resource of borrow
The data of oneself, be borrowed the non real time user of RB resource then can the data first to be sent oneself be first sent to it is corresponding real-time
In user cache, the active user is waited to replace oneself sending data.
The bandwidth under four kinds of different network environments is borrowed with four specific embodiments below and is carried out with caching sharing method
It is described in detail.
Embodiment one:
Network in the embodiment of the present invention is software defined network (Software Defined Network, SDN).Consider
Following scene, the active user under a certain wireless base station (BS) initiates real-time business request, since network be in congestion state, reality
When user have resource block (RB) resource borrowing demand, which reports active user resource information, does match decision by controller,
Due to may include multiple BS under controller, the slice resource information table of controller maintenance includes the slice under multiple BS, slice
With the non real-time slice for meeting resource requirement that may be selected under another BS.
As shown in figure 14, it is assumed that network is in congestion state, includes a controller, packet in scene of the embodiment of the present invention
Assumed containing two BS (BS1 and BS2), under BS1 there are three the mobile phone real-time traffic users of unregistered (not including matching relationship),
There are three connected state (its included resource information of controller) non real-time video monitoring service user, whole process under BS2
It is as follows:
S1, resource information are collected and are updated.
As shown in figure 15, when the unregistered mobile phone real-time traffic users under BS1 have RB resource borrowing demand, pass through reality
When the reserved RB resource (in Figure 16 shown in ULL Puncture) of slice to send resource request to BS1, since current BS1 is not deposited
There is the matching relationship of such user, BS1 is by resource information (RB demand, buffer size (the Object number of mobile phone active user
Amount) and index) and ID be sent to controller, controller will update slice resource information table shown in fig. 5, shown in update Fig. 6
Real-time traffic users resource information table.
S2, match decision.
Step S2 include it is following step by step:
S21, slice matching: controller is sliced information in resource information table according to figure 5, by delay requirement and
Resource information selects the non real-time slice that meets mutually of a resource, in the scene, it is assumed that and the BE slice under BS2 is met the requirements,
The BE is selected to be sliced.
S22, node screening: controller is believed by real-time traffic users resource information table and non-real-time service user resources
The information in table is ceased, available real-time slice ULL and the non real-time user resources for being sliced BE meet relationship i.e. incidence relation, such as
Shown in Fig. 9, line indicates that the buffer resource of the active user mutually meets with the RB resource of the non real time user.By will be non-
The user that incidence relation cannot be established with any active user in slice in real time screens out, and closes to form a new user-association
System.
S23, weight calculation: distance is weighed as between user between controller calculates relevant user according to formula (2)
Weight, it is assumed that i.e. resource can be associated between UE1 and UE6 and mutually met, then distance is calculated by the position UE1 and the position UE6, by them
Between distance as weight between two nodes.
S24, node matching: by the Hungary Algorithm of Weight obtain one optimization mobile phone active user with it is non real-time
Matching relationship table between monitoring business user, so that weight is minimum, it is assumed that be matched to UE4 under BE, UE5, UE6.
S3, matching execute.
As shown in figure 17, controller will be closed comprising the matching of mobile phone real-time traffic users and non real-time monitoring business user
It is that table is handed down to BS1 and BS2, BS1 will correspond to RB resource index according to matching relationship table and be sent to UE1, UE2, UE3, and BS2 will
Object resource (buffer) index, which is corresponded to, according to matching relationship table is sent to UE4, UE5, UE6, three mobile phone real time business use
The i.e. transmittable data in family, three non-real-time video monitoring users first transmit data in corresponding active user caching, etc.
It is to be sent.
When registered active user (having included its matching relationship) initiates real time resources request again, if corresponding non-
Active user state does not change, then the Corresponding matching that BS can directly find active user from matching relationship table closes
System, so as to which RB resource index is directly sent to active user, Object resource index is handed down to corresponding non real-time use
Family.
Embodiment two:
Network in the embodiment of the present invention is that non-software defines network (non-SDN).Consider following scene, it is assumed that in non-SDN
Traditional network in, slice resource information table shown in fig. 5 is safeguarded by BS, updates Fig. 6 and user resources information shown in Fig. 7
Table, the active user under BS initiate real-time business request, and since network be in congestion state, active user has RB resource borrowing need
It asks, then match decision is done by active user resource information by BS, to realize that bandwidth borrows and caching is shared.
As shown in figure 18, it is assumed that network is in congestion state, includes a BS, at the BS in the embodiment scene
There are three UUL mobile phone real-time traffic users, it is assumed that these three mobile phone active users are non-registered users and three connected state BE
Non-real-time video monitoring business, whole process are as follows:
S1, resource information are collected and are updated.
As shown in figure 19, when the unregistered mobile phone real-time traffic users under BS have RB resource borrowing demand, pass through reality
When the reserved RB resource (in Figure 16 shown in ULL Puncture) of slice to send resource request to BS, since current BS does not have
The matching relationship of such user, BS update slice resource information shown in fig. 5 for according to the resource information of mobile phone active user
Table updates real-time traffic users resource information table shown in fig. 6.
S2, match decision.
Step S2 include it is following step by step:
S21, slice matching: BS is sliced information in resource information table according to figure 5, passes through delay requirement and resource
Information selects the non real-time slice that meets mutually of a resource, in the scene, it is assumed that BE slice is met the requirements, and the BE is selected to cut
Piece.
S22, node screening: BS passes through real-time traffic users resource information table and non-real-time service user resources information table
In information, it is available it is real-time slice ULL and it is non real-time slice BE user resources meet relationship i.e. incidence relation, such as Fig. 9
Shown, line indicates that the buffer resource of the active user mutually meets with the RB resource of the non real time user.By by non-reality
When slice in cannot establish incidence relation with any active user user screen out, closed to form a new user-association
System.
Distance is as weight between user between S23, weight calculation: BS calculate relevant user according to formula (2).
S24, node matching: BS obtain the mobile phone active user and non-reality that one optimizes by the Hungary Algorithm of Weight
When monitoring business user between matching relationship table so that weight is minimum, it is assumed that be matched to UE4 under BE, UE5, UE6.
S3, matching execute.
As shown in figure 20, BS will correspond to RB resource index according to matching relationship table and be sent to UE1, UE2, UE3, and BS2 is by root
It is transmittable for corresponding to buffer resource index to be sent to UE4, UE5, UE6, three mobile phone real-time traffic users according to matching relationship table
Data, three non-real-time video monitoring users first transmit data in corresponding active user caching, wait to be sent.
It is the same as example 1, when registered active user (having included its matching relationship) initiates real time resources request again
When, if corresponding non real time user state does not change, BS can directly find real-time use from matching relationship table
The Corresponding matching relationship at family, so as to which RB resource index is directly sent to active user, Object resource index is handed down to
Corresponding non real time user.
Embodiment three:
Network in the embodiment of the present invention uses centralized resource management.Consider following scene, it is assumed that the upper resource management of BS
Using the resource management mode of centralization, as shown in figure 21, when active user initiates resource request under BS, since network is in
Congestion state, when active user has RB resource borrowing demand, ULL resource management module will be sent to resource management module borrows RB
Request, it is assumed that do not have the matching relationship table comprising the active user in current BS, then resource management module reports active user
Resource information makes match decision to controller, controller, issues matching relationship table to BS, resource management module is closed according to matching
It is the instruction of table down distributing resource, as shown in figure 21, to realize that bandwidth borrows and caching is shared.
As shown in figure 22, it is assumed that network is in congestion state, in the embodiment scene, include a controller, a BS,
There are three unregistered ULL mobile phone real-time traffic users and the BE non-real-time video monitoring business of three connected states under the BS
User, it is assumed that BS uses centralized resource management mode, and whole process is as follows:
S1, resource information are collected and are updated.
It is reserved by being sliced in real time when the unregistered mobile phone real-time traffic users under BS have RB resource borrowing demand
RB resource (in Figure 16 shown in ULL Puncture) carrys out the ULL resource management module into BS and sends resource request, as shown in figure 21,
ULL resource management module then sends RB to resource management module and borrows request, and resource management module is by the money of mobile phone active user
Source information is sent to controller, and controller will update slice resource information table shown in fig. 5, and update real time business shown in fig. 6
User resources information table, corresponding signaling process are as shown in Figure 4.
S2, match decision.
Step S2 include it is following step by step:
S21, slice matching: controller is sliced information in resource information table according to figure 5, by delay requirement and
Resource information selects the non real-time slice that meets mutually of a resource, in the scene, it is assumed that BE slice is met the requirements, and selects the BE
Slice.
S22, node screening: controller is believed by real-time traffic users resource information table and non-real-time service user resources
The information in table is ceased, available real-time slice ULL and the non real-time user resources for being sliced BE meet relationship i.e. incidence relation, such as
Shown in Fig. 9, line indicates that the buffer resource of the active user mutually meets with the RB resource of the non real time user.By will be non-
The user that incidence relation cannot be established with any active user in slice in real time screens out, and closes to form a new user-association
System.
S23, weight calculation: distance is weighed as between user between controller calculates relevant user according to formula (2)
Weight.
S24, node matching: controller by the Hungary Algorithm of Weight obtain one optimization mobile phone active user with
Matching relationship table between non real-time monitoring business user, so that weight is minimum, it is assumed that be matched to UE4 under BE, UE5, UE6.
S3, matching execute.
Matching relationship table comprising mobile phone real-time traffic users and non real-time monitoring business user is handed down to by controller
Corresponding RB resource index is sent to ULL resource management according to matching relationship table by BS, as shown in figure 21, BS resource management module
Corresponding buffer resource index is sent to BE resource management module by module, and ULL resource management module issues RB resource index
Give UE1, UE2, UE3, three mobile phone real-time traffic users i.e. transmittable data, BE resource management module will corresponding Object
Resource index is handed down to UE4, UE5, UE6, three non-real-time videos monitoring users, and first to transmit data to corresponding active user slow
In depositing, wait to be sent, corresponding signaling process is as shown in figure 12.
When registered active user (having included its matching relationship) initiates real time resources request again, if corresponding non-
Active user state does not change, then the Corresponding matching that BS can directly find active user from matching relationship table closes
System, so as to which RB resource index is directly sent to active user, Object resource index is handed down to corresponding non real-time use
Family.
Example IV:
Network in the embodiment of the present invention uses distributed resource management.Consider following scene, it is assumed that the upper resource management of BS
Using distributed resource management mode, as shown in figure 23, when active user initiates resource request under BS, since network is in
Congestion state, when active user has RB resource borrowing demand, it is assumed that do not have the matching comprising the active user in current BS and close
It is table, ULL resource management module will report active user resource information to controller, and controller makes match decision, issue
With relation table to BS, ULL resource management module issues RB resource index according to matching relationship table, and (is borrowed by borrowing information
BE resource management module is notified with the ID for identifying and being borrowed RB user), and BE resource management module is then according to matching relationship table
Object resource (buffer) index is issued, as shown in figure 23, to realize that bandwidth borrows and caching is shared.
As shown in figure 24, it is assumed that network is in congestion state, in the embodiment scene, include a controller, a BS,
There are three unregistered ULL mobile phone real-time traffic users and the BE non-real-time video monitoring business of three connected states under the BS
User, it is assumed that BS uses distributed resource management mode, and whole process is as follows:
S1, resource information are collected and are updated.
It is reserved by being sliced in real time when the unregistered mobile phone real-time traffic users under BS have RB resource borrowing demand
RB resource (in Figure 16 shown in ULL Puncture) carrys out the ULL resource management module into BS and sends resource request, as shown in figure 23,
The resource information of mobile phone active user is sent to controller by ULL resource management module, and controller will update slice shown in fig. 5
Resource information table, updates real-time traffic users resource information table shown in fig. 6, and corresponding signaling process is as shown in Figure 4.
S2, match decision.
Step S2 include it is following step by step:
S21, slice matching: controller is sliced information in resource information table according to figure 5, by delay requirement and
Resource information selects the non real-time slice that meets mutually of a resource, in the scene, it is assumed that BE slice is met the requirements, and selects the BE
Slice.
S22, node screening: controller is believed by real-time traffic users resource information table and non-real-time service user resources
The information in table is ceased, available real-time slice ULL and the non real-time user resources for being sliced BE meet relationship i.e. incidence relation, such as
Shown in Fig. 9, line indicates that the buffer resource of the active user mutually meets with the RB resource of the non real time user.By will be non-
The user that incidence relation cannot be established with any active user in slice in real time screens out, and closes to form a new user-association
System.
S23, weight calculation: distance is weighed as between user between controller calculates relevant user according to formula (2)
Weight.
S24, node matching: controller by the Hungary Algorithm of Weight obtain one optimization mobile phone active user with
Matching relationship table between non real-time monitoring business user, so that weight is minimum, it is assumed that be matched to UE4 under BE, UE5, UE6.
S3, matching execute.
Matching relationship table comprising mobile phone real-time traffic users and non real-time monitoring business user is handed down to by controller
BS, as shown in figure 23, ULL resource management module will be sent to UE1 under corresponding RB resource index according to matching relationship table in BS,
UE2, UE3, and the non real-time BE user UE4 that will be borrowed RB resource, the ID of UE5, UE6 are sent to BE resource management module,
Corresponding Object resource index is handed down to UE4, UE5, UE6, three mobile phone realities according to matching relationship table by BE resource management module
When service-user data can be transmitted, it is slow that three non-real-time videos monitoring users first transmit data to corresponding active user
In depositing, wait to be sent, corresponding signaling process figure is as shown in figure 12.
When registered active user (having included its matching relationship) initiates real time resources request again, if corresponding non-
Active user state does not change, then the Corresponding matching that BS can directly find active user from matching relationship table closes
System, so as to which RB resource index is directly sent to active user, Object resource index is handed down to corresponding non real-time use
Family.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair
Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.This field
Those of ordinary skill disclosed the technical disclosures can make according to the present invention and various not depart from the other each of essence of the invention
The specific variations and combinations of kind, these variations and combinations are still within the scope of the present invention.
Claims (9)
1. it is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method, which comprises the following steps:
S1, resource information are collected and are updated: by wireless base station by user resources information reporting to controller, root in the controller
Slice resource information table and user resources information table are safeguarded and updated according to user resources information；
S2, match decision: according to slice resource information table and user resources information table, a user is obtained using Hungary Algorithm
Bandwidth borrows the matching relationship table shared with caching；
S3, matching execute: matching relationship table being handed down to wireless base station from controller, is issued by wireless base station to active user
Resource block resource index issues buffer resource index to non real time user, realizes resource borrowing according to resource index and shares.
2. bandwidth according to claim 1 borrows and caching sharing method, which is characterized in that the slice in the step S1
Content in resource information table includes:
Delay requirement, i.e. the slice type of service are real time business or non-real-time service；
Resource block quantity distributes to the amount of bandwidth of the slice；
Destination number can use buffer size that is, under the slice.
3. bandwidth according to claim 1 borrows and caching sharing method, which is characterized in that the user in the step S1
Resource information table includes real-time traffic users resource information table and non-real-time service user resources information table.
4. bandwidth according to claim 3 borrows and caching sharing method, which is characterized in that the real-time traffic users money
Content in source information table includes:
User ID shows which user belonged under which slice；
Resource block demand, that is, amount of bandwidth needed for meeting user's real-time requirement；
Destination number can use buffer size that is, under the slice；
Target index, the i.e. specific location of the user buffer.
5. bandwidth according to claim 3 borrows and caching sharing method, which is characterized in that the non-real-time service user
Content in resource information table includes:
User ID shows which user belonged under which slice；
Target requirement, i.e. buffer size needed for user；
The amount of bandwidth that resource block quantity, the i.e. user can be borrowed；
Resource block index, the i.e. specific location of the user resources block.
6. bandwidth according to claim 1 borrows and caching sharing method, which is characterized in that the step S2 includes following
Step by step:
S21, slice matching: according to the information in slice resource information table, a resource is selected to meet mutually by delay requirement
Non real-time slice；
S22, node screening: it is obtained being sliced the user-association with non real-time slice in real time according to the information in user resources information table
The user that incidence relation cannot be established with any active user in non real-time slice is screened out, obtains new user-association by relationship
Relationship；
S23, weight calculation: according to new user-association relationship, the distance between relevant user is calculated as user
Between weight；
S24, node matching: a user bandwidth is obtained by the Hungary Algorithm of Weight and borrows the matching pass shared with caching
It is table, so that the weight between user is minimum.
7. bandwidth according to claim 6 borrows and caching sharing method, which is characterized in that the step S22's is specific
Method are as follows:
The matrix A of M row N column is constructed, wherein M is the active user quantity for there are real-time traffic demands, and N is to select in step S21
The number of users in non real-time slice selected, the element a in matrix AijIndicate the buffer resource and jth of i-th of active user
Whether the resource block resource of a non real time user meets mutually, i.e., whether can establish incidence relation, if then aijValue be 1, it is no
Then aijValue be 0；Wherein 1≤i≤M, 1≤j≤N, and aijMeet relational expression:
The each column of judgment matrix A and whether be zero, non real time user corresponding with the column for zero is screened out, obtaining one includes
The non real time user node set of P non real time user, P >=M；Active user node set and user by number of users for M
Number is two vertex sets of the non real time user node set of P as bipartite graph, and carries out line to each user node, is obtained new
User-association relationship.
8. bandwidth according to claim 7 borrows and caching sharing method, which is characterized in that user in the step S23
Between weight calculation formula are as follows:
Wherein (xi,yi) indicate i-th of active user position, (xk,yk) indicate k-th of non real time user position, 1≤i≤
M,1≤k≤P。
9. bandwidth according to claim 6 borrows and caching sharing method, which is characterized in that in the step S24
Include: with the content in relation table
Active user ID shows which active user belonged under which is sliced in real time；
The specific location for the buffer that target index, the i.e. active user provide；
Non real time user ID shows which non real time user belonged under which non real-time slice；
The specific location for the resource block that resource block index, the i.e. non real time user provide.
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 true CN109862591A (en) | 2019-06-07 |
| CN109862591B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111813556A (en) * | 2020-07-21 | 2020-10-23 | 北京东方通软件有限公司 | Elastic expansion method of virtual cluster in cloud computing environment |
| CN112311610A (en) * | 2020-12-25 | 2021-02-02 | 视联动力信息技术股份有限公司 | 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 |
|---|
| GUOLIN SUN等: "Low-complexity Dynamic Resource Slicing for Mixed Traffics in Virtualized Radio Access Network", 《2018 IEEE 43RD CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN)》 * |
| 王燚等: "面向5G RAN的网络切片技术", 《电信科学》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111813556A (en) * | 2020-07-21 | 2020-10-23 | 北京东方通软件有限公司 | Elastic expansion method of virtual cluster in cloud computing environment |
| CN112311610A (en) * | 2020-12-25 | 2021-02-02 | 视联动力信息技术股份有限公司 | Communication method and device for realizing QOS guarantee under non-IP system |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109862591B (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Neghabi et al. | Load balancing mechanisms in the software defined networks: a systematic and comprehensive review of the literature | |
| EP3304826B1 (en) | Method and apparatus for data analytics management | |
| CN101686497B (en) | Cell load equalization method, and cell load evaluation method and device | |
| CN107733689A (en) | Dynamic weighting polling dispatching strategy process based on priority | |
| CN107113243A (en) | For the system and method using Virtual network operator managing network flow | |
| CN110149657A (en) | A kind of method and apparatus of determining QoS description information | |
| CN109819057A (en) | A kind of load-balancing method and system | |
| CN109862591A (en) | It is a kind of based on Qos eat dishes without rice or wine slice bandwidth borrow with caching sharing method | |
| CN102665282B (en) | Distribution method of multi-user parallel transmission resource in wireless heterogeneous network | |
| CN105103603A (en) | Method for traffic steering and network element | |
| CN108174397A (en) | A kind of multiple gateway Synergistic method of task-driven | |
| CN105578529B (en) | A kind of selection system and method for access point | |
| CN105991707B (en) | Multimedia interaction method, server and system | |
| CN108055701B (en) | Resource scheduling method and base station | |
| Kumar et al. | Using clustering approaches for response time aware job scheduling model for internet of things (IoT) | |
| Huang et al. | A scalable approach to SDN control plane management: High utilization comes with low latency | |
| CN105227396B (en) | A kind of inferior commending contents dissemination system and its method towards mobile communications network | |
| CN115632939A (en) | Automatic network selection and routing method for achieving multi-target achievement of computational power network | |
| CN103024086A (en) | Method and device for service transmission of multi-interface terminal | |
| CN109120549A (en) | The switching optimization method of priority driven under a kind of wireless SDN | |
| Sigwele et al. | Call admission control in cloud radio access networks | |
| CN108965168A (en) | A kind of car networking based on utility function is dominant resource fairness distribution optimization method | |
| CN103473630B (en) | A kind of service resource management method in information grid system | |
| Tsompanidis et al. | Towards utility-based resource management in heterogeneous wireless networks | |
| CN109688171A (en) | Spatial cache dispatching method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| 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 |