Name
Abstract | ||
|---|---|---|
Fog computing has emerged as a new paradigm in mobile network communications, aiming to equip the edge of the network with the computing and storing capabilities to deal with the huge amount of data and processing needs generated by the users devices and sensors. Optimizing the assignment of users to fogs is, however, still an open issue. In this paper, we formulated the problem of users-fogs association, as a matching game with minimum and maximum quota constraints, and proposed a Multi-Stage Differed Acceptance (MSDA) in order to balance the use of fogs resources and offer a better response time for users. Simulations results show that the performance of the proposed model compared to a baseline matching of users, achieves lowers delays for users. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/GLOCOM.2018.8647545 | IEEE Global Communications Conference |
Keywords | Field | DocType |
Fog computing,Computing tasks offloading,Minimum/Maximum quota,Users assignment | Matching game,Computer science,Computer network,Response time,Fog computing,Real-time computing,Cellular network | Conference |
ISSN | Citations | PageRank |
2334-0983 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amine Abouaomar | 1 | 3 | 1.71 |
| Abdellatif Kobbane | 2 | 126 | 27.54 |
| Soumaya Cherkaoui | 3 | 187 | 40.89 |