《计算机应用》唯一官方网站 ›› 2023, Vol. 43 ›› Issue (9): 2812-2818.DOI: 10.11772/j.issn.1001-9081.2022081250

• 先进计算 • 上一篇    下一篇

CHAIN:基于重合支配的边缘计算节点放置算法

赵徐炎1,2,3, 崔允贺1,2,3(), 蒋朝惠1,2,3, 钱清4, 申国伟1,2,3, 郭春1,2,3, 李显超5   

  1. 1.贵州大学 计算机科学与技术学院, 贵阳 550025
    2.文本计算与认知智能教育部工程研究中心(贵州大学), 贵阳 550025
    3.公共大数据国家重点实验室(贵州大学), 贵阳 550025
    4.贵州财经大学 信息学院, 贵阳 550025
    5.贵州翔明科技有限责任公司, 贵阳 550000
  • 收稿日期:2022-08-25 修回日期:2023-01-11 接受日期:2023-01-16 发布日期:2023-02-28 出版日期:2023-09-10
  • 通讯作者: 崔允贺
  • 作者简介:赵徐炎(1998—),男,陕西韩城人,硕士研究生,主要研究方向:边缘计算、边缘服务器部署
    蒋朝惠(1965—),男,贵州贵阳人,教授,硕士,主要研究方向:云计算、信息安全、数据库、软件工程
    钱清(1986—),女,贵州贵阳人,副教授,博士,CCF会员,主要研究方向:多媒体安全、多媒体取证、信息隐藏
    申国伟(1986—),男,湖南邵阳人,教授,博士,主要研究方向:大数据、网络空间安全、高性能网络通信
    郭春(1986—),男,贵州贵阳人,副教授,博士,主要研究方向:恶意软件分析、入侵检测、数据挖掘
    李显超(1979—),男,贵州贵阳人,硕士,主要研究方向:数据中心、云计算、物联网。
  • 基金资助:
    国家自然科学基金资助项目(62102111);贵州省科技计划项目([2020]1Y267);贵州省普通高等学校青年科技人才成长项目(黔教合KY字[2021]136)

CHAIN: edge computing node placement algorithm based on overlapping domination

Xuyan ZHAO1,2,3, Yunhe CUI1,2,3(), Chaohui JIANG1,2,3, Qing QIAN4, Guowei SHEN1,2,3, Chun GUO1,2,3, Xianchao LI5   

  1. 1.College of Computer Science and Technology,Guizhou University,Guiyang Guizhou 550025,China
    2.Engineering Research Center of Ministry of Education for Text Computing and Cognitive Intelligence (Guizhou University),Guiyang Guizhou 550025,China
    3.State Key Laboratory of Public Big Data (Guizhou University),Guiyang Guizhou 550025,China
    4.School of Information,Guizhou University of Finance and Economics,Guiyang Guizhou 550025,China
    5.Guizhou Xiangming Technology Company Limited,Guiyang Guizhou 550000,China
  • Received:2022-08-25 Revised:2023-01-11 Accepted:2023-01-16 Online:2023-02-28 Published:2023-09-10
  • Contact: Yunhe CUI
  • About author:ZHAO Xuyan, born in 1998, M. S. candidate. His research interests include edge computing, edge server deployment.
    JIANG Chaohui, born in 1965, M. S., professor. His research interests include cloud computing, information security, database, software engineering.
    QIAN Qing, born in 1986, Ph. D., associate professor. Her research interests include multimedia security, multimedia forensics, information hiding.
    SHEN Guowei, born in 1986, Ph. D., professor. His research interests include big data, cyberspace security, high-performance network communication.
    GUO Chun, born in 1986, Ph. D., associate professor. His research interests include malware analysis, intrusion detection, data mining.
    LI Xianchao, born in 1979, M. S. His research interests include data center, cloud computing, internet of things.
  • Supported by:
    National Natural Science Foundation of China(62102111);Science and Technology Program of Guizhou Province([2020]1Y267);Guizhou Province Youth Science and Technology Talents Development Project of Colleges and Universities (Qian Jiaohe KY [2021]136)

摘要:

边缘计算将计算资源部署在离终端用户更近的边缘计算节点,从待选的位置中选择合适的边缘计算节点部署位置能提升边缘计算服务的节点容量以及用户服务质量(QoS)。然而,目前对于如何放置边缘计算节点以降低边缘计算成本的研究较少。此外,在边缘服务的时延等QoS因素的约束下,目前尚没有一种边缘计算节点部署算法能最大限度地提高边缘服务的鲁棒性同时最小化边缘节点部署成本。针对上述问题,首先,通过建立计算节点、用户传输时延和鲁棒性的模型将边缘计算节点放置问题转化为带约束条件的最小支配集问题;随后,提出重合支配的概念,基于重合支配衡量网络鲁棒性,设计了基于重合支配的边缘计算节点放置算法——CHAIN(edge server plaCement algoritHm based on overlApping domINation)。仿真实验结果表明,与面向覆盖的近似算法和面向基站的随机算法相比,CHAIN的系统时延降低了50.54%与50.13%。

关键词: 边缘计算, 边缘计算节点放置, 鲁棒性, 部署成本, 重合支配

Abstract:

In edge computing, computing resources are deployed at edge computing nodes closer to end users, and selecting the appropriate edge computing node deployment location from the candidate locations can enhance the node capacity and user Quality of Service (QoS) of edge computing services. However, there is less research on how to place edge computing nodes to reduce the cost of edge computing. In addition, there is no edge computing node deployment algorithm that can maximize the robustness of edge services while minimizing the deployment cost of edge computing nodes under the constraints of QoS factors such as the delay of edge services. To address the above issues, firstly, the edge computing node placement problem was transformed into a minimum dominating set problem with constraints by building a model about computing nodes, user transmission delay, and robustness. Then, the concept of overlapping domination was proposed, so that the network robustness was measured on the basis of overlapping domination, and an edge computing node placement algorithm based on overlapping domination was designed, namely CHAIN (edge server plaCement algoritHm based on overlAp domINation). Simulation results show that CHAIN can reduce the system latency by 50.54% and 50.13% compared to the coverage oriented approximate algorithm and base station oriented random algorithm, respectively.

Key words: edge computing, edge computing node placement, robustness, deployment cost, overlapping domination

中图分类号: