CN103781081A - Opportunity sharing-based wireless virtual resource allocation method - Google Patents
Opportunity sharing-based wireless virtual resource allocation method Download PDFInfo
- Publication number
- CN103781081A CN103781081A CN201410073830.7A CN201410073830A CN103781081A CN 103781081 A CN103781081 A CN 103781081A CN 201410073830 A CN201410073830 A CN 201410073830A CN 103781081 A CN103781081 A CN 103781081A
- Authority
- CN
- China
- Prior art keywords
- resource
- virtual network
- network
- demands
- elastic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention relates to the technical field of mobile and wireless networks, and provides an opportunity sharing-based wireless virtual resource allocation method. The method comprises the following steps: determining the total quantity of resources in a physical network; determining the quantity of virtual networks and the resource demands including baseline demands, elastic demands and the probabilities of the elastic demands of each virtual network; determining a price needing to be paid by each virtual network, wherein the price is a concave function relating to the resource demands; setting constraint conditions including conditions that the total quantity of resources allocated by the virtual networks does not surpass the total quantity of resources in the networks, one resource is occupied by one baseline demand at most, and the conflict probability under the condition that the elastic demands of different virtual networks occupy the same resource does not surpass a preset conflict threshold; under the constraint conditions, computing a resource allocation way by means of which the total gain of the physical network is maximized through an algorithm. By adopting the method, the utilization ratio and application gain of resources can be increased, customization of network services is realized, and the service quality is improved.
Description
Technical field
The present invention relates to mobile and radio network technique field, be specifically related to a kind of based on the shared wireless dummy resource allocation methods of chance.
Background technology
Mobile and wireless network has been obtained remarkable achievement in the past between decades, become one of the most far-reaching technology of people's life that affects.But along with growing with each passing day to the demand explosion type of people to Mobile data amount in recent years, existing movement and wireless network have run into some stubborn problems and bottleneck.First, multiple famous operators represent that frequency spectrum resource has become very deficient, is difficult to meet growing Mobile data demand.But in practice, user exists a large amount of idle mobile resources at one's side, is not but utilized efficiently, this makes a large amount of frequency spectrum resources occur waste.Secondly, the prosperity day by day of mobile Internet continues to bring out new service.Different services is different to the demand of network characteristic, and as VoIP requires low delay but not high to the demand of bandwidth, the stream business such as video require high bandwidth and time delay is had to certain tolerance.But existing network adopts single network characteristic to remove to support many services, is difficult to provide for service feature the network guarantee of customization, thereby affect service quality (QoS) and Quality of experience (QoE).
Wireless network Intel Virtualization Technology is intended to multiple virtual wireless network of parallel running on same shared bottom physical radio network.Physical radio network occupies, manages and coordinate Radio Resource.Virtual wireless network itself is not occupied resource, provides service to physical network application (renting) resource to terminal use.Wireless network is virtual can efficiently solve above-mentioned thorny problem mobile and that wireless network faces.First, wireless network is virtual provides decoupling zero by Resource Supply and service, and all virtual networks are all shared same physical network, and physical network can be optimized and distributing radio resource more effectively, thereby significantly save Radio Resource, improved the utilance of Radio Resource.On the other hand, dissimilar service can be carried by different virtual networks, therefore physical network can ensure for corresponding virtual network provides optimum resource and scheduling according to the type of difference service, thereby realize the customizable of network service, significantly promoted service quality (QoS) and Quality of experience (QoE).
Important problem of fundamental sum during wireless network is virtual is virtual radio resource allocation problem.A large amount of virtual networks have different demands to resource, and resource need to be carried out effectively according to these demands the distribution of Radio Resource.Among Radio Resource, the most important and rare is frequency spectrum resource.Therefore, virtual wireless network frequency spectrum resource assignment problem just becomes primary key issue.Traditional resource distribution method all supposes that the demand of resource requirement side fixes, but in wireless network virtualized environment, the resource that virtual network is applied for is often applied for according to peak demand, be that the resource that most of time is applied for is not used, thereby produce the wasting of resources, restricted the raising of utilance and the use income of resource.
Summary of the invention
(1) technical problem solving
For the deficiencies in the prior art, the invention provides a kind of based on the shared wireless dummy resource allocation methods of chance, can promote resource utilance and use income, be conducive to realize network service customization, improve service quality.
(2) technical scheme
For realizing above object, the present invention is achieved by the following technical programs:
Based on the shared wireless dummy resource allocation methods of chance, it is characterized in that, the method comprises:
Determine the total resources of physical network;
Determine the resource requirement of quantity and each virtual network of virtual network, comprise the probability that baseline demands, elastic demand and described elastic demand occur;
Determine the price that each virtual network need to pay, described price is the concave function about its resource requirement;
Set constraints, comprise that the total resources of virtual network distribution is no more than the total resources of described network, a resource is taken by a baseline demands at the most, and the collision probability when elastic demand of different virtual network accounts for a resource is altogether no more than predetermined conflict thresholding;
Under described constraints, calculate the resource distribution mode that makes physical network total revenue maximum by algorithm.
Preferably, described algorithm is the iterative algorithm based on Dynamic Programming, and this algorithm comprises:
The value of initialization in the time of u=0 or v=0 is 0, and before wherein representing, u virtual network is carried on the maximum return in the physical network that total resources is v, and u is no more than the quantity nv of described virtual network, and v is no more than the total resources C of described physical network;
Calculate successively all values when the u=1 to u=nv by iterative formula;
The required method of salary distribution is corresponding allocation result;
Described iterative formula is:
Wherein bu and fu are respectively baseline demands and the elastic demand of u virtual network, are u the required new idling-resource total amount taking of virtual network, for adding the total revenue of the physical network that u virtual network increase.
Preferably, the calculation procedure of the required new idling-resource total amount taking of described u virtual network comprises:
Step S201: the collision probability that calculates the every a resource having been taken by other virtual network elastic demand in the elastic demand of this virtual network and physical network;
Step S202: the resource that described collision probability is not more than to described conflict thresholding adds in candidate collection, and remember that the stock number of candidate collection is n;
Step S203: if n >=fu chooses fu part resource and distributes to the elastic demand of this virtual network from described candidate collection, described=bu, and go to step S206;
Step S204: if n<fu and residue idling-resource amount are greater than bu+fu-n, by all resources in described candidate collection, fu-n part resource of choosing in idling-resource with residue is distributed to the elastic demand of this virtual network, and described=bu+fu-n, goes to step S206;
Step S205: refuse this virtual network, keep former allocation result constant;
Step S206: accept this virtual network, record is the allocation result of correspondence now.
Preferably, in described step 201, described collision probability, the probability that the described elastic demand that wherein pu is this virtual network occurs, for the probability that all virtual network elastic demands of this part of resource all do not occur, in all virtual network elastic demands for this part of resource, only there is the probability of.
Preferably, described fu part resource of choosing from described candidate collection is distributed to the elastic demand of this virtual network and is comprised:
For every part of resource, calculate the difference of described conflict thresholding and described collision probability, and this difference and described ratio;
By described ratio from small to large order arrange, and get front fu part resource and distribute to the elastic demand of this virtual network.
Preferably, described step S203 and step 204 also comprise: before going to step S206, the value of renewal is, value be.
Preferably, it is characterized in that, described resource is frequency spectrum resource, and described a resource is a channel.
(3) beneficial effect
The present invention at least has following beneficial effect:
Main points of the present invention have been to distinguish baseline demands and the elastic demand in virtual network, and wherein baseline demands is the fixed resource demand that each virtual network must be monopolized, and elastic demand is the unfixed resource requirement occurring by certain probability.By distributing fixing resource to make the elastic demand chance of each virtual network share identical resource to the baseline demands of each virtual network, the resource distribution mode of not distinguishing of comparing, just can make the resource of equivalent meet the demand of more virtual networks, reach the object of increasing operation rate, and a kind of new visual angle of analyzing resource requirement has been proposed, be conducive to realize network service customization, improve service quality.
And, the present invention has also taked the mode of price to represent that virtual network is to obtain required resource and the price that need to pay, price represents with a concave function about its resource requirement, based on this " number of resources-to dutiable value " this " demand commodity-commodity price " relation, not only can use existing Economic Model and algorithm to solve resource allocation problem, be conducive to promote further overall income and the utilance of resource, resource allocation problem is analyzed at this visual angle of economic relation simultaneously also helping between physical network and virtual network, a kind of new thinking is provided to such problem.
Certainly, implement arbitrary product of the present invention or method and might not need to reach above-described all advantages simultaneously.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skills, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is a kind of based on the shared wireless dummy resource allocation methods flow chart of chance in one embodiment of the invention;
Fig. 2 is the network structure of wireless dummy described in one embodiment of the invention;
Fig. 3 is u the required new idling-resource total amount taking of virtual network in one embodiment of the invention
calculation procedure flow chart.
Embodiment
For making object, technical scheme and the advantage of the embodiment of the present invention clearer, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment in the present invention, those of ordinary skills, not making the every other embodiment obtaining under creative work prerequisite, belong to the scope of protection of the invention.
The embodiment of the present invention has proposed a kind of based on the shared wireless dummy resource allocation methods of chance, and referring to Fig. 1, the method comprises:
Step 101: the total resources of determining physical network;
Step 102: determine the resource requirement of quantity and each virtual network of virtual network, comprise the probability that baseline demands, elastic demand and described elastic demand occur;
Step 103: determine the price that each virtual network need to pay, described price is the concave function about its resource requirement;
Step 104: set constraints, comprise that the total resources of virtual network distribution is no more than the total resources of described network, a resource is taken by a baseline demands at the most, and the collision probability when elastic demand of different virtual network accounts for a resource is altogether no more than predetermined conflict thresholding;
Step 105: under described constraints, calculate the resource distribution mode that makes physical network total revenue maximum by algorithm.
Referring to Fig. 2, the residing background of the embodiment of the present invention is: in wireless dummy network configuration, have several virtual networks and a physical network.Virtual network itself is not occupied resource, and it is by being moved to physical network application resource.Physical network occupies resource, can be according to the resource requirement of virtual wireless network to its Resources allocation.Some virtual network parallel runnings, on physical network, are shared the resource of physical network.
In embodiments of the present invention, said resource specifically refers to frequency spectrum resource (can be in fact also other resource forms), and weighs the quantity of resource by the number of channel.Thereby can specifically build the Mathematical Modeling of resource allocation problem under this sight:
Step 101: determine the total resources C of physical network, be characterized by the physical network resource model that contains altogether C wireless channel;
Step 102: determine the resource requirement of quantity and each virtual network of virtual network, comprise the probability that baseline demands, elastic demand and described elastic demand occur.Here specifically getting described virtual network resource model is characterized by and contains altogether n
vindividual virtual network, its resource requirement set is
wherein
be the resource requirement (vector) of i virtual network, be expressed as
wherein b
irepresent described baseline demands, f
irepresent described elastic demand, p
irepresent the probability that described elastic demand occurs.
Step 103: determine the price that each virtual network need to pay, described price is the concave function about its resource requirement.Namely set price that each virtual network need to the pay concave function about its resource requirement, can be expressed as
Step 104: set constraints, comprise that the total resources of virtual network distribution is no more than the total resources of described network, a resource is at the most by a baseline demands; The collision probability when elastic demand that takies different virtual network accounts for a resource is altogether no more than predetermined conflict thresholding.That is to say, in the time that baseline demands takies some parts of resources, these some parts of resources just can not have been taken by other demands; And be no more than under the condition of predetermined conflict thresholding meeting collision probability, the elastic demand that takies different virtual network can take jointly with a resource.
Step 105: under described constraints, calculate the resource distribution mode that makes physical network total revenue maximum by algorithm, namely determine that target function is for will make physical network total revenue maximum.
Since then, the Mathematical Modeling of this resource allocation problem has just been fixed, and it can adopt multiple existing algorithm to solve.Visible, the method has been distinguished baseline demands and the elastic demand in virtual network, and wherein baseline demands is the fixed resource demand that each virtual network must be monopolized, and elastic demand is the unfixed resource requirement occurring by certain probability.That is to say, baseline demands is monopolized physical network resource; And elastic demand occurs according to probability, the elastic demand that is subordinated to different virtual network can chance be shared identical physical network resource, but it also needs to meet certain constraints.In this case, in resource allocation problem, just consider the situation of the shared same resource of different virtual network opportunistic, by distributing fixing resource to make the elastic demand of each virtual network can chance share identical resource under certain constraints to the baseline demands of each virtual network.The resource distribution mode of not distinguishing of comparing, just can make the resource of equivalent meet the demand of more virtual networks, reach the object of increasing operation rate, and proposed a kind of new visual angle of analyzing resource requirement, be conducive to realize network service customization, improve service quality.
And, the present invention has also taked the mode of price to represent that virtual network is to obtain required resource and the price that need to pay, price represents with a concave function about its resource requirement, based on this " number of resources-to dutiable value " this " demand commodity-commodity price " relation, not only can use existing Economic Model and algorithm to solve resource allocation problem, be conducive to promote further overall income and the utilance of resource, resource allocation problem is analyzed at this visual angle of economic relation simultaneously also helping between physical network and virtual network, a kind of new thinking is provided to such problem.
With regard to this Mathematical Modeling, providing a kind of optimization algorithm below---the iterative algorithm based on Dynamic Programming is shown method proposed by the invention, and this algorithm comprises:
Initialization OptM
u, vvalue in the time of u=0 or v=0 is 0, wherein OptM
u, vbefore representing, u virtual network is carried on the maximum return in the physical network that total resources is v, and u is no more than the quantity n of described virtual network
v, v is no more than the total resources C of described physical network;
Calculate successively OptM by iterative formula
u,vall values in the time of u=1 to u=nv;
The required method of salary distribution is
corresponding allocation result;
Described iterative formula is:
Wherein b
uwith f
ube respectively baseline demands and the elastic demand of u virtual network,
be u the required new idling-resource total amount taking of virtual network, φ
ufor adding the total revenue of the physical network that u virtual network increase.
Wherein, referring to Fig. 3, u the required new idling-resource total amount taking of virtual network
calculation procedure comprise:
Step S201: the collision probability that calculates the every a resource having been taken by other virtual network elastic demand in the elastic demand of this virtual network and physical network;
Step S202: the resource that described collision probability is not more than to described conflict thresholding adds in candidate collection, and remember that the stock number of candidate collection is n;
Step S203: if n>=f
u, from described candidate collection, choose f
upart resource is distributed to the elastic demand of this virtual network, described in
and go to step S206;
Step S204: if n<f
uand residue idling-resource amount is greater than b
u+ f
u-n, by all resources in described candidate collection, and the f choosing in residue idling-resource
u-n part resource is distributed to the elastic demand of this virtual network, described in
go to step S206;
Step S205: refuse this virtual network, keep former allocation result constant;
Step S206: accept this virtual network, record now OptM
u,vcorresponding allocation result.
Wherein, in described step 201, described collision probability Pr
collison=1-Pr
none-(1-p
u) Pr
one, wherein p
ufor the probability that the described elastic demand of this virtual network occurs, Pr
nonefor the probability that all virtual network elastic demands of this part of resource all do not occur, Pr
onein all virtual network elastic demands for this part of resource, only there is the probability of.
In step S203, describedly from described candidate collection, choose f
uthe elastic demand that part resource is distributed to this virtual network comprises:
For every part of resource, calculate the difference of described conflict thresholding and described collision probability, and this difference and described Pr
oneratio;
By the order arrangement from small to large of described ratio, and get front f
upart resource is distributed to the elastic demand of this virtual network.
And, in described step S203 and step 204 go to step S206 before, upgrade Pr
nonevalue be (1-p
u) Pr
none, Pr
onevalue be (1-p
u) Pr
one+ p
upr
none.
That is to say, this algorithm is first in the time of u=1, and traversal v=0 to v=C obtains all OptM by iterative formula
1, v; And then in kind calculate successively OptM
u,vall values in the time of u=2 to u=nv, final allocation result is just corresponding
situation when value.
Certainly, in the time adding a virtual network at every turn, capital experiences and a series ofly judges to be confirmed whether to receive this virtual network and how to be its Resources allocation, principle is to make the resource that newly takies of virtual network try one's best few as far as possible, thereby make the virtual network adding have enough allowable resources below, thereby the total revenue that improves physical network, all are all to meet constraints under prerequisite certainly.
For baseline resources, only need to directly distribute correspondingly by scheme of the prior art; But for flexible resource, need to consider that its collision probability is no more than the constraints of conflict thresholding.So in actual algorithm, can adopt a distance to go array, columns is 2, line number characterizes by the shared number of resources of elastic demand.Wherein first row characterizes and occupies the probability P r that all virtual network elastic demands of this part of resource all do not occur
none, secondary series characterizes in all virtual network elastic demands that occupy this part of resource the probability P r of only occurs
one.According to the implication of collision probability, for each virtual network newly adding, just have so:
Pr
collison＝1-Pr
none-(1-p
u)Pr
one
The meaning is possible after the elastic demand that adds this virtual network, have and is no less than two simultaneous probability of elastic demand.Certainly in the time giving corresponding elastic demand Resources allocation at every turn, the Pr of corresponding resource
noneand Pr
onevalue all can change, so will upgrade its value:
Pr
none′＝(1-p
u)Pr
none，Pr
one′＝(1-p
u)Pr
one+p
uPr
none。
And, in the resource the candidate collection satisfying condition from n, choose f
upart give newly add elastic demand time, need to be thought of as its choose which resource for distribute.At this moment the principle of selecting is exactly will make collision probability as far as possible far away apart from conflict thresholding, namely difference as far as possible large (more small probability clashes), and the probability P r that has an elastic demand to occur in former resource
oneas far as possible little (to hold more elastic demand).So, just calculated this difference and Pr
oneratio, and by order sequence from small to large, get front f
uthe elastic demand that part giving newly adds, has just met such principle of selecting.
Visible, above-mentioned algorithm can generate the larger a kind of method of salary distribution of total revenue of a physical network, and algorithm is easy, execution speed is fast, is applicable to general application scenarios.
It should be noted that, in this article, relational terms such as the first and second grades is only used for an entity or operation to separate with another entity or operating space, and not necessarily requires or imply and between these entities or operation, have the relation of any this reality or sequentially.And, term " comprises ", " comprising " or its any other variant are intended to contain comprising of nonexcludability, thereby the process, method, article or the equipment that make to comprise a series of key elements not only comprise those key elements, but also comprise other key elements of clearly not listing, or be also included as the intrinsic key element of this process, method, article or equipment.The in the situation that of more restrictions not, the key element being limited by statement " comprising ... ", and be not precluded within process, method, article or the equipment that comprises described key element and also have other identical element.
Above embodiment only, in order to technical scheme of the present invention to be described, is not intended to limit; Although the present invention is had been described in detail with reference to previous embodiment, those of ordinary skill in the art is to be understood that: its technical scheme that still can record aforementioned each embodiment is modified, or part technical characterictic is wherein equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (7)
1. based on the shared wireless dummy resource allocation methods of chance, it is characterized in that, the method comprises:
Determine the total resources of physical network;
Determine the resource requirement of quantity and each virtual network of virtual network, comprise the probability that baseline demands, elastic demand and described elastic demand occur;
Determine the price that each virtual network need to pay, described price is the concave function about its resource requirement;
Set constraints, comprise that the total resources of virtual network distribution is no more than the total resources of described network, a resource is taken by a baseline demands at the most, and the collision probability when elastic demand of different virtual network accounts for a resource is altogether no more than predetermined conflict thresholding;
Under described constraints, calculate the resource distribution mode that makes physical network total revenue maximum by algorithm.
2. method according to claim 1, is characterized in that, described algorithm is the iterative algorithm based on Dynamic Programming, and this algorithm comprises:
Initialization OptM
u,vvalue in the time of u=0 or v=0 is 0, wherein OptM
u,vbefore representing, u virtual network is carried on the maximum return in the physical network that total resources is v, and u is no more than the quantity n of described virtual network
v, v is no more than the total resources C of described physical network;
Calculate successively OptM by iterative formula
u,vat u=1 to u=n
vtime all values;
The required method of salary distribution is
corresponding allocation result;
Described iterative formula is:
Wherein b
uwith f
ube respectively baseline demands and the elastic demand of u virtual network,
be u the required new idling-resource total amount taking of virtual network, φ
ufor adding the total revenue of the physical network that u virtual network increase.
3. method according to claim 2, is characterized in that, the required new idling-resource total amount taking of described u virtual network
calculation procedure comprise:
Step S201: the collision probability that calculates the every a resource having been taken by other virtual network elastic demand in the elastic demand of this virtual network and physical network;
Step S202: the resource that described collision probability is not more than to described conflict thresholding adds in candidate collection, and remember that the stock number of candidate collection is n;
Step S203: if n>=f
u, from described candidate collection, choose f
upart resource is distributed to the elastic demand of this virtual network, described in
and go to step S206;
Step S204: if n<f
uand residue idling-resource amount is greater than b
u+ f
u-n, by all resources in described candidate collection, and the f choosing in residue idling-resource
u-n part resource is distributed to the elastic demand of this virtual network, described in
go to step S206;
Step S205: refuse this virtual network, keep former allocation result constant;
Step S206: accept this virtual network, record now OptM
u,vcorresponding allocation result.
4. method according to claim 3, is characterized in that, in described step 201, and described collision probability Pr
collison=1-Pr
none-(1-p
u) Pr
one ,wherein p
ufor the probability that the described elastic demand of this virtual network occurs, Pr
nonefor the probability that all virtual network elastic demands of this part of resource all do not occur, Pr
onein all virtual network elastic demands for this part of resource, only there is the probability of.
5. method according to claim 4, is characterized in that, describedly from described candidate collection, chooses f
uthe elastic demand that part resource is distributed to this virtual network comprises:
For every part of resource, calculate the difference of described conflict thresholding and described collision probability, and this difference and described Pr
oneratio;
By the order arrangement from small to large of described ratio, and get front f
upart resource is distributed to the elastic demand of this virtual network.
6. method according to claim 4, is characterized in that, described step S203 and step 204 also comprise: before going to step S206, upgrade Pr
nonevalue be (1-p
u) Pr
none, Pr
onevalue be (1-p
u) Pr
one+ p
upr
none.
7. according to the method described in claim 1 to 6 any one, it is characterized in that, described resource is frequency spectrum resource, and described a resource is a channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410073830.7A CN103781081B (en) | 2014-02-28 | 2014-02-28 | Opportunity sharing-based wireless virtual resource allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410073830.7A CN103781081B (en) | 2014-02-28 | 2014-02-28 | Opportunity sharing-based wireless virtual resource allocation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103781081A true CN103781081A (en) | 2014-05-07 |
| CN103781081B CN103781081B (en) | 2017-05-24 |
Family
ID=50572798
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410073830.7A Expired - Fee Related CN103781081B (en) | 2014-02-28 | 2014-02-28 | Opportunity sharing-based wireless virtual resource allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103781081B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104363186A (en) * | 2014-11-04 | 2015-02-18 | 浪潮电子信息产业股份有限公司 | Resource optimization algorithm based on network virtualization |
| CN104822148A (en) * | 2015-04-24 | 2015-08-05 | 杭州电子科技大学 | Spectrum resource dynamic allocation device and allocation method thereof |
| CN105848221A (en) * | 2016-01-14 | 2016-08-10 | 东南大学 | Inter-operator resource sharing method based on network virtualization in various service scenes |
| CN106576246A (en) * | 2014-08-22 | 2017-04-19 | 英国电讯有限公司 | Small cell resource allocation |
| CN106792725A (en) * | 2017-03-28 | 2017-05-31 | 重庆邮电大学 | Dynamic allocation method based on sharing frequency spectrum resource in wireless network virtualization |
| CN107306203A (en) * | 2016-04-25 | 2017-10-31 | 中兴通讯股份有限公司 | A kind of method and device of the scheduling of resource based on virtual network |
| CN108257005A (en) * | 2017-12-28 | 2018-07-06 | 深圳市牛鼎丰科技有限公司 | Resource allocation methods, device, computer equipment and storage medium |
| CN111405587A (en) * | 2020-03-20 | 2020-07-10 | 三峡大学 | Virtual wireless network resource allocation method based on channel pricing |
| CN105511959B (en) * | 2014-10-16 | 2021-03-19 | 腾讯科技（深圳）有限公司 | Virtual resource allocation method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080101287A1 (en) * | 2006-10-30 | 2008-05-01 | Samsung Electronics., Ltd. | Resource allocation method and apparatus in multi-channel system |
| CN101237691A (en) * | 2006-05-19 | 2008-08-06 | 华为技术有限公司 | Method and system for resource distribution in OFDMA network |
| CN101421947A (en) * | 2006-04-28 | 2009-04-29 | 华为技术有限公司 | An allocation method of time-frequency resources and the apparatus and wireless communication system thereof |
| US20110274078A1 (en) * | 2003-09-22 | 2011-11-10 | Broadcom Corporation | Automatic quality of service based resource allocation |
-
2014
- 2014-02-28 CN CN201410073830.7A patent/CN103781081B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110274078A1 (en) * | 2003-09-22 | 2011-11-10 | Broadcom Corporation | Automatic quality of service based resource allocation |
| CN101421947A (en) * | 2006-04-28 | 2009-04-29 | 华为技术有限公司 | An allocation method of time-frequency resources and the apparatus and wireless communication system thereof |
| CN101237691A (en) * | 2006-05-19 | 2008-08-06 | 华为技术有限公司 | Method and system for resource distribution in OFDMA network |
| US20080101287A1 (en) * | 2006-10-30 | 2008-05-01 | Samsung Electronics., Ltd. | Resource allocation method and apparatus in multi-channel system |
Non-Patent Citations (2)
| Title |
|---|
| YONGYI RAN, JIAN YANGY, SHUBEN ZHANG, HONGSHENG XI: "SLA-driven Dynamic Resource Provisioning for Service Provider in Cloud Computing", 《IEEE》 * |
| 张旻: "虚拟网构建及资源管理关键技术研究", 《浙江大学博士学位论文》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106576246A (en) * | 2014-08-22 | 2017-04-19 | 英国电讯有限公司 | Small cell resource allocation |
| CN106576246B (en) * | 2014-08-22 | 2020-09-01 | 英国电讯有限公司 | Small cell resource allocation device and method, computer storage medium |
| CN105511959B (en) * | 2014-10-16 | 2021-03-19 | 腾讯科技（深圳）有限公司 | Virtual resource allocation method and device |
| CN104363186A (en) * | 2014-11-04 | 2015-02-18 | 浪潮电子信息产业股份有限公司 | Resource optimization algorithm based on network virtualization |
| CN104822148A (en) * | 2015-04-24 | 2015-08-05 | 杭州电子科技大学 | Spectrum resource dynamic allocation device and allocation method thereof |
| CN104822148B (en) * | 2015-04-24 | 2018-03-16 | 杭州电子科技大学 | A kind of frequency spectrum resource dynamically distributes device and its distribution method |
| CN105848221B (en) * | 2016-01-14 | 2019-08-13 | 东南大学 | Resource share method between operator under multiple business scene based on network virtualization |
| CN105848221A (en) * | 2016-01-14 | 2016-08-10 | 东南大学 | Inter-operator resource sharing method based on network virtualization in various service scenes |
| WO2017185908A1 (en) * | 2016-04-25 | 2017-11-02 | 中兴通讯股份有限公司 | Resource scheduling method and device, and data storage medium |
| CN107306203A (en) * | 2016-04-25 | 2017-10-31 | 中兴通讯股份有限公司 | A kind of method and device of the scheduling of resource based on virtual network |
| CN106792725B (en) * | 2017-03-28 | 2019-07-19 | 重庆邮电大学 | Dynamic allocation method based on sharing frequency spectrum resource in wireless network virtualization |
| CN106792725A (en) * | 2017-03-28 | 2017-05-31 | 重庆邮电大学 | Dynamic allocation method based on sharing frequency spectrum resource in wireless network virtualization |
| CN108257005A (en) * | 2017-12-28 | 2018-07-06 | 深圳市牛鼎丰科技有限公司 | Resource allocation methods, device, computer equipment and storage medium |
| CN111405587A (en) * | 2020-03-20 | 2020-07-10 | 三峡大学 | Virtual wireless network resource allocation method based on channel pricing |
| CN111405587B (en) * | 2020-03-20 | 2022-10-21 | 三峡大学 | Virtual wireless network resource allocation method based on channel pricing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103781081B (en) | 2017-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103781081A (en) | Opportunity sharing-based wireless virtual resource allocation method | |
| US11848826B2 (en) | Hyperparameter and network topology selection in network demand forecasting | |
| US9009719B2 (en) | Computer workload capacity estimation using proximity tables | |
| US10613907B2 (en) | Resource substitution and reallocation in a virtual computing environment | |
| US10841241B2 (en) | Intelligent placement within a data center | |
| CN103414752B (en) | A kind of cloud data center virtual machine distribution method of network aware | |
| US20170041384A1 (en) | Cloud service broker apparatus and method thereof | |
| CN103346978B (en) | A kind of virtual machine network bandwidth fairness and stability support method | |
| Mashayekhy et al. | A coalitional game-based mechanism for forming cloud federations | |
| Kbah et al. | Resource allocation in cellular systems for applications with random parameters | |
| CN103853618A (en) | Resource allocation method with minimized cloud system cost based on expiration date drive | |
| CN113615137B (en) | CDN optimization platform | |
| CN105227489A (en) | A kind of bandwidth management method and electronic equipment | |
| CN109710406A (en) | Data distribution and its model training method, device and computing cluster | |
| CN111090390A (en) | Storage allocation method and device of distributed system and computer equipment | |
| CN108990067B (en) | Energy efficiency control method applied to ultra-dense heterogeneous network | |
| CN109976901A (en) | A kind of resource regulating method, device, server and readable storage medium storing program for executing | |
| CN108171374A (en) | A kind of earth observation satellite mission planning method based on simulated annealing | |
| US9591067B2 (en) | Methods and apparatus for allocating cloud-based media resources | |
| CN105592160B (en) | Resource allocation method towards service consumer under a kind of cloud computing environment | |
| CN112187670B (en) | Networked software shared resource allocation method and device based on group intelligence | |
| CN105389212A (en) | Job assigning method and apparatus | |
| JP6732693B2 (en) | Resource allocation control system, resource allocation control method, and program | |
| CN105138391A (en) | Multi-task virtual machine allocation method for wide-area distributed cloud system fairness | |
| CN105718297A (en) | Virtual machine establishing system and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into 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 |
Granted publication date: 20170524 Termination date: 20190228 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |