覆盖网络中多生成树选择广播

IF 0.7 4区计算机科学 Q3 Engineering IEICE Transactions on Communications Pub Date : 2023-01-01 DOI:10.1587/transcom.2022ebp3007

Takeshi Kaneko, Kazuyuki Shudo

{"title":"覆盖网络中多生成树选择广播","authors":"Takeshi Kaneko, Kazuyuki Shudo","doi":"10.1587/transcom.2022ebp3007","DOIUrl":null,"url":null,"abstract":"SUMMARY On an overlay network where a number of nodes work autonomously in a decentralized way, the eﬃciency of broadcasts has a signiﬁcant impact on the performance of distributed systems built on the network. While a broadcast method using a spanning tree produces a small numberofmessages,theroutingpathlengthsarepronetoberelativelylarge.Moreover,whenmultiplenodescanbesourcenodes,ineﬃcientbroadcasts oftenoccurbecausetheeﬃcienttreetopologydiﬀersforeachnode.Toaddressthisproblem,weproposeanovelprotocolinwhichasourcenode selectsaneﬃcienttreefrommultiplespanningtreeswhenbroadcasting.Ourmethodshortensroutingpathswhilemaintainingasmallnumberof messages.Weexaminedpathlengthsandthenumberofmessagesforbroadcastsonvarioustopologies.Asaresult,especiallyforarandom graph,ourproposedmethodshortenedpathlengthsbyapproximately28%comparedwithamethodusingaspanningtree,withalmostthesamenumber ofmessages.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"14 1","pages":"145-155"},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Broadcast with Tree Selection from Multiple Spanning Trees on an Overlay Network\",\"authors\":\"Takeshi Kaneko, Kazuyuki Shudo\",\"doi\":\"10.1587/transcom.2022ebp3007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SUMMARY On an overlay network where a number of nodes work autonomously in a decentralized way, the eﬃciency of broadcasts has a signiﬁcant impact on the performance of distributed systems built on the network. While a broadcast method using a spanning tree produces a small numberofmessages,theroutingpathlengthsarepronetoberelativelylarge.Moreover,whenmultiplenodescanbesourcenodes,ineﬃcientbroadcasts oftenoccurbecausetheeﬃcienttreetopologydiﬀersforeachnode.Toaddressthisproblem,weproposeanovelprotocolinwhichasourcenode selectsaneﬃcienttreefrommultiplespanningtreeswhenbroadcasting.Ourmethodshortensroutingpathswhilemaintainingasmallnumberof messages.Weexaminedpathlengthsandthenumberofmessagesforbroadcastsonvarioustopologies.Asaresult,especiallyforarandom graph,ourproposedmethodshortenedpathlengthsbyapproximately28%comparedwithamethodusingaspanningtree,withalmostthesamenumber ofmessages.\",\"PeriodicalId\":48825,\"journal\":{\"name\":\"IEICE Transactions on Communications\",\"volume\":\"14 1\",\"pages\":\"145-155\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEICE Transactions on Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1587/transcom.2022ebp3007\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEICE Transactions on Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1587/transcom.2022ebp3007","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}

引用次数: 0

摘要

在覆盖网络中，许多节点以分散的方式自主工作，广播的效率对建立在网络上的分布式系统的性能有重要影响。当使用生成树的广播方法产生少量消息时，路由路径长度往往相对较大。此外,whenmultiplenodescanbesourcenodes inefficientbroadcasts oftenoccurbecausetheefficienttreetopologydiffersforeachnode。Toaddressthisproblem, weproposeanovelprotocolinwhichasourcenode selectsanefficienttreefrommultiplespanningtreeswhenbroadcasting。Ourmethodshortensroutingpathswhilemaintainingasmallnumberof messages.Weexaminedpathlengthsandthenumberofmessagesforbroadcastsonvarioustopologies。结果表明，特别是对于随机图，我们所提出的方法与生成树方法相比，在消息数量几乎相同的情况下，缩短了大约28%的路径长度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Broadcast with Tree Selection from Multiple Spanning Trees on an Overlay Network

SUMMARY On an overlay network where a number of nodes work autonomously in a decentralized way, the eﬃciency of broadcasts has a signiﬁcant impact on the performance of distributed systems built on the network. While a broadcast method using a spanning tree produces a small numberofmessages,theroutingpathlengthsarepronetoberelativelylarge.Moreover,whenmultiplenodescanbesourcenodes,ineﬃcientbroadcasts oftenoccurbecausetheeﬃcienttreetopologydiﬀersforeachnode.Toaddressthisproblem,weproposeanovelprotocolinwhichasourcenode selectsaneﬃcienttreefrommultiplespanningtreeswhenbroadcasting.Ourmethodshortensroutingpathswhilemaintainingasmallnumberof messages.Weexaminedpathlengthsandthenumberofmessagesforbroadcastsonvarioustopologies.Asaresult,especiallyforarandom graph,ourproposedmethodshortenedpathlengthsbyapproximately28%comparedwithamethodusingaspanningtree,withalmostthesamenumber ofmessages.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

相关文献

二甲双胍通过HDAC6和FoxO3a转录调控肌肉生长抑制素诱导肌肉萎缩

IF 8.9 1区医学Journal of Cachexia, Sarcopenia and MusclePub Date : 2021-11-02 DOI: 10.1002/jcsm.12833

Min Ju Kang, Ji Wook Moon, Jung Ok Lee, Ji Hae Kim, Eun Jeong Jung, Su Jin Kim, Joo Yeon Oh, Sang Woo Wu, Pu Reum Lee, Sun Hwa Park, Hyeon Soo Kim

具有疾病敏感单倍型的非亲属供体脐带血移植后的1型糖尿病

IF 3.2 3区医学Journal of Diabetes InvestigationPub Date : 2022-11-02 DOI: 10.1111/jdi.13939

Kensuke Matsumoto, Taisuke Matsuyama, Ritsu Sumiyoshi, Matsuo Takuji, Tadashi Yamamoto, Ryosuke Shirasaki, Haruko Tashiro

封面:蛋白质组学分析确定IRSp53和fastin是PRV输出和直接细胞-细胞传播的关键

IF 3.4 4区生物学ProteomicsPub Date : 2019-12-02 DOI: 10.1002/pmic.201970201

Fei-Long Yu, Huan Miao, Jinjin Xia, Fan Jia, Huadong Wang, Fuqiang Xu, Lin Guo

来源期刊

IEICE Transactions on Communications ENGINEERING, ELECTRICAL & ELECTRONIC-TELECOMMUNICATIONS

CiteScore

1.50

自引率

28.60%

发文量

101

期刊介绍： The IEICE Transactions on Communications is an all-electronic journal published occasionally by the Institute of Electronics, Information and Communication Engineers (IEICE) and edited by the Communications Society in IEICE. The IEICE Transactions on Communications publishes original, peer-reviewed papers that embrace the entire field of communications, including: - Fundamental Theories for Communications - Energy in Electronics Communications - Transmission Systems and Transmission Equipment for Communications - Optical Fiber for Communications - Fiber-Optic Transmission for Communications - Network System - Network - Internet - Network Management/Operation - Antennas and Propagation - Electromagnetic Compatibility (EMC) - Wireless Communication Technologies - Terrestrial Wireless Communication/Broadcasting Technologies - Satellite Communications - Sensing - Navigation, Guidance and Control Systems - Space Utilization Systems for Communications - Multimedia Systems for Communication