CN103781184B - Pricing-based scheduling method for wireless virtualized resources - Google Patents
Pricing-based scheduling method for wireless virtualized resources Download PDFInfo
- Publication number
- CN103781184B CN103781184B CN201410073792.5A CN201410073792A CN103781184B CN 103781184 B CN103781184 B CN 103781184B CN 201410073792 A CN201410073792 A CN 201410073792A CN 103781184 B CN103781184 B CN 103781184B
- Authority
- CN
- China
- Prior art keywords
- network
- physical network
- resources
- virtual
- physical
- 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 a pricing-based scheduling method for wireless virtualized resources. The method comprises the following steps of: determining the number of physical networks and the number of resources owned by each of the physical networks; determining the number of virtual networks and the number of resources needed by each of the virtual networks; determining the price needing to be paid by each of the virtual networks for obtaining the needed number of resources, the price being the concave function of the needed number of resources; setting constraint conditions comprising that each of the virtual networks is at most born by one physical network, and the sum of the virtual network resources born in each of the physical networks does not greater than the number of resources owned by the physical network; calculating a resource scheduling mode enabling the total revenue of the physical networks to be the maximum by an algorithm under the constraint conditions. The method disclosed by the invention is capable of realizing revenue-maximization scheduling for the wireless virtualized resources in the case that a plurality of physical networks exist in a bottom level.
Description
Technical field
The present invention relates to mobile and radio network technique field, and in particular to a kind of wireless dummy resource based on price
Dispatching method.
Background technology
With becoming increasingly prosperous and continuous growth of the people to amount of communication data demand for intelligent terminal, mobile radio network
Having become affects one of technology with the fastest developing speed of people's life.However, wireless network Luoque is faced with the development of itself
Predicament, what is stood in the breach is " frequency spectrum resource crisis "（Spectrum Crisis）.Many are runed the existing frequency spectrum resource of quotient representation
It has been becoming tight day and has been difficult to the mobile data demand for meeting sharp increase, but numerous scholars and industry experts then represent frequency spectrum resource
Crisis main cause is that radio spectrum resources are not fully used.For a common example, people are flooded with one's side respectively
The wireless network of formula various kinds（GSM, 3G, LTE, public WiFi, enterprise WiFi network of each operator etc.）, but user is but only
A network can limitedly be accessed, even if the network performance of the access is poor or compared with congestion, even if or other wireless networks gather around
There is the more preferable resource of vacant, performance.
Wireless dummy technology is resulted under above-mentioned background, and he is allowed at one（Or it is multiple）Shared bottom physics without
Run multiple parallel virtual wireless networks on gauze network, each virtual wireless network can parallel running, dispose different agreements,
Independent bearing is serviced.Operator can be separated into physical resource provider by wireless dummyization（InPs）, service（Virtual net）Carry
For business（SPs）, and for InPs, SPs and terminal use（UE）Bring advantage.For InPs, energy after wireless dummy
Utilization rate bigizationner of its physical resource is enough made, it is also possible to preferably ensure QoS demand, so as to improve its income；For SPs
Speech, can be absorbed in the offer and innovation of service, and be no longer limited by bottom physical radio resource, while being also beneficial to small-scale
Service provider peculiar service is provided, add the market competition；For terminal use（UE）For, more service providers'
Addition makes it have more SPs offer services for selecting motility, can selecting that price more reasonable, service quality is higher.Still examine
Consider above-mentioned example, after wireless dummy, user is no longer limited by specific physical radio resource, can be according to self-demand
The different virtual network of different choice access, so as to improve service quality.Therefore, wireless dummy technology can be significantly improved
The utilization rate of radio spectrum resources, and be conducive to the optimization of physical resource and the innovation of network service, be conducive to QoS to ensure and
Consumer's Experience.Wireless dummy in proposing and cause at short notice the concern of numerous scholars in recent years.
But to realize this imagination, the matter of utmost importance of wireless dummy is resource scheduling, i.e. bottom physical radio net
How network dispatches its physical resource（Frequency spectrum resource）To meet the request of some virtual nets.Existing wireless dummy scheduling of resource
Algorithm is relatively simple or direct, and assumes physical resource provider（InP）Provide only the situation of a physical radio network.
But in practical situation, bottom has multiple physical networks, there is presently no a complete scheme and go for this bottom
Scheduling of resource situation during the multiple physical networks of layer.
The content of the invention
（One）The technical problem of solution
For the deficiencies in the prior art, the present invention provides a kind of wireless dummy resource regulating method based on price, can
When bottom has multiple physical networks, to realize the maximum revenue of wireless dummy resource.
（Two）Technical scheme
To realize object above, the present invention is achieved by the following technical programs：
A kind of wireless dummy resource regulating method based on price, it is characterised in that the method includes：
The number of resources that the number and each physical network for determining physical network is possessed；
Determine the number and the required number of resources of each virtual network of virtual network；
Determine each virtual network needs the price of payment to obtain required number of resources, and the price is with regard to its institute
The concave function of demand number of resources；
Setting constraints, including each virtual network is at most by a physical network carrying, and it is carried on each physics
Virtual network resource number summation in network is less than the number of resources that the physical network is possessed；
Under the agreed terms, the source scheduling mode for making physical network total revenue maximum is calculated by algorithm.
Preferably, the algorithm is genetic algorithm.
Preferably, in the genetic algorithm, the number of the gene of each chromosome is the number of the virtual network, gene
Value for physical network sequence number.
Preferably, the relevance grade of the genetic algorithm is the physical network total revenue, and its computational methods includes：
The required number of resources of each virtual network and the ratio for needing price paid are calculated, and by order from small to large
Virtual network is sorted；
Order according to the sequence is followed successively by the resource that each virtual network is dispatched under the sequence number of its correspondence physical network,
If meeting the constraints after scheduling the virtual network is labeled as to dispatch successfully, is otherwise labeled as scheduling failure；
All price sums for being labeled as dispatching the needs payment of successful virtual network are calculated, the physical network is designated as
Total revenue.
Preferably, all price sums for being labeled as dispatching the needs payment of successful virtual network are being calculated, is being designated as institute
State also includes before physical network total revenue step：
Find labelling and be respectively two virtual networks for dispatching successfully and dispatching failure, exchange its corresponding physical network
Sequence number and the labelling so that the scheduling mode after exchange meets the constraints, and the physical network total revenue increases.
Preferably, in the initialization operation of the genetic algorithm, correspond to each virtual network and randomly choose corresponding physics
Network sequence number, the probability that each physical network is selected at random and its own number of resources positive correlation.
Preferably, the mutation operation in the genetic algorithm is at random to become the sequence number of the physical network of correspondence virtual network
For the sequence number of another physical network.
Preferably, optimum reserved strategy is adopted in the genetic algorithm.
Preferably, the genetic algorithm is used for performing cross exchanged behaviour using roulette algorithms selection
Preferably, it is characterised in that the resource is frequency spectrum resource, the number of resources is the number of channel.
（Three）Beneficial effect
The present invention at least has following beneficial effect：
The method is characterized in that featuring Physical Network in wireless dummy resource scheduling exactly by pricing model
Economic relation between network and virtual network, is converted into asking for maximum revenue in economy by the scheduling problem of limited resources then
Topic.Based on " number of resources-to dutiable value " this " demand commodity-commodity price " relation, existing economics not only can be used
Model and algorithm solve this resource scheduling, are conducive to further being lifted the utilization rate of overall income and resource, together
When also help between physical network and virtual network this visual angle of economic relation on analyze resource scheduling, give this class
Problem a kind of new thinking is provided.
Certainly, the arbitrary product or method for implementing the present invention it is not absolutely required to while reaching all the above excellent
Point.
Description of the drawings
In order to be illustrated more clearly that 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 these
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 regulating method flow chart based on price in one embodiment of the invention；
Fig. 2 is wireless dummy network structure described in one embodiment of the invention；
Fig. 3 is the genetic algorithm flow chart described in one embodiment of the invention.
Specific embodiment
To make purpose, technical scheme and the 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
The a part of embodiment of the present invention, rather than the embodiment of whole.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 regulating method based on price, referring to Fig. 1, the method
Including：
Step 101：The number of resources that the number and each physical network for determining physical network is possessed；
Step 102：Determine the number and the required number of resources of each virtual network of virtual network；
Step 103：The price for determining each virtual network and paying to obtain required number of resources to need, the price is
With regard to the concave function of its required number of resources；
Step 104：Setting constraints, including each virtual network is at most by a physical network carrying, and be carried on
Virtual network resource number summation in each physical network is less than the number of resources that the physical network is possessed；
Step 105：Under the agreed terms, the scheduling of resource 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 several physical networks.Virtual network itself does not occupy physical resource, and it to physical network application resource by obtaining
To run.Physical network occupies physical resource, can be according to the resource requirement of virtual wireless network to its scheduling resource.It is some virtual
Network parallel is run on physical network, shares the resource of physical network.
In embodiments of the present invention, described resource refers specifically to frequency spectrum resource（Actually can also be other resource shapes
Formula）, and the quantity of resource is weighed with the number of channel.The mathematical modulo of resource scheduling under such that it is able to specifically build this scene
Type：
First, the number and the number of resources that possessed of each physical network of physical network are determined in a step 101, and by thing
Reason network resources model is characterized asWherein nPRepresent the number of physical network, each physical network
The resource for being possessed is limited, is characterized as respectively
Correspondingly, the number and the required number of resources of each virtual network of virtual network are determined in a step 102, and will
Virtual network resource model is characterized asWherein nvRepresent the number of virtual network, its resource requirement
Collection is combined intoWherein wiRepresent the apllied number of resources of i-th virtual network.
On this basis, each virtual network is determined in step 103 needs what is paid to obtain required number of resources
Price, the price is the concave function with regard to its required number of resources.Specifically, that is, will represent virtual in pricing model
Network needs the price paid to physical network to be characterized as：Wherein piRepresent i-th virtual net
The price paid required for network, is characterized as pi=f (wi), function f is concave function.
According to above-mentioned physical network resource model, virtual network resource model and pricing model, it is determined that required solution problem
Constraints and object function.
Constraints is set at step 104, including each virtual network is at most carried by a physical network, and carry
Virtual network resource number summation in each physical network is less than the number of resources that the physical network is possessed.
In step 105, the resource for making physical network total revenue maximum tune is calculated by algorithm under the agreed terms
Degree mode, that is, object function is determined to make physical network total revenue maximum, and for this mathematical problem, using existing
There is algorithm to solve.
Since then, whole mathematical model is just determined.Wherein, virtual network and physical network are respectively seen as into resource
Purchaser and provider, certainly the price of purchase is the function p of purchase volumei=f (wi), and the problem of scheduling of resource is namely
How to allow both sides to complete resource transaction to greatest extent, that is, reach the transaction pair of purchaser and provider as much as possible,
The demand for making purchaser is met as far as possible, and the income of provider reaches maximum.
It can be seen that, based on this " number of resources-to dutiable value " this " demand commodity-commodity price " relation, not only can make
This resource scheduling is solved with existing Economic Model and algorithm, is conducive to further lifting overall income and money
The utilization rate in source, while to also help analyze scheduling of resource on this visual angle of economic relation between physical network and virtual network
Problem, to the problem of this class a kind of new thinking is provided.
With regard to this mathematical model, a kind of optimization algorithm being provided below --- genetic algorithm is solving this mathematical problem：
Genetic algorithm belongs on the whole prior art, be a kind of natural imitation circle biological evolution mechanism grow up with
Machine global search and optimization method.It has used for reference Darwinian theory of evolution and Mendelian theory of heredity.Its essence is a kind of high
Effect, the parallel, method of global search, it can automatically obtain and accumulate the knowledge about search space, and oneself in search procedure
The command deployment process of adaptation is in the hope of optimal solution.The general algorithm structure of genetic algorithm is：
Initialization（Population）；
Circulation：
Evaluate the individual relevance grade in population；
Select to produce next population with preferably high relevance grade principle；
Change the population（Crossover operation and mutation operation）；
Until the condition for stopping circulation meeting, end loop.
When being specifically applied in this mathematical model, population is just encoded using integer position, and preferably nVIt is individual virtual
Network is used as nVIndividual gene, its value is the 1～n of sequence number of physical networkP, a gene and its value are equivalent to be to correspondence
Virtual network scheduled a corresponding physical network, every chromosome just represents a kind of source scheduling mode.As for calculation
The parameters such as evolution depth, crossover probability and the mutation probability used in method, can be arranged according to specific situation, and it belongs to normal
Technological means, will not be described here.
After the definition and value for defining gene, the relevance grade of whole population will become thing according to object function setting
Reason network total revenue.But under every kind of source scheduling mode, might not all can meet the constraint condition, so suitable calculating
During expenditure, the situation for considering scheduling failure is needed：
The required number of resources of each virtual network and the ratio for needing price paid are calculated, and by order from small to large
Virtual network is sorted；
Order according to the sequence is followed successively by the resource that each virtual network is dispatched under the sequence number of its correspondence physical network,
If meeting the constraints after scheduling the virtual network is labeled as to dispatch successfully, is otherwise labeled as scheduling failure；
All price sums for being labeled as dispatching the needs payment of successful virtual network are calculated, the physical network is designated as
Total revenue.
So as to after the virtual network for rejecting scheduling failure, just can obtain to should scheduling mode, that is, the dyeing
The relevance grade of body, can carry out heredity and evolution, after reaching enough evolution depth, just according to the principle of the survival of the fittest then
A kind of relevance grade comparatively highest chromosome, that is, the scheduling of resource side of required solution can be found from the population of result
Formula.
Preferably, all price sums for being labeled as dispatching the needs payment of successful virtual network are being calculated, is being designated as institute
State also includes before physical network total revenue step：Find labelling and be respectively two virtual nets for dispatching successfully and dispatching failure
Network, exchanges the sequence number and the labelling of its corresponding physical network so that the scheduling mode after exchange meets the constraints,
And the physical network total revenue increase.Do so is exactly in fact before relevance grade is calculated every time, then current scheduling
As a result once dispatched again, made the higher virtual network of price in scheduling unsuccessfully, relatively low with price in scheduling success is virtual
Network is exchanged, and after exchanging certainly meet the constraint condition is still wanted, and overall physical network income can thus increased again,
One suboptimization is carried out to the relevance grade of itself, algorithm process is helped speed up.Specifically can be carried out using following manner
This operation：
If dispatching successfully virtual net collection is combined into VNSucc, the scheduling virtual net collective of failure be VNRej.Traversal VNRejIn each
Virtual netIn VNSuccFind virtual net（IfThe surplus resources number that corresponding physical network possesses is rj）
So thatAndIn qualified VNSuccIn takeIt is minimum by it from VNSuccDelete
Go, and shouldIt is placed into VNSuccIn, while both gene values are exchanged.
In initialization operation, preferred pair answers each virtual network to randomly choose corresponding physical network sequence number, and makes every
The probability that individual physical network is selected at random and its own number of resources positive correlation.That is, random selection when with compared with
Maximum probability chooses the more physical network of resource, in order to avoid have more virtual network to be all dispatched in the initial schedule mode for arranging
Resource less physical network, and make most of virtual network scheduling unsuccessful, algorithm may be made to be difficult to restrain.
Preferably, after every wheel relevance grade calculating is completed, the optimal chromosome of the relevance grade for occurring so far is taken
The strategy of most withing a hook at the end that relevance grade in current population is most poorly commonly used in chromosome, that is, genetic algorithm is replaced, so can be with
Current optimal result of calculation is set to be unlikely to be excluded.
In addition, according to for the setting of gene and population, corresponding mutation operation is the physics of correspondence virtual network
The sequence number of network is changed at random the sequence number of another physical network, and corresponding cross exchanged operation is just randomly generated an intersection
Position so that two parts in front and back that crossover location is located in two female chromosomes are exchanged, wherein being used using roulette algorithms selection
To perform the chromosome of cross exchanged operation.
Comprehensive technology essential factor all of the above, the total algorithm flow process of genetic algorithm is as follows（Referring to Fig. 3）：
S201：Genetic algorithm parameter is arranged and initialization population.
S202：Genetic algorithm calculates relevance grade function.
S203：Genetic algorithm performs optimum reserved strategy.
S204：Genetic algorithm performs selection, crossover operation, generates new population.
S205：Genetic algorithm performs mutation operation, generates new population.
S206：If exceeding evolution depth or more than maximum number of observation, S208 is performed.
S207：Return S202.
S208：Output scheduling of resource result.
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 deposit between operating
In any this actual relation or order.And, term " including ", "comprising" or its any other variant are intended to
Nonexcludability is included, so that a series of process, method, article or equipment including key elements not only will including those
Element, but also including other key elements being not expressly set out, or also include for this process, method, article or equipment
Intrinsic key element.In the absence of more restrictions, the key element for being 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.
Above example only to illustrate technical scheme, rather than a limitation；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 aforementioned each enforcement
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 (7)
1. it is a kind of based on the wireless dummy resource regulating method fixed a price, it is characterised in that the method includes：
The number of resources that the number and each physical network for determining physical network is possessed；
Determine the number and the required number of resources of each virtual network of virtual network；
Determine each virtual network needs the price of payment to obtain required number of resources, and the price is required with regard to its
The concave function of number of resources；
Setting constraints, including each virtual network is at most by a physical network carrying, and it is carried on each physical network
In the number of resources that possessed less than the physical network of virtual network resource number summation；
Under the agreed terms, the source scheduling mode for making physical network total revenue maximum is calculated by algorithm；
Wherein, the algorithm is genetic algorithm；In the genetic algorithm, the number of the gene of each chromosome is the virtual net
The number of network, the value of gene is the sequence number of physical network；
The relevance grade of the genetic algorithm is the physical network total revenue, and its computational methods includes：
Calculate the required number of resources of each virtual network and the ratio for needing price paid, and by order from small to large by void
Intend network sequence；
Order according to the sequence is followed successively by the resource that each virtual network is dispatched under the sequence number of its correspondence physical network, if adjusting
The constraints is met after degree to be then labeled as the virtual network dispatching successfully, is otherwise labeled as scheduling failure；
All price sums for being labeled as dispatching the needs payment of successful virtual network are calculated, the physical network is designated as and is always received
Benefit.
2. method according to claim 1, it is characterised in that all be labeled as dispatching successful virtual network calculating
The price sum for paying is needed, is designated as also including before the physical network total revenue step：
Find labelling and be respectively two virtual networks for dispatching successfully and dispatching failure, exchange the sequence number of its corresponding physical network
With the labelling so that the scheduling mode after exchange meets the constraints, and the physical network total revenue increases.
3. method according to claim 1, it is characterised in that in the initialization operation of the genetic algorithm, correspond to each
Virtual network randomly chooses corresponding physical network sequence number, the probability that each physical network is selected at random and its own money
Source number positive correlation.
4. method according to claim 1, it is characterised in that the mutation operation in the genetic algorithm be will correspondence it is virtual
The sequence number of the physical network of network is changed at random the sequence number of another physical network.
5. method according to claim 1, it is characterised in that optimum reserved strategy is adopted in the genetic algorithm.
6. method according to claim 1, it is characterised in that the genetic algorithm is used for holding using roulette algorithms selection
The chromosome of row cross exchanged operation.
7. according to the method described in any one of claim 1 to 6, it is characterised in that the resource be frequency spectrum resource, the money
Source number is the number of channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410073792.5A CN103781184B (en) | 2014-02-28 | 2014-02-28 | Pricing-based scheduling method for wireless virtualized resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410073792.5A CN103781184B (en) | 2014-02-28 | 2014-02-28 | Pricing-based scheduling method for wireless virtualized resources |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103781184A CN103781184A (en) | 2014-05-07 |
| CN103781184B true CN103781184B (en) | 2017-04-19 |
Family
ID=50572867
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410073792.5A Expired - Fee Related CN103781184B (en) | 2014-02-28 | 2014-02-28 | Pricing-based scheduling method for wireless virtualized resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103781184B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103428805A (en) * | 2013-08-07 | 2013-12-04 | 湖南大学 | Wireless network virtualization mapping method based on anti-interference performance of links |
-
2014
- 2014-02-28 CN CN201410073792.5A patent/CN103781184B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103428805A (en) * | 2013-08-07 | 2013-12-04 | 湖南大学 | Wireless network virtualization mapping method based on anti-interference performance of links |
Non-Patent Citations (2)
| Title |
|---|
| Karnaugh-map Like Online Embedding Algorithm of Wireless Virtualization;Mao Yang, Yong Li, Lieguang Zeng, Depeng Jin, Li Su;《Proceedings of the 15th international symposium on wireless personal》;20120927;第594-598页 * |
| Opportunistic Spectrum Sharing Based Resource Allocation for Wireless Virtualization;Mao Yang, Yong Li, Depeng Jin, Jian Yuan, Li Su, Lieguang Zeng;《Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing》;20130705;第51-58页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103781184A (en) | 2014-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | Energy-efficient offloading for DNN-based smart IoT systems in cloud-edge environments | |
| WO2020082973A1 (en) | Load prediction method and apparatus based on neural network | |
| CN110418356A (en) | A kind of calculating task discharging method, device and computer readable storage medium | |
| Salinas et al. | Multi-objective optimal energy consumption scheduling in smart grids | |
| CN112286677B (en) | Resource-constrained edge cloud-oriented Internet of things application optimization deployment method | |
| CN104009939B (en) | A kind of service resource allocation method and system | |
| CN108874525A (en) | A kind of service request distribution method towards edge calculations environment | |
| CN107871164A (en) | A kind of mist computing environment personalization deep learning method | |
| CN104484233B (en) | A kind of resource allocation methods | |
| CN107317699A (en) | A kind of quick method for optimizing of dynamic ant colony of cloud manufacturing service combination | |
| CN103995749B (en) | The calculation task allocating method and system of cell cloud system | |
| CN105554773A (en) | Actual benefit maximized heterogeneous frequency spectrum bidirectional auction mechanism in cognitive network | |
| Tyagi et al. | Computing resource optimization of big data in optical cloud radio access networked industrial Internet of Things | |
| CN115276047A (en) | Electric energy scheduling method and device and computer readable storage medium | |
| Zhang et al. | Incentive mechanism design for edge-cloud collaboration in mobile crowd sensing | |
| CN109981340A (en) | The method that mist calculates joint optimization of resources in network system | |
| CN106878967A (en) | Note transmission method and device | |
| CN110139282A (en) | A kind of energy acquisition D2D communication resource allocation method neural network based | |
| Ren et al. | Wireless network virtualization resource sharing based on dynamic resource allocation algorithm | |
| CN103781184B (en) | Pricing-based scheduling method for wireless virtualized resources | |
| CN106610866A (en) | Service value constrained task scheduling algorithm in cloud storage environment | |
| CN116542490A (en) | Virtual power plant day-ahead dispatching encapsulation model and dispatching ex-definition model construction method | |
| CN104410976B (en) | A kind of distributed end-to-end user associates and time allocation method used therein with cellular network subscriber | |
| CN116596640A (en) | Recommendation method, system, equipment and storage medium for electric power retail electric charge package | |
| CN104202777B (en) | Resource negotiation method based on augmentation Lagrange in mobile ad hoc network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170419 Termination date: 20210228 |