A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We present a uniform self-stabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. ... The first stage is a uniform randomized stabilizing unique naming protocol, and the second stage is a stabilizing MDST protocol, designed as a fair composition of Merlin--Segall's stabilizing protocol ... In this setting, we exhibit a self-stabilizing minimum diameter spanning tree. ...arXiv:1312.3303v1 fatcat:p2pnqs4yvzcchfojji72igryoy
Lecture Notes in Computer Science
We present a uniform self-stabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. ... In summary, self-stabilization is a very strong faulttolerance property which covers many types of faults and provides a uniform approach to the design of a variety of fault-tolerant algorithms. ... In this setting, we exhibit a self-stabilizing minimum diameter spanning tree. ...doi:10.1007/bfb0022152 fatcat:eazxlubfvnhsjds4gjqqaqimqe
Melliar-Smith, Total ordering algorithms for asynchronous Byzantine systems (242- 256); Franck Butelle, Christian Lavault and Marc Bui, A uni- form self-stabilizing minimum diameter spanning tree algorithm ... , Deterministic, constant space, self-stabilizing leader election on uniform rings (288-302); Craig M. ...
) (214-225); Gene Itkis and Leonid Levin, Fast and lean self-stabilizing asynchronous protocols (226-239). ... set of evolutionary trees—metrics and efficient algorithms (758-769); Martin Farach and Mikkel Thorup, Optimal evolutionary tree comparison by sparse dynamic programming (extended abstract) (770-779); ...
hypercubes (493-508 (electronic) ); James Abello and Shlomi Dolev, On the computational power of self-stabilizing systems (extended abstract) (585-603 (electronic) ); Kadir Ozdemir and Hasan Ural, Deadlock ... Lee, An algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons (162-177 (elec- tronic)). K. E. Flannery, H. K. Dai and T. O’Neil [Thomas E. ...
A randomized self-stabilizing mutual exclusion algorithm in a uniform (directed) networks is presented in  . ... A self-stabilizing algorithm for leader election and generic tree construction in a strongly connected directed network is presented in  . ... Self-stabilizing Multicast in a Ring Algorithm, code for p i Tree Algorithm: The second approach we present is based on a distributed tree structure defined by the update algorithm, and then the self-stabilizing ...doi:10.1007/s00236-004-0143-1 fatcat:kdv66wyh6jhyfp5v6sszrh5prq
We present the first fully polynomial stabilizing algorithm constructing a BFS tree under a distributed daemon. ... A fully polynomial algorithm has a round complexity in O(d a ) and a step complexity in O(n b ) where d and n are the diameter and the number of nodes of the network and a and b are constants. ... There are many different spanning tree construction problems guaranteeing various properties, e.g., a spanning tree of minimum weight or a spanning tree of minimum diameter. ...doi:10.1016/j.ic.2019.01.005 fatcat:erlby2otfffgpdo5af7rofta3q
Lecture Notes in Computer Science
An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration. ... In this thesis, three silent self-stabilizing asynchronous distributed algorithms are given for the leader election problem in a dynamic network with unique IDs, using the composite model of computation ... In , we gave a uniform self-sabilizing leader election algorithm. This algorithm works under an arbitrary, i.e., unfair scheduler (daemon). ...doi:10.1007/978-3-642-16023-3_6 fatcat:uau4uw6drfde5p4m4ve6gmivky
We present GS 3 , a distributed algorithm for scalable self-configuration and self-healing in multi-hop wireless sensor networks. ... The algorithm enables network nodes in a 2D plane to configure themselves into a cellular hexagonal structure where cells have tightly bounded geographic radius and the overlap between neighboring cells ...  proposes self-stabilizing algorithms for tree maintenance that is local in space but not local in time. The self-stabilization in GS 3 is local both in time and in space. ...doi:10.1016/s1389-1286(03)00354-2 fatcat:nvnw4kx5qbaodpvfqwqckjystu
random minimum spanning tree problem Frieze, A.M., see M.E. ... Culik II, On extendibility of unavoidable sets Chu, Y.-C., An extended result of Kleitman and Saks concer- ning binary trees Chvatal, V., see J. ... Camerini Mansfield, A., An algorithm for a merge recognition problem 6 (1983) 99-102 7 (1984) 55-64 5 (1983) 39-50 4 (1982) 193-197 Mansfield, A., On the computational complexity of a merge recognition ...doi:10.1016/0166-218x(85)90002-2 fatcat:2w5rkebeyzcyjgimnpqtw7zq2a
), or on data structures distributed over the nodes (e.g. a spanning tree). ... We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called verifier that is in charge of verifying the distributed ... In fact,  even describe an entire (non-silent) self-stabilizing algorithm for MST construction based on this mechanism for verifying MST. ...doi:10.4230/lipics.disc.2018.24 dblp:conf/wdag/FeuilloleyFHPP18 fatcat:sd6vm5nzkbc3vbvm23spsz7w3y
First, our algorithm is self-stabilizing, so that it recovers correct behavior after finite time starting from an arbitrary global state caused by a transient fault. ... We present a generic distributed algorithm for solving silents tasks such as shortest path calculus, depth-first-search tree construction, best reliable transmitters, in directed networks where communication ... For instance, when the local algorithms are parameterized by the minc r-operator, the system stabilizes to a minimum distance tree when all the node are initialized with e minc = +∞ except one (the root ...doi:10.2514/1.19848 fatcat:skcsutdabbgw7feiprnnqxthoi
Lecture Notes in Computer Science
First, our algorithm is self-stabilizing, so that it recovers correct behavior after finite time starting from an arbitrary global state caused by a transient fault. ... We present a generic distributed algorithm for solving silents tasks such as shortest path calculus, depth-first-search tree construction, best reliable transmitters, in directed networks where communication ... For instance, when the local algorithms are parameterized by the minc r-operator, the system stabilizes to a minimum distance tree when all the node are initialized with e minc = +∞ except one (the root ...doi:10.1007/11577327_5 fatcat:ozlx3isaqfhwngvghvot3dscna
The manufacturability system uses triangle-based mesh processing algorithms to recognize features and check the guidelines necessary for LCM. ... Additive Manufacturing (AM) evolved recently from a rapid prototyping process to a standard manufacturing tool. ... For the application of the algorithms under usage of the k-d tree data structure, the tree must be traversed. ...doi:10.1109/ojies.2021.3061610 fatcat:7appqjw2abd53dfaretrsuqqke
In this paper we present self-stabilizing protocols for mutual-exclusion and for constructing a spanning tree. ... Three self-stabilizing protocols for distributed systems in the shared m e m o r y m o d e l are presented. The first p r o t o c o l is a mutual-exclusion protocol for tree structured systems. ... We present two semi-uniform, self-stabilizing protocols: The first protocol is a mutual-exclusion protocol for tree structured systems. ...doi:10.1007/bf02278851 fatcat:4n4ftlkjcfh6ta7zuxhqtzyhp4
« Previous Showing results 1 — 15 out of 4,281 results