Dynamoth: A Scalable Pub/Sub Middleware for Latency-Constrained Applications in the Cloud

Julien Gascon-Samson, F. Garcia, Bettina Kemme, J. Kienzle
{"title":"Dynamoth: A Scalable Pub/Sub Middleware for Latency-Constrained Applications in the Cloud","authors":"Julien Gascon-Samson, F. Garcia, Bettina Kemme, J. Kienzle","doi":"10.1109/ICDCS.2015.56","DOIUrl":null,"url":null,"abstract":"This paper presents Dynamoth, a dynamic, scalable, channel-based pub/sub middleware targeted at large scale, distributed and latency constrained systems. Our approach provides a software layer that balances the load generated by a high number of publishers, subscribers and messages across multiple, standard pub/sub servers that can be deployed in the Cloud. In order to optimize Cloud infrastructure usage, pub/sub servers can be added or removed as needed. Balancing takes into account the live characteristics of each channel and is done in an hierarchical manner across channels (macro) as well as within individual channels (micro) to maintain acceptable performance and low latencies despite highly varying conditions. Load monitoring is performed in an unintrusive way, and rebalancing employs a lazy approach in order to minimize its temporal impact on performance while ensuring successful and timely delivery of all messages. Extensive real-world experiments that illustrate the practicality of the approach within a massively multiplayer game setting are presented. Results indicate that with a given number of servers, Dynamoth was able to handle 60% more simultaneous clients than the consistent hashing approach, and that it was properly able to deal with highly varying conditions in the context of large workloads.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 35th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2015.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46

Abstract

This paper presents Dynamoth, a dynamic, scalable, channel-based pub/sub middleware targeted at large scale, distributed and latency constrained systems. Our approach provides a software layer that balances the load generated by a high number of publishers, subscribers and messages across multiple, standard pub/sub servers that can be deployed in the Cloud. In order to optimize Cloud infrastructure usage, pub/sub servers can be added or removed as needed. Balancing takes into account the live characteristics of each channel and is done in an hierarchical manner across channels (macro) as well as within individual channels (micro) to maintain acceptable performance and low latencies despite highly varying conditions. Load monitoring is performed in an unintrusive way, and rebalancing employs a lazy approach in order to minimize its temporal impact on performance while ensuring successful and timely delivery of all messages. Extensive real-world experiments that illustrate the practicality of the approach within a massively multiplayer game setting are presented. Results indicate that with a given number of servers, Dynamoth was able to handle 60% more simultaneous clients than the consistent hashing approach, and that it was properly able to deal with highly varying conditions in the context of large workloads.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dynamoth:一个可扩展的发布/订阅中间件,用于云中延迟受限的应用程序
Dynamoth是一种动态的、可扩展的、基于信道的发布/订阅中间件,针对大规模、分布式和延迟受限的系统。我们的方法提供了一个软件层,它可以平衡多个标准发布/订阅服务器(可以部署在云中)上大量发布者、订阅者和消息所产生的负载。为了优化云基础设施的使用,可以根据需要添加或删除发布/订阅服务器。平衡考虑到每个通道的实时特性,并以跨通道(宏观)和单个通道(微观)的分层方式进行,以便在高度变化的条件下保持可接受的性能和低延迟。负载监视以一种非侵入性的方式执行,而重新平衡采用一种惰性方法,以便在确保成功和及时地传递所有消息的同时,最大限度地减少其对性能的临时影响。大量的现实世界实验说明了该方法在大型多人游戏设置中的实用性。结果表明,对于给定数量的服务器,Dynamoth能够比一致散列方法多处理60%的同时客户机,并且能够在大工作负载上下文中正确地处理高度变化的条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FLOWPROPHET: Generic and Accurate Traffic Prediction for Data-Parallel Cluster Computing Improving the Energy Benefit for 802.3az Using Dynamic Coalescing Techniques Systematic Mining of Associated Server Herds for Malware Campaign Discovery Rain Bar: Robust Application-Driven Visual Communication Using Color Barcodes Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1