A Maximum Degree Self-Stabilizing Spanning Tree Algorithm
| dc.contributor.author | Çokuslu, Deniz | |
| dc.contributor.author | Erciyeş, Kayhan | |
| dc.contributor.author | Hameurlain, Abdelkader | |
| dc.coverage.doi | 10.1007/978-90-481-9794-1_73 | |
| dc.coverage.doi | 10.1007/978-90-481-9794-1_73 | |
| dc.coverage.doi | 10.1007/978-90-481-9794-1_73 | |
| dc.date.accessioned | 2016-12-14T10:54:31Z | |
| dc.date.available | 2016-12-14T10:54:31Z | |
| dc.date.issued | 2010 | |
| dc.description | 25th International Symposium on Computer and Information Sciences, ISCIS 2010; London; United Kingdom; 22 September 2010 through 24 September 2010 | en_US |
| dc.description.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. | en_US |
| dc.identifier.citation | Ç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 | en_US |
| dc.identifier.doi | 10.1007/978-90-481-9794-1_73 | |
| dc.identifier.doi | 10.1007/978-90-481-9794-1_73 | en_US |
| dc.identifier.issn | 1876-1100 | |
| dc.identifier.issn | 9789048197934 | |
| dc.identifier.scopus | 2-s2.0-78651565361 | |
| dc.identifier.uri | http://doi.org/10.1007/978-90-481-9794-1_73 | |
| dc.identifier.uri | https://hdl.handle.net/11147/2621 | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer Verlag | en_US |
| dc.relation.ispartof | Lecture Notes in Electrical Engineering | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Tree diameter | en_US |
| dc.subject | Distributed environments | en_US |
| dc.subject | Root nodes | en_US |
| dc.subject | Parallel architectures | en_US |
| dc.subject | Spanning tree algorithms | en_US |
| dc.title | A Maximum Degree Self-Stabilizing Spanning Tree Algorithm | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Çokuslu, Deniz | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Computer Engineering | en_US |
| gdc.description.endpage | 396 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q4 | |
| gdc.description.startpage | 393 | en_US |
| gdc.description.volume | 62 LNEE | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W126410219 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.7286464E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Parallel architectures | |
| gdc.oaire.keywords | Tree diameter | |
| gdc.oaire.keywords | Root nodes | |
| gdc.oaire.keywords | Spanning tree algorithms | |
| gdc.oaire.keywords | Distributed environments | |
| gdc.oaire.popularity | 1.4350235E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 0.0 | |
| gdc.openalex.normalizedpercentile | 0.05 | |
| gdc.opencitations.count | 1 | |
| gdc.plumx.mendeley | 2 | |
| gdc.plumx.scopuscites | 2 | |
| gdc.scopus.citedcount | 2 | |
| relation.isAuthorOfPublication.latestForDiscovery | fbb306f8-ddf0-45db-8f73-d66feca793c2 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4014-8abe-a4dfe192da5e |