A new node-join-tree distributed algorithm for minimum weight spanning trees

Y. Lien
{"title":"A new node-join-tree distributed algorithm for minimum weight spanning trees","authors":"Y. Lien","doi":"10.1109/DCS.1988.12534","DOIUrl":null,"url":null,"abstract":"A distributed algorithm that uses a node-join-tree approach for the minimum-spanning-tree problem in a communication network is developed. The algorithm needs at most (2e+n(n-1)/4) messages in O(n/sup 2/) time on a general random graph. In the best case, it needs only 2e messages in O(log n) time. The parameters e and n are the number of edges and nodes, respectively. Although the worst-case performance is not better than that of tree-join-tree algorithms under some extreme cases, simulation results show that it provides better performance in most cases. The algorithm is initialized from a single node, so that there is no need to wake up all nodes at the beginning. It is less complicated than other algorithms, so that a reliable implementation is easier to achieve. The results can be used to improve the algorithms for many other problems in distributed computing, such as leader-election, node-counting, deadlock-resolution, and message-broadcasting.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. The 8th International Conference on Distributed","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCS.1988.12534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

A distributed algorithm that uses a node-join-tree approach for the minimum-spanning-tree problem in a communication network is developed. The algorithm needs at most (2e+n(n-1)/4) messages in O(n/sup 2/) time on a general random graph. In the best case, it needs only 2e messages in O(log n) time. The parameters e and n are the number of edges and nodes, respectively. Although the worst-case performance is not better than that of tree-join-tree algorithms under some extreme cases, simulation results show that it provides better performance in most cases. The algorithm is initialized from a single node, so that there is no need to wake up all nodes at the beginning. It is less complicated than other algorithms, so that a reliable implementation is easier to achieve. The results can be used to improve the algorithms for many other problems in distributed computing, such as leader-election, node-counting, deadlock-resolution, and message-broadcasting.<>
最小权值生成树的节点连接树分布式算法
提出了一种采用节点连接树方法求解通信网络最小生成树问题的分布式算法。对于一般随机图,该算法在O(n/sup 2/)时间内最多需要(2e+n(n-1)/4)条消息。在最好的情况下,它在O(log n)时间内只需要2e条消息。参数e和n分别是边的个数和节点的个数。虽然在一些极端情况下,最坏情况下的性能并不优于树-连接树算法,但仿真结果表明,在大多数情况下,它的性能更好。该算法从单个节点初始化,因此不需要在开始时唤醒所有节点。它比其他算法更简单,因此更容易实现可靠的实现。研究结果可用于改进分布式计算中许多其他问题的算法,如leader选举、节点计数、死锁解析和消息广播。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书