http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109947545-B
Outgoing Links
| Predicate | Object |
|---|---|
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-24 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-50 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04W4-50 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-48 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04W72-04 |
| filingDate | 2019-03-11-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2020-10-16-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationDate | 2020-10-16-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-109947545-B |
| titleOfInvention | Task unloading and migration decision method based on user mobility |
| abstract | The invention belongs to the technical field of mobile communication, and particularly relates to a task unloading and migration decision method based on user mobility; the method comprises the steps that a mobile user determines the cost and the benefit of a mobile edge cloud system according to the relation between random connection time and task processing time; establishing a profit system model by taking the profit of the maximized mobile edge cloud system as a target; adopting a multi-stage stochastic programming method for the revenue model; thus obtaining the income of each mobile edge cloud computing MEC and the corresponding unloading task amount thereof; and an upper confidence bound algorithm is adopted to maximize the average benefit of the system within the learning time T, so that the MEC with the maximum system benefit is obtained. The method and the device can solve the problem of randomness of connection time between the mobile user and the MEC and the problem of specifically selecting the MEC, thereby being widely applied to a mobile edge cloud system. |
| priorityDate | 2019-03-11-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 19.