基于树的容错雾计算模型

IF 1 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
R. Oma, Shigenari Nakamura, Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"基于树的容错雾计算模型","authors":"R. Oma, Shigenari Nakamura, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1504/IJWGS.2019.10022420","DOIUrl":null,"url":null,"abstract":"In the fog computing model of the IoT, subprocesses of an application process to handle sensor data are performed on fog nodes. Since the IoT is scalable, we have to reduce the electric energy consumption. In the tree-based fog computing (TBFC) model, fog nodes are hierarchically structured. In this paper, we propose a fault-tolerant TBFC (FTBFC) model. In addition, we newly propose a pair of fault-tolerant strategies. In one data transmission strategy, data processed by disconnected fog nodes is sent to a new parent fog node. Here, we propose a minimum energy (ME) algorithm to select a new parent fog node whose energy consumption is minimum. In another subprocess transmission strategy, the subprocess of the faulty fog node is sent to another fog node. In the evaluation, the energy consumption and execution time of a new parent fog node can be reduced by the ME algorithm.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2019-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"A fault-tolerant tree-based fog computing model\",\"authors\":\"R. Oma, Shigenari Nakamura, Dilawaer Duolikun, T. Enokido, M. Takizawa\",\"doi\":\"10.1504/IJWGS.2019.10022420\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the fog computing model of the IoT, subprocesses of an application process to handle sensor data are performed on fog nodes. Since the IoT is scalable, we have to reduce the electric energy consumption. In the tree-based fog computing (TBFC) model, fog nodes are hierarchically structured. In this paper, we propose a fault-tolerant TBFC (FTBFC) model. In addition, we newly propose a pair of fault-tolerant strategies. In one data transmission strategy, data processed by disconnected fog nodes is sent to a new parent fog node. Here, we propose a minimum energy (ME) algorithm to select a new parent fog node whose energy consumption is minimum. In another subprocess transmission strategy, the subprocess of the faulty fog node is sent to another fog node. In the evaluation, the energy consumption and execution time of a new parent fog node can be reduced by the ME algorithm.\",\"PeriodicalId\":54935,\"journal\":{\"name\":\"International Journal of Web and Grid Services\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2019-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Web and Grid Services\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1504/IJWGS.2019.10022420\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web and Grid Services","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1504/IJWGS.2019.10022420","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 20

摘要

在物联网的雾计算模型中,处理传感器数据的应用进程的子进程在雾节点上执行。由于物联网是可扩展的,我们必须减少电能消耗。在基于树的雾计算(TBFC)模型中,雾节点是分层结构的。本文提出了一种容错TBFC (FTBFC)模型。此外,我们还提出了一种新的容错策略。在一种数据传输策略中,由断开的雾节点处理的数据被发送到新的父雾节点。在此,我们提出了一种最小能量(ME)算法来选择能量消耗最小的新父雾节点。在另一种子进程传输策略中,将故障雾节点的子进程发送到另一个雾节点。在评价中,采用ME算法可以降低新父雾节点的能耗和执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fault-tolerant tree-based fog computing model
In the fog computing model of the IoT, subprocesses of an application process to handle sensor data are performed on fog nodes. Since the IoT is scalable, we have to reduce the electric energy consumption. In the tree-based fog computing (TBFC) model, fog nodes are hierarchically structured. In this paper, we propose a fault-tolerant TBFC (FTBFC) model. In addition, we newly propose a pair of fault-tolerant strategies. In one data transmission strategy, data processed by disconnected fog nodes is sent to a new parent fog node. Here, we propose a minimum energy (ME) algorithm to select a new parent fog node whose energy consumption is minimum. In another subprocess transmission strategy, the subprocess of the faulty fog node is sent to another fog node. In the evaluation, the energy consumption and execution time of a new parent fog node can be reduced by the ME algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Web and Grid Services
International Journal of Web and Grid Services COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
2.40
自引率
20.00%
发文量
24
审稿时长
12 months
期刊介绍: Web services are providing declarative interfaces to services offered by systems on the Internet, including messaging protocols, standard interfaces, directory services, as well as security layers, for efficient/effective business application integration. Grid computing has emerged as a global platform to support organisations for coordinated sharing of distributed data, applications, and processes. It has also started to leverage web services to define standard interfaces for business services. IJWGS addresses web and grid service technology, emphasising issues of architecture, implementation, and standardisation.
×
引用
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学术官方微信