一种基于mid的基于主题的Pub-Sub覆盖结构负载均衡方法

IF 5.2 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ruisheng Shi , Fuqiang Liu , Yang Zhang , Bo Cheng , Junliang Chen
{"title":"一种基于mid的基于主题的Pub-Sub覆盖结构负载均衡方法","authors":"Ruisheng Shi ,&nbsp;Fuqiang Liu ,&nbsp;Yang Zhang ,&nbsp;Bo Cheng ,&nbsp;Junliang Chen","doi":"10.1016/S1007-0214(11)70079-7","DOIUrl":null,"url":null,"abstract":"<div><p><span><span>A large proportion of Internet of Things (IoT) applications are internally publish/subscribe in nature, and traditional architecture cannot support them efficiently and flexibly. In essence, supporting efficient publish/subscribe systems requires data-oriented naming and efficient multicast. Since deployment of native IP-based multicast has failed, overlay-based multicast has become the practical choice. Since load balancing between heterogeneous nodes is an important issue, designing an optimal load balancing </span>overlay network<span> for publish/subscribe systems is a necessary endeavor. This study focuses on the optimal load balancing overlay design problem for topic-based publish/subscribe systems in a heterogeneous environment (in terms of node processing power, bandwidth, and reachability). The Minimum Idle Degree (MID) model is introduced to capture the heterogeneity of overlay nodes<span>. Based on the MID model, new node load measures are defined that can accommodate heterogeneous server capacities and capture the node load in publish/subscribe systems more accurately than traditional measures. A new optimization problem, Maximum Minimum Idle Degree Topic-Connected Overlay (MMID-TCO), is established. This problem is NP-complete and a constant approximation algorithm does not exist for this problem (unless P = NP). Based on MID metrics, the Maximum Minimum Idle Degree Overlay Design Algorithm (MMID-ODA), which has </span></span></span>polynomial time, is introduced. To improve performance, an approach that breaks down the problem into several small-scale problems by exploiting the potential inherent disjoint characteristic in the subscription table is presented. Simulation results show that the proposed algorithm is able to achieve better load balance than MinMax-ODA in a heterogeneous environment.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70079-7","citationCount":"8","resultStr":"{\"title\":\"An MID-Based Load Balancing Approach for Topic-Based Pub-Sub Overlay Construction\",\"authors\":\"Ruisheng Shi ,&nbsp;Fuqiang Liu ,&nbsp;Yang Zhang ,&nbsp;Bo Cheng ,&nbsp;Junliang Chen\",\"doi\":\"10.1016/S1007-0214(11)70079-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span><span>A large proportion of Internet of Things (IoT) applications are internally publish/subscribe in nature, and traditional architecture cannot support them efficiently and flexibly. In essence, supporting efficient publish/subscribe systems requires data-oriented naming and efficient multicast. Since deployment of native IP-based multicast has failed, overlay-based multicast has become the practical choice. Since load balancing between heterogeneous nodes is an important issue, designing an optimal load balancing </span>overlay network<span> for publish/subscribe systems is a necessary endeavor. This study focuses on the optimal load balancing overlay design problem for topic-based publish/subscribe systems in a heterogeneous environment (in terms of node processing power, bandwidth, and reachability). The Minimum Idle Degree (MID) model is introduced to capture the heterogeneity of overlay nodes<span>. Based on the MID model, new node load measures are defined that can accommodate heterogeneous server capacities and capture the node load in publish/subscribe systems more accurately than traditional measures. A new optimization problem, Maximum Minimum Idle Degree Topic-Connected Overlay (MMID-TCO), is established. This problem is NP-complete and a constant approximation algorithm does not exist for this problem (unless P = NP). Based on MID metrics, the Maximum Minimum Idle Degree Overlay Design Algorithm (MMID-ODA), which has </span></span></span>polynomial time, is introduced. To improve performance, an approach that breaks down the problem into several small-scale problems by exploiting the potential inherent disjoint characteristic in the subscription table is presented. Simulation results show that the proposed algorithm is able to achieve better load balance than MinMax-ODA in a heterogeneous environment.</p></div>\",\"PeriodicalId\":60306,\"journal\":{\"name\":\"Tsinghua Science and Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.2000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70079-7\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tsinghua Science and Technology\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1007021411700797\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1007021411700797","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 8

摘要

很大一部分物联网应用本质上是内部发布/订阅,传统架构无法高效灵活地支持这些应用。实质上,支持高效的发布/订阅系统需要面向数据的命名和高效的多播。由于基于ip的本地组播部署失败,基于覆盖的组播成为了实际的选择。由于异构节点之间的负载平衡是一个重要的问题,因此为发布/订阅系统设计一个最佳负载平衡覆盖网络是一个必要的努力。本研究的重点是异构环境下基于主题的发布/订阅系统的最佳负载平衡覆盖设计问题(在节点处理能力、带宽和可达性方面)。引入最小空闲度(MID)模型来捕捉覆盖节点的异构性。基于MID模型,定义了新的节点负载度量,这些度量可以容纳异构服务器容量,并且比传统度量更准确地捕获发布/订阅系统中的节点负载。建立了一个新的优化问题——最大最小空闲度主题连通叠加(MMID-TCO)。这个问题是NP完全的,对于这个问题不存在常数逼近算法(除非P = NP)。基于MID指标,介绍了具有多项式时间的最大最小空闲度叠加设计算法(MMID-ODA)。为了提高性能,提出了一种利用订阅表中潜在的固有不相交特性将问题分解为几个小问题的方法。仿真结果表明,在异构环境下,该算法比MinMax-ODA具有更好的负载均衡性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An MID-Based Load Balancing Approach for Topic-Based Pub-Sub Overlay Construction

A large proportion of Internet of Things (IoT) applications are internally publish/subscribe in nature, and traditional architecture cannot support them efficiently and flexibly. In essence, supporting efficient publish/subscribe systems requires data-oriented naming and efficient multicast. Since deployment of native IP-based multicast has failed, overlay-based multicast has become the practical choice. Since load balancing between heterogeneous nodes is an important issue, designing an optimal load balancing overlay network for publish/subscribe systems is a necessary endeavor. This study focuses on the optimal load balancing overlay design problem for topic-based publish/subscribe systems in a heterogeneous environment (in terms of node processing power, bandwidth, and reachability). The Minimum Idle Degree (MID) model is introduced to capture the heterogeneity of overlay nodes. Based on the MID model, new node load measures are defined that can accommodate heterogeneous server capacities and capture the node load in publish/subscribe systems more accurately than traditional measures. A new optimization problem, Maximum Minimum Idle Degree Topic-Connected Overlay (MMID-TCO), is established. This problem is NP-complete and a constant approximation algorithm does not exist for this problem (unless P = NP). Based on MID metrics, the Maximum Minimum Idle Degree Overlay Design Algorithm (MMID-ODA), which has polynomial time, is introduced. To improve performance, an approach that breaks down the problem into several small-scale problems by exploiting the potential inherent disjoint characteristic in the subscription table is presented. Simulation results show that the proposed algorithm is able to achieve better load balance than MinMax-ODA in a heterogeneous environment.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
12.10
自引率
0.00%
发文量
2340
×
引用
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学术官方微信