论文标题
用户污染分配的匹配游戏
Matching-Game for User-Fog Assignment
论文作者
论文摘要
雾计算已成为移动网络通信中的新范式，旨在为网络的边缘配备计算和存储功能，以应对用户的设备和传感器产生的巨大数据和处理需求。但是，优化用户对雾的分配仍然是一个空旷的问题。在本文中，我们提出了用户雾化关联的问题，作为具有最小和最大配额约束的匹配游戏，并提出了多个阶段不同的接受（MSDA），以平衡使用雾资资源的使用并为用户提供更好的响应时间。仿真结果表明，与用户的基线匹配相比，提出的模型的性能使用户的延迟降低了。
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.
