Please use this identifier to cite or link to this item:
Title: A maximum degree self-stabilizing spanning tree algorithm
Authors: Çokuslu, Deniz
Erciyeş, Kayhan
Hameurlain, Abdelkader
Keywords: Tree diameter
Distributed environments
Root nodes
Parallel architectures
Spanning tree algorithms
Issue Date: 2010
Publisher: Springer Verlag
Source: Çokuslu, D., Erciyeş, K., and Hameurlain, A. (2010). A maximum degree self-stabilizing spanning tree algorithm. Lecture Notes in Electrical Engineering, 62 LNEE, 393-396. doi:10.1007/978-90-481-9794-1_73
Abstract: Spanning trees are fundamental topological structures in distributed environments which ease many applications that require frequent communication between nodes. In this paper, we examine and compare two spanning tree construction algorithms which rely on classical and self stabilization approach. Then, we propose a new self-stabilizing spanning tree construction algorithm which uses maximum degree heuristic while choosing the root node. We show experimentally that our new algorithm provides smaller tree diameters than the two existing approaches with favorable run-times. © 2011 Springer Science+Business Media B.V.
Description: 25th International Symposium on Computer and Information Sciences, ISCIS 2010; London; United Kingdom; 22 September 2010 through 24 September 2010
ISSN: 1876-1100
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection

Files in This Item:
File Description SizeFormat 
2621.pdfConference Paper274.4 kBAdobe PDFThumbnail
Show full item record

CORE Recommender


checked on Mar 25, 2023

Page view(s)

checked on Mar 20, 2023


checked on Mar 20, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.