A study of broadcasting over structured overlay

Saiful Khan, A. Gani, S. Raviraja, Shashikantha
{"title":"A study of broadcasting over structured overlay","authors":"Saiful Khan, A. Gani, S. Raviraja, Shashikantha","doi":"10.1109/COMSNETS.2015.7098667","DOIUrl":null,"url":null,"abstract":"An efficient and scalable broadcast are two essential features of structured overlay networks which used in large scale distributed computing systems and in peer-to-peer networks. The existing broadcast based algorithms over the structured overlays experience certain issues due to a decentralised nature of such networks in which nodes join and leave the network dynamically. This causes poor routing efficiency and high maintenance bandwidth overhead. In this paper, we study routing efficiency and maintenance bandwidth overhead while broadcasting messages over the structured overlay networks in dynamic environment. We also propose an improved message broadcasting algorithm over the structured overlay networks. The simulation results show that although there is a trade off between routing efficiency and maintenance bandwidth, with optimisation we can improve one without severely effecting the other parameter.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2015.7098667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An efficient and scalable broadcast are two essential features of structured overlay networks which used in large scale distributed computing systems and in peer-to-peer networks. The existing broadcast based algorithms over the structured overlays experience certain issues due to a decentralised nature of such networks in which nodes join and leave the network dynamically. This causes poor routing efficiency and high maintenance bandwidth overhead. In this paper, we study routing efficiency and maintenance bandwidth overhead while broadcasting messages over the structured overlay networks in dynamic environment. We also propose an improved message broadcasting algorithm over the structured overlay networks. The simulation results show that although there is a trade off between routing efficiency and maintenance bandwidth, with optimisation we can improve one without severely effecting the other parameter.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结构化覆盖广播的研究
高效和可扩展的广播是用于大规模分布式计算系统和点对点网络的结构化覆盖网络的两个基本特征。现有的基于广播的算法在结构化覆盖上遇到了某些问题,这是由于这种网络的分散性,其中节点动态加入和离开网络。这会导致路由效率低,维护带宽开销高。本文研究了动态环境下结构化覆盖网络广播时的路由效率和维护带宽开销。我们还提出了一种改进的结构化覆盖网络的消息广播算法。仿真结果表明,虽然路由效率和维护带宽之间存在权衡,但通过优化,我们可以在不严重影响其他参数的情况下提高其中一个参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GSM-based positioning for public transportation commuters Passing the torch: Role alternation for fair energy usage in D2D group communication Performance analysis of parameters affecting power efficiency in networks BlinkToSCoAP: An end-to-end security framework for the Internet of Things Contextual sensitivity of the ambient temperature sensor in Smartphones
×
引用
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