User Allocation for Real-Time Applications with State Sharing in Fog Computing Networks

Ryohei Sato, Hidetoshi Kawaguchi, Yuichi Nakatani
{"title":"User Allocation for Real-Time Applications with State Sharing in Fog Computing Networks","authors":"Ryohei Sato, Hidetoshi Kawaguchi, Yuichi Nakatani","doi":"10.1109/IPDPSW52791.2021.00123","DOIUrl":null,"url":null,"abstract":"Applications in which multiple users share the states in real-time over a network have been rapidly spreading, but network latency degrades their quality of service (QoS) and quality of experience (QoE). Although Fog computing effectively mitigates this problem, user allocation methods suitable for these applications with strict latency requirements have not yet been studied. Therefore, this paper proposes both offline and online methods that assume state sharing for user allocation in Fog environments. These methods not only reduce the mean of delays within each group composed of users who share the same states but also guarantee fairness among the users. The simulations demonstrate that our methods complete the allocation in a realistic time and outperform the baseline methods and architectures.","PeriodicalId":170832,"journal":{"name":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"345 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPSW52791.2021.00123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Applications in which multiple users share the states in real-time over a network have been rapidly spreading, but network latency degrades their quality of service (QoS) and quality of experience (QoE). Although Fog computing effectively mitigates this problem, user allocation methods suitable for these applications with strict latency requirements have not yet been studied. Therefore, this paper proposes both offline and online methods that assume state sharing for user allocation in Fog environments. These methods not only reduce the mean of delays within each group composed of users who share the same states but also guarantee fairness among the users. The simulations demonstrate that our methods complete the allocation in a realistic time and outperform the baseline methods and architectures.
雾计算网络中状态共享实时应用的用户分配
多个用户在网络上实时共享状态的应用正在迅速扩展,但网络延迟降低了它们的服务质量(QoS)和体验质量(QoE)。尽管雾计算有效地缓解了这一问题,但适合这些具有严格延迟要求的应用的用户分配方法尚未得到研究。因此,本文提出了离线和在线两种假设状态共享的雾环境下用户分配方法。这些方法不仅减少了由具有相同状态的用户组成的每组的平均延迟,而且保证了用户之间的公平性。仿真结果表明,我们的方法在较短的时间内完成了分配,并且优于基准方法和体系结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信