CN103781081B - Opportunity sharing-based wireless virtual resource allocation method - Google Patents
Opportunity sharing-based wireless virtual resource allocation method Download PDFInfo
- Publication number
- CN103781081B CN103781081B CN201410073830.7A CN201410073830A CN103781081B CN 103781081 B CN103781081 B CN 103781081B CN 201410073830 A CN201410073830 A CN 201410073830A CN 103781081 B CN103781081 B CN 103781081B
- 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.)
- Expired - Fee Related
Links
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, and in particular to a kind of wireless dummy shared based on chance
Resource allocation methods.
Background technology
Mobile and wireless network achieves remarkable achievement between the past few decades, has become influence people's life
One of most far-reaching technology.However, as people in recent years are growing day by day to the demand explosion type ground of mobile data amount, it is existing
Mobile and wireless network encounters some stubborn problems and bottleneck.First, multiple famous operation quotient representation frequency spectrum resources have been
Become extremely deficient, it is difficult to meet growing mobile data demand.But in practice, user exists substantial amounts of at one's side
Idle mobile resources, are not utilized efficiently but, and this causes that a large amount of frequency spectrum resources occur in that waste.Secondly, mobile interchange
The increasingly prosperous of net causes that new demand servicing is continued to bring out.Different services is different, such as VoIP requirements to the demand of network characteristic
Low delay but not high to the demand of bandwidth, and the stream such as video business then requires bandwidth high and has certain tolerance to time delay.So
And, existing network is gone to support various services using single network characteristic, it is difficult to which the network for providing customization for service feature is protected
Barrier, so as to influence service quality (QoS) and Quality of experience (QoE).
Wireless network Intel Virtualization Technology is intended to multiple void of parallel running on same shared bottom physical radio network
Intend wireless network.Physical radio network occupies, manages and coordinate Radio Resource.Virtual wireless network does not occupy money in itself
Source, comes to end users with services to physical network application (rental) resource.Wireless network virtualization can efficiently solve to move
The above-mentioned thorny problem that dynamic and wireless network is faced.First, resource is provided and provides decoupling with service by wireless network virtualization,
All virtual networks share same physical network so that physical network can more efficiently optimize and distribute wireless money
Source, so as to Radio Resource is greatly saved, improves the utilization rate of Radio Resource.On the other hand, different types of service can be with
Carried by different virtual networks, therefore physical network can be carried according to the type of different services for corresponding virtual network
Ensured for optimal resource and scheduling, it is achieved thereby that network service is customizable, be obviously improved service quality (QoS) and experience
Quality (QoE).
A most basic and important problem in wireless network virtualization is virtual radio resource allocation problem.Largely
Virtual network has different demands to resource, and resource needs effectively to carry out the distribution of Radio Resource according to these demands.
Among Radio Resource, mostly important and rare is frequency spectrum resource.Therefore, virtual wireless network frequency spectrum resource assignment problem is just
Become primary key issue.Traditional resource distribution method assumes that the demand of resource requirement side is fixed, but in nothing
In gauze network virtualized environment, the apllied resource of virtual network is often applied according to peak demand, i.e. most of time institute
The resource of application is not used, so as to generate the wasting of resources, constrains the utilization rate of resource and proposing using income
It is high.
The content of the invention
(1) technical problem for solving
In view of the shortcomings of the prior art, the present invention provides a kind of wireless dummy resource allocation side shared based on chance
Method, can lift the utilization rate of resource and use income, be advantageously implemented the customization of network service, improve service quality.
(2) technical scheme
To realize object above, the present invention is achieved by the following technical programs：
A kind of wireless dummy resource allocation methods shared based on chance, it is characterised in that the method includes：
Determine the total resources of physical network；
Determine the quantity of virtual network and the resource requirement of each virtual network, including baseline demands, elastic demand and
The probability that the elastic demand occurs；
Determine that each virtual network needs the price for paying, the price is the concave function on its resource requirement；
Setting constraints, including total resources of the total resources no more than the network that virtual network is distributed, it is a
Resource is at most taken by a baseline demands, and the elastic demand of different virtual networks accounts for collision probability during with portion resource not altogether
More than predetermined conflict thresholding；
Under the constraints, the resource distribution mode for making physical network total revenue maximum is calculated by algorithm.
Preferably, the algorithm is the iterative algorithm based on Dynamic Programming, and the algorithm includes：
Initialization OptMu,vValue in u=0 or v=0 is 0, wherein OptMu,vU virtual network is carried on before representing
Total resources is the maximum return in the physical network of v, quantity ns of the u no more than the virtual networkv, v is no more than the physics
The total resources C of network；
OptM is calculated successively by iterative formulau,vIn u=1 to u=nvWhen all values；
The required method of salary distribution isCorresponding allocation result；
The iterative formula is：
Wherein buWith fuThe baseline demands of respectively u-th virtual network and elastic demand,It is u-th virtual network institute
The new idling-resource total amount that need to be taken.
Preferably, the new idling-resource total amount for being taken needed for u-th virtual networkCalculation procedure include：
Step S201：Calculate and needed by other virtual networks elasticity in the elastic demand of the virtual network and physical network
Seek the collision probability per portion resource of occupancy；
Step S202：The collision probability is not more than in the resource addition candidate collection of the conflict thresholding, and remembers time
The stock number that selected works are closed is n；
Step S203：If n >=fu, then f is chosen from the candidate collectionuElasticity of part resource allocation to the virtual network
Demand, it is describedAnd go to step S206；
Step S204：If n<fuAnd remaining idling-resource amount is more than bu+fu- n, then by all moneys in the candidate collection
The f chosen in source, and remaining idling-resourceu- n parts of resource allocation gives the elastic demand of the virtual network, described
Go to step S206；
Step S205：If n<fuAnd remaining idling-resource amount is not more than bu+fu- n, then refuse the virtual network, is kept for former point
It is constant with result；
Step S206：Receive the virtual network, record now OptMu,vCorresponding allocation result.
Preferably, in the step 201, the collision probability Prcollison=1-Prnone-(1-pu)ProneWherein puFor this
The probability that the elastic demand of virtual network occurs, PrnoneFor all virtual network elastic demands of this part of resource are not sent out
Raw probability, ProneOnly to there is the probability of in this part of all virtual network elastic demands of resource.
Preferably, it is described to choose f from the candidate collectionuElastic demand bag of part resource allocation to the virtual network
Include：
For every part of resource, the difference of the conflict thresholding and the collision probability, and the difference and the Pr are calculatedone
Ratio；
By the ratio, order is arranged from small to large, and takes preceding fuElastic demand of part resource allocation to the virtual network.
Preferably, the step S203 and step 204 also include：Before step S206 is gone to, Pr is updatednoneValue be
(1-pu)Prnone、ProneValue be (1-pu)Prone+puPrnone。
Preferably, it is characterised in that the resource is frequency spectrum resource, a resource is a channel.
(3) beneficial effect
The present invention at least has following beneficial effect：
Of the invention to be characterized by baseline demands and the elastic demand distinguished in virtual network, wherein baseline demands are
The fixed resource demand that each virtual network must be monopolized, and elastic demand is that the unfixed resource occurred by certain probability need to
Ask.Fixed resource is distributed by the baseline demands to each virtual network and be total to the elastic demand chance of each virtual network
Identical resource is enjoyed, compare the resource distribution mode not differentiated between, so that it may so that the resource of equivalent meets more virtual networks
Demand, reaches the purpose increased operation rate, and also proposed a kind of New Century Planned Textbook for analyzing resource requirement, is advantageously implemented network
The customization of service, improve service quality.
And, the present invention also takes the mode of price to be needed to pay representing virtual network to obtain required resource
Price, price represents with a concave function on its resource requirement, based on this " number of resources-to dutiable value " this
" demand commodity-commodity price " relation, not only can solve resource allocation problem using existing Economic Model and algorithm, have
Beneficial to the utilization rate for further lifting overall income and resource, while also helping between physical network and virtual network
Economic relation analyzes resource allocation problem on this visual angle, and a kind of new thinking is provided to such problem.
Certainly, implement any product of the invention or method it is not absolutely required to while reaching all the above excellent
Point.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
The accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are this hairs
Some bright embodiments, for those of ordinary skill in the art, on the premise of not paying creative work, can be with root
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is a kind of wireless dummy resource allocation methods flow shared based on chance in one embodiment of the invention
Figure；
Fig. 2 is wireless dummy network structure described in one embodiment of the invention；
Fig. 3 is the new idling-resource total amount of occupancy needed for u-th virtual network in one embodiment of the inventionMeter
Calculate flow chart of steps.
Specific embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
A part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
The embodiment of the present invention proposes a kind of wireless dummy resource allocation methods shared based on chance, referring to Fig. 1, should
Method includes：
Step 101：Determine the total resources of physical network；
Step 102：Determine the quantity of virtual network and the resource requirement of each virtual network, including baseline demands, elasticity
The probability that demand and the elastic demand occur；
Step 103：Determine that each virtual network needs the price for paying, the price is the recessed letter on its resource requirement
Number；
Step 104：Setting constraints, including the total resources of virtual network distribution is total no more than the resource of the network
Amount, a resource is at most taken by a baseline demands, and the elastic demand of different virtual networks accounts for rushing during with portion resource altogether
Prominent probability is no more than predetermined conflict thresholding；
Step 105：Under the constraints, the resource allocation side for making physical network total revenue maximum is calculated by algorithm
Formula.
Referring to Fig. 2, the background residing for the embodiment of the present invention is：In wireless dummy network structure, there are several virtual
Network and a physical network.Virtual network does not occupy resource in itself, and it is run by physical network application resource.
Physical network occupies resource, can distribute resource to it according to the resource requirement of virtual wireless network.Some virtual networks are transported parallel
Row shares the resource of physical network on physical network.
In embodiments of the present invention, it (actually can also be other resource shapes that described resource refers specifically to frequency spectrum resource
Formula), and the quantity of resource is weighed with the number of channel.Such that it is able to specifically build the mathematical modulo of resource allocation problem under this scene
Type：
Step 101：Determine the total resources C of physical network, that is, be characterized as containing the C physical network money of wireless channel altogether
Source model；
Step 102：Determine the quantity of virtual network and the resource requirement of each virtual network, including baseline demands, elasticity
The probability that demand and the elastic demand occur.Here the virtual network resource model is specifically taken to be characterized as containing n altogetherv
Individual virtual network, its resource requirement collection is combined intoWhereinIt is i-th resource requirement of virtual network
(vector), is expressed asWherein biRepresent the baseline demands, fiRepresent the elastic demand, piRepresent described
The probability that elastic demand occurs.
Step 103：Determine that each virtual network needs the price for paying, the price is the recessed letter on its resource requirement
Number.Concave function of the price on its resource requirement that each virtual network needs to pay namely is set, can be expressed as
Step 104：Setting constraints, including the total resources of virtual network distribution is total no more than the resource of the network
Amount, a resource is at most by a baseline demands；The elastic demand for taking different virtual networks accounts for rushing during with portion resource altogether
Prominent probability is no more than predetermined conflict thresholding.That is, when baseline demands take several pieces resource, this several pieces resource is just
Can not be occupied by other demands；And under conditions of collision probability is met no more than predetermined conflict thresholding, take different void
Intending the elastic demand of network can take with portion resource jointly.
Step 105：Under the constraints, the resource allocation side for making physical network total revenue maximum is calculated by algorithm
Formula, that is, determine object function to make physical network total revenue maximum.
Since then, the Mathematical Modeling of the resource allocation problem is just fixed, its can using various existing algorithms come
Solve.It can be seen that, the method has distinguished baseline demands and elastic demand in virtual network, and wherein to be each virtual for baseline demands
The fixed resource demand that network must be monopolized, and elastic demand is the unfixed resource requirement occurred by certain probability.Namely
Say, baseline demands monopolize physical network resource；And elastic demand occurs according to probability, the elasticity for being subordinated to different virtual networks is needed
Asking can be with the shared identical physical network resource of chance, but it is also required to meet certain constraints.In this case, provide
The situation that different virtual network chances share same resource is just take into account in the assignment problem of source, by each virtual network
Baseline demands are distributed fixed resource and the elastic demand of each virtual network is shared with chance under certain constraints
Identical resource.Compare the resource distribution mode not differentiated between, so that it may so that the resource of equivalent meets the need of more virtual networks
Ask, reach the purpose increased operation rate, and also proposed a kind of New Century Planned Textbook for analyzing resource requirement, be advantageously implemented network clothes
The customization of business, improve service quality.
And, the present invention also takes the mode of price to be needed to pay representing virtual network to obtain required resource
Price, price represents with a concave function on its resource requirement, based on this " number of resources-to dutiable value " this
" demand commodity-commodity price " relation, not only can solve resource allocation problem using existing Economic Model and algorithm, have
Beneficial to the utilization rate for further lifting overall income and resource, while also helping between physical network and virtual network
Economic relation analyzes resource allocation problem on this visual angle, and a kind of new thinking is provided to such problem.
Below with regard to this Mathematical Modeling, there is provided a kind of optimization algorithm --- the iterative algorithm based on Dynamic Programming shows this
The proposed method of invention, the algorithm includes：
Initialization OptMu,vValue in u=0 or v=0 is 0, wherein OptMu,vU virtual network is carried on before representing
Total resources is the maximum return in the physical network of v, quantity ns of the u no more than the virtual networkv, v is no more than the physics
The total resources C of network；
OptM is calculated successively by iterative formulau,vIn u=1 to u=nvWhen all values；
The required method of salary distribution isCorresponding allocation result；
The iterative formula is：
Wherein buWith fuThe baseline demands of respectively u-th virtual network and elastic demand,It is u-th virtual network institute
The new idling-resource total amount that need to be taken, φuTo add u-th total revenue of the increased physical network of virtual network.
Wherein, referring to Fig. 3, the new idling-resource total amount taken needed for u-th virtual networkCalculation procedure bag
Include：
Step S201：Calculate and needed by other virtual networks elasticity in the elastic demand of the virtual network and physical network
Seek the collision probability per portion resource of occupancy；
Step S202：The collision probability is not more than in the resource addition candidate collection of the conflict thresholding, and remembers time
The stock number that selected works are closed is n；
Step S203：If n >=fu, then f is chosen from the candidate collectionuElasticity of part resource allocation to the virtual network
Demand, it is describedAnd go to step S206；
Step S204：If n<fuAnd remaining idling-resource amount is more than bu+fu- n, then by all moneys in the candidate collection
The f chosen in source, and remaining idling-resourceu- n parts of resource allocation gives the elastic demand of the virtual network, described
Go to step S206；
Step S205：Refuse the virtual network, keep former allocation result constant；
Step S206：Receive the virtual network, record now OptMu,vCorresponding allocation result.
Wherein, in the step 201, the collision probability Prcollison=1-Prnone-(1-pu)Prone, wherein puFor this
The probability that the elastic demand of virtual network occurs, PrnoneFor all virtual network elastic demands of this part of resource are not sent out
Raw probability, ProneOnly to there is the probability of in this part of all virtual network elastic demands of resource.
It is described to choose f from the candidate collection in step S203uElastic demand of part resource allocation to the virtual network
Including：
For every part of resource, the difference of the conflict thresholding and the collision probability, and the difference and the Pr are calculatedone
Ratio；
By the ratio, order is arranged from small to large, and takes preceding fuElastic demand of part resource allocation to the virtual network.
And, in the step S203 and step 204 go to step S206 before, update PrnoneValue be (1-pu)
Prnone、ProneValue be (1-pu)Prone+puPrnone。
That is, the algorithm is first in u=1, traversal v=0 to v=C obtains all of OptM by iterative formula1,v；So
In kind calculate OptM successively again afterwardsu,vIn u=2 to u=nvWhen all of value, final allocation result just corresponds toSituation during value.
Certainly, when a virtual network is added every time, can all experience a series of judgement to be confirmed whether to receive the void
Intend network and how for it distributes resource, principle is to try to make the new occupancy resource of virtual network to try one's best less, so that adding below
The virtual network for entering has enough allowable resources, so as to improve the total revenue of physical network, all are all to meet about certainly
Under premised on beam condition.
For baseline resources, it is only necessary to directly distributed correspondingly by scheme of the prior art；But for bullet
Property resource, it is necessary to consider its collision probability no more than conflict thresholding constraints.So in actual algorithm, can use
One distance to go array, columns is 2, and line number characterizes the number of resources shared by elastic demand.Wherein first row is characterized and occupied
The probability P r that all virtual network elastic demands of this part of resource do not occurnone, secondary series characterize occupy this part of institute of resource
There is the probability P r of a generation one in virtual network elastic demandone.So according to the implication of collision probability, newly add for each
The virtual network for entering, just has：
Prcollison=1-Prnone-(1-pu)Prone
The meaning may as have after the elastic demand for adding the virtual network and occur simultaneously no less than two elastic demands
Probability.Certainly when every time to correspondence elastic demand distribution resource, the Pr of correspondence resourcenoneAnd ProneValue can all become
Change, so to update its value：
Prnone′=(1-pu)Prnone, Prone′=(1-pu)Prone+puPrnone。
And, choosing f from the resource in the n candidate collection for meeting conditionuWhen part is to the elastic demand for newly adding,
Need to be thought of as which resource it chooses for distributing.At this moment principle of selecting is exactly to make collision probability distance conflict thresholding
It is as far as possible remote, that is, difference tries one's best (more small probability is clashed) greatly, and have the general of elastic demand generation in former resource
Rate ProneAs far as possible small (to accommodate more elastic demands).So, just calculate this difference and ProneRatio, and by from
It is small to be sorted to big order, take preceding fuPart selects principle to the new elastic demand for adding as just meeting.
It can be seen that, above-mentioned algorithm can generate a kind of larger method of salary distribution of total revenue of a physical network, and algorithm letter
Just speed, is performed fast, it is adaptable to general application scenarios.
It should be noted that herein, such as first and second or the like relational terms are used merely to a reality
Body or operation make a distinction with another entity or operation, and not necessarily require or imply these entities or deposited between operating
In any this actual relation or order.And, term " including ", "comprising" or its any other variant be intended to
Nonexcludability is included, so that process, method, article or equipment including a series of key elements not only will including those
Element, but also other key elements including being not expressly set out, or also include being this process, method, article or equipment
Intrinsic key element.In the absence of more restrictions, the key element limited by sentence "including a ...", it is not excluded that
Also there is other identical element in process, method, article or equipment including the key element.
The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to the foregoing embodiments
The present invention has been described in detail, it will be understood by those within the art that：It still can be to foregoing each implementation
Technical scheme described in example is modified, or carries out equivalent to which part technical characteristic；And these modification or
Replace, do not make the spirit and scope of the essence disengaging various embodiments of the present invention technical scheme of appropriate technical solution.
Claims (6)
1. it is a kind of based on chance share wireless dummy resource allocation methods, it is characterised in that the method includes：
Determine the total resources of physical network；
Determine the quantity of virtual network and the resource requirement of each virtual network, including baseline demands, elastic demand and described
The probability that elastic demand occurs；Wherein baseline demands are the fixed resource demand that each virtual network must be monopolized, and elasticity is needed
It is the unfixed resource requirement occurred by certain probability to ask；
Determine that each virtual network needs the price for paying, the price is the concave function on its resource requirement；
Setting constraints, including total resources of the total resources no more than the physical network that virtual network is distributed, it is a
Resource is at most taken by a baseline demands, and the elastic demand of different virtual networks accounts for collision probability during with portion resource not altogether
More than predetermined conflict thresholding；
Under the constraints, the resource distribution mode for making physical network total revenue maximum is calculated by algorithm；
The algorithm is the iterative algorithm based on Dynamic Programming, and the algorithm includes：
Initialization OptMu,vValue in u=0 or v=0 is 0, wherein OptMu,vU virtual network is carried on resource before representing
Total amount is the maximum return in the physical network of v, quantity ns of the u no more than the virtual networkv, v is no more than the physical network
Total resources C；
OptM is calculated successively by iterative formulau,vIn u=1 to u=nvWhen all values；
The required method of salary distribution isCorresponding allocation result；
The iterative formula is：
Wherein buWith fuThe baseline demands of respectively u-th virtual network and elastic demand, θoptAccounted for for needed for u-th virtual network
New idling-resource total amount.
2. method according to claim 1, it is characterised in that the new free time taken needed for u-th virtual network
Total resources θoptCalculation procedure include：
Step S201：Calculate and accounted for by other virtual network elastic demands in the elastic demand of the virtual network and physical network
Per the collision probability of portion resource；
Step S202：The collision probability is not more than in the resource addition candidate collection of the conflict thresholding, and remembers Candidate Set
The stock number of conjunction is n；
Step S203：If n >=fu, then f is chosen from the candidate collectionuPart resource allocation gives the elastic demand of the virtual network,
The θopt=bu, and go to step S206；
Step S204：If n<fuAnd remaining idling-resource amount is more than bu+fu- n, then by all resources in the candidate collection, and
The f chosen in remaining idling-resourceu- n parts of resource allocation gives the elastic demand of the virtual network, the θopt=bu+fu- n, goes to
Step S206；
Step S205：If n<fuAnd remaining idling-resource amount is not more than bu+fu- n, then refuse the virtual network, keeps former distribution knot
It is really constant；
Step S206：Receive the virtual network, record now OptMu,vCorresponding allocation result.
3. method according to claim 2, it is characterised in that in the step 201, the collision probability Prcollison=
1-Prnone-(1-pu)Prone, wherein puIt is the probability that the elastic demand of the virtual network occurs, PrnoneIt is this part of resource
The probability that does not occur of all virtual network elastic demands, ProneIt is in this part of all virtual network elastic demands of resource
There is the probability of.
4. method according to claim 3, it is characterised in that described to choose f from the candidate collectionuPart resource allocation
Elastic demand to the virtual network includes：
For every part of resource, the difference of the conflict thresholding and the collision probability, and the difference and the Pr are calculatedoneRatio
Value；
By the ratio, order is arranged from small to large, and takes preceding fuElastic demand of part resource allocation to the virtual network.
5. method according to claim 3, it is characterised in that the step S203 and step 204 also include：Going to step
Before rapid S206, Pr is updatednoneValue be (1-pu)Prnone、ProneValue be (1-pu)Prone+puPrnone。
6. the method according to claim 1 to 5 any one, it is characterised in that the resource is frequency spectrum resource, described
Part 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 CN103781081A (en) | 2014-05-07 |
| CN103781081B true 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) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10182352B2 (en) * | 2014-08-22 | 2019-01-15 | British Telecommunications Public Limited Company | Small cell resource allocation |
| 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 |
| 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 |
| 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 |
| CN108257005A (en) * | 2017-12-28 | 2018-07-06 | 深圳市牛鼎丰科技有限公司 | Resource allocation methods, device, computer equipment and storage medium |
| CN111405587B (en) * | 2020-03-20 | 2022-10-21 | 三峡大学 | Virtual wireless network resource allocation method based on channel pricing |
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 |
|---|
| SLA-driven Dynamic Resource Provisioning for Service Provider in Cloud Computing;Yongyi Ran, Jian Yangy, Shuben Zhang, Hongsheng Xi;《IEEE》;20131213;第408-413页 * |
| 虚拟网构建及资源管理关键技术研究;张旻;《浙江大学博士学位论文》;20131215;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103781081A (en) | 2014-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103781081B (en) | Opportunity sharing-based wireless virtual resource allocation method | |
| Wang et al. | Delay-sensitive multi-period computation offloading with reliability guarantees in fog networks | |
| CN111130790B (en) | Block co-recognition method based on block chain node network | |
| CN105099951B (en) | A kind of resource regulating method and management equipment | |
| CN111866601B (en) | Cooperative game-based video code rate decision method in mobile marginal scene | |
| Ni et al. | Spectrum Allocation Based on Game Theory in Cognitive Radio Networks. | |
| CN105446817B (en) | A kind of federated resource configuration of reservations algorithm based on robust optimization in mobile cloud computing | |
| CN110035440A (en) | A kind of new distribution type access planar network architecture based on block chain | |
| CN106534302A (en) | Multi-task demand service combination method and system | |
| CN108960823A (en) | A kind of block chain multichain concurrent transaction system | |
| CN108990067B (en) | Energy efficiency control method applied to ultra-dense heterogeneous network | |
| CN107613309A (en) | Live resource self-defined distribution method, storage medium, electronic equipment and system | |
| CN103064744A (en) | Resource optimizing method applied to multi-layer web application based on SLA (Service Level Agreement) | |
| CN108055701A (en) | A kind of resource regulating method and base station | |
| CN103995749B (en) | The calculation task allocating method and system of cell cloud system | |
| CN107360031A (en) | It is a kind of based on optimization overhead gains than mapping method of virtual network | |
| Wang et al. | Joint service caching, resource allocation and computation offloading in three-tier cooperative mobile edge computing system | |
| CN114491616A (en) | Block chain and homomorphic encryption-based federated learning method and application | |
| CN108965168A (en) | A kind of car networking based on utility function is dominant resource fairness distribution optimization method | |
| CN107861820A (en) | A kind of resources of virtual machine distribution method and system | |
| CN106874108A (en) | Thin cloud is minimized in mobile cloud computing use number technology | |
| CN104320772A (en) | Trust degree and physical distance based D2D (Device to Device) communication node clustering method and device | |
| CN106453132A (en) | Dispatching method in hybrid cloud environment and flow control equipment | |
| CN106357560A (en) | Method and device for calculating and multiplexing channels | |
| CN104660525B (en) | Bandwidth allocation method, controller and communication system |
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 |