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.
翻译:雾计算已成为移动网络通信的新范例,旨在为网络边缘提供计算和储存能力,以应对用户设备和传感器产生的大量数据和处理需求。不过,优化用户对雾的指定仍然是一个未决问题。在本文中,我们提出了用户-泡沫协会问题,作为与最低和最高配额限制的匹配游戏,并提出了多层次差异接受(MSDA),以平衡雾资源的使用,为用户提供一个更好的反应时间。模拟结果显示,与用户基准匹配相比,拟议模型的性能减少了用户的延误。