A note on leader election in directed split-stars and directed alternating group graphs

文化大學機構典藏 CCUR > 商學院 > 資訊管理學系暨資訊管理研究所 > 期刊論文 > Item 987654321/21096

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/21096

题名:	A note on leader election in directed split-stars and directed alternating group graphs
作者:	Wang, FH (Wang, Fu-Hsing)
贡献者:	資管系
关键词:	leader election problem anonymous networks split-stars alternating group graphs self-stabilizing algorithms
日期:	2010
上传时间:	2011-12-15 13:53:40 (UTC+8)
摘要:	A leader node is defined to be any node of the network unambiguously identified by some characteristics. In this paper, we first present a distributed algorithm for finding a leader node of a directed split-star. Moreover, an efficient self-stabilizing leader election algorithm that converges with linear rounds is proposed for directed split-stars. Actually, the distributed algorithm and the self-stabilizing algorithm are also applicable to the problem of directed alternating group graphs. As far as we know, no self-stabilizing leader election algorithm was known for the two graphs.
显示于类别:	[資訊管理學系暨資訊管理研究所 ] 期刊論文

文件中的档案:

没有与此文件相关的档案.

在CCUR中所有的数据项都受到原著作权保护.