基于树的雾计算模型中的容错策略

R. Oma, Shigenari Nakamura, T. Enokido, M. Takizawa
{"title":"基于树的雾计算模型中的容错策略","authors":"R. Oma, Shigenari Nakamura, T. Enokido, M. Takizawa","doi":"10.4018/ijdst.2020100105","DOIUrl":null,"url":null,"abstract":"In the Fog Comput$ing (FC) model of the Internet of Things (IoT), application processes to handle sensor data are distributed to fog nodes and servers. In the Tree-based FC (TBFC) model proposed by the authors, fog nodes are hierarchically structured. In this article, the authors propose a TBFC for a General Process (TBFCG) model to recover from the faults of fog nodes. If a node gets faulty, the child nodes are disconnected. The authors propose Minimum Energy in the TBFCG tree (MET) and selecting Multiple Parents for recovery in the TBFCG tree (MPT) algorithms to select a new parent node for the disconnected nodes. A new parent node has to process data from not only the disconnected nodes, but also its own child nodes. In the evaluation, the energy consumption and execution time of a new parent node can be reduced by the proposed algorithms.","PeriodicalId":118536,"journal":{"name":"Int. J. Distributed Syst. Technol.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fault-Tolerant Strategies in the Tree-Based Fog Computing Model\",\"authors\":\"R. Oma, Shigenari Nakamura, T. Enokido, M. Takizawa\",\"doi\":\"10.4018/ijdst.2020100105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the Fog Comput$ing (FC) model of the Internet of Things (IoT), application processes to handle sensor data are distributed to fog nodes and servers. In the Tree-based FC (TBFC) model proposed by the authors, fog nodes are hierarchically structured. In this article, the authors propose a TBFC for a General Process (TBFCG) model to recover from the faults of fog nodes. If a node gets faulty, the child nodes are disconnected. The authors propose Minimum Energy in the TBFCG tree (MET) and selecting Multiple Parents for recovery in the TBFCG tree (MPT) algorithms to select a new parent node for the disconnected nodes. A new parent node has to process data from not only the disconnected nodes, but also its own child nodes. In the evaluation, the energy consumption and execution time of a new parent node can be reduced by the proposed algorithms.\",\"PeriodicalId\":118536,\"journal\":{\"name\":\"Int. J. Distributed Syst. Technol.\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Distributed Syst. Technol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/ijdst.2020100105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Distributed Syst. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijdst.2020100105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在物联网(IoT)的雾计算(FC)模型中,处理传感器数据的应用进程被分发到雾节点和服务器上。在作者提出的基于树的FC (TBFC)模型中,雾节点是分层结构的。在本文中,作者提出了一种通用过程(TBFCG)模型的TBFC,用于从雾节点故障中恢复。如果一个节点出现故障,子节点将断开连接。提出了TBFCG树最小能量法(MET)和TBFCG树多父恢复法(MPT)算法,为断开的节点选择新的父节点。新的父节点不仅要处理来自断开连接的节点的数据,还要处理来自它自己的子节点的数据。在评估过程中,所提出的算法可以降低新父节点的能耗和执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fault-Tolerant Strategies in the Tree-Based Fog Computing Model
In the Fog Comput$ing (FC) model of the Internet of Things (IoT), application processes to handle sensor data are distributed to fog nodes and servers. In the Tree-based FC (TBFC) model proposed by the authors, fog nodes are hierarchically structured. In this article, the authors propose a TBFC for a General Process (TBFCG) model to recover from the faults of fog nodes. If a node gets faulty, the child nodes are disconnected. The authors propose Minimum Energy in the TBFCG tree (MET) and selecting Multiple Parents for recovery in the TBFCG tree (MPT) algorithms to select a new parent node for the disconnected nodes. A new parent node has to process data from not only the disconnected nodes, but also its own child nodes. In the evaluation, the energy consumption and execution time of a new parent node can be reduced by the proposed algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信