A maximum degree self-stabilizing spanning tree algorithm

Basit Öğe Kaydı
dc.contributor.authorCokuslu D.
dc.contributor.authorErciyes K.
dc.contributor.authorHameurlain A.
dc.date.accessioned2019-10-26T22:28:32Z
dc.date.available2019-10-26T22:28:32Z
dc.date.issued2010
dc.departmentEge Üniversitesien_US
dc.description25th International Symposium on Computer and Information Sciences, ISCIS 2010 -- 22 September 2010 through 24 September 2010 -- London -- 82255en_US
dc.description.abstractSpanning 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.en_US
dc.identifier.doi10.1007/978-90-481-9794-1_73
dc.identifier.endpage396en_US
dc.identifier.isbn9789048197934
dc.identifier.issn1876-1100
dc.identifier.issn1876-1100en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage393en_US
dc.identifier.urihttps://doi.org/10.1007/978-90-481-9794-1_73
dc.identifier.urihttps://hdl.handle.net/11454/19649
dc.identifier.volume62 LNEEen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofLecture Notes in Electrical Engineeringen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.titleA maximum degree self-stabilizing spanning tree algorithmen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu