首页 | 本学科首页   官方微博 | 高级检索  
     

一种数据流处理环境下的节点副本放置方法
引用本文:丁维龙, 韩燕波. 一种数据流处理环境下的节点副本放置方法[J]. 电子与信息学报, 2014, 36(7): 1755-1761. doi: 10.3724/SP.J.1146.2013.01051
作者姓名:丁维龙  韩燕波
作者单位:北方工业大学云计算研究中心;
基金项目:北京市属高等学校创新团队建设与教师职业发展计划(IDHT2013 0502);北京市教育委员会科技计划重点项目(KZ201310009009);北京市教育委员会科技计划面上项目(KM201310009003)资助课题
摘    要:物联网环境下的许多应用表现为传感数据的连续流式处理,且系统往往通过节点的副本技术保障可用性。但是,运行时副本的备份和放置存在内存和带宽等资源开销,产生处理的延迟。该文给出一种方法,根据运行时的资源消耗以贪心方式放置节点的副本,折中了系统的可用性和开销。实际系统的仿真实验表明,在相同的条件下,该方法相比传统的随机放置,能为系统提供更稳定的可用性。

关 键 词:物联网   数据流   可用性保障   副本放置   贪心算法
收稿时间:2013-07-17
修稿时间:2014-01-26

A Replica Placement Method during Data Stream Processing
Ding Wei-Long, Han Yan-Bo. A Replica Placement Method during Data Stream Processing[J]. Journal of Electronics & Information Technology, 2014, 36(7): 1755-1761. doi: 10.3724/SP.J.1146.2013.01051
Authors:Ding Wei-Long  Han Yan-Bo
Abstract:Many applications of Internet of Things (IoT) are performed by the continuous stream processing of the senor data and nodes replicas are required to guarantee system availability. However, the replicas backup and placement often bring the processing delay at run-time due to the consumption of resources such as memory and bandwidth. In this paper, a method is proposed as greedy fashion by the resources cost to place nodes replicas, which could tradeoff between the availability and overheads of the system. Moreover, in a practical system, the extensive experiments show that the availability of the proposed method can be provided in a more stable manner than the traditional random placement under the same conditions.
Keywords:Internet of Things (IoT)  Data stream  Availability guarantee  Replica placement  Greedy algorithm
本文献已被 CNKI 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号