Interacting Urns Processes for Clustering of Large-Scale Networks of Tiny Artifacts

Leone, Pierre; Schiller, Elad Michael

doi:10.1155/2010/936195

Cited by 2 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More generally, in the context of self-stabilization there are algorithms for group communications [19][20][21], consensus in shared-memory systems [18], wireless communications [27,29,30,[37][38][39][40], software defined networks [8,9], virtual infrastructure for mobile nodes [16,17,45], to name a few.…”

Section: Self-stabilizing Solutionsmentioning

confidence: 99%

See 1 more Smart Citation

Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems

Lundström¹,

Raynal²,

Schiller³

2021

Preprint

View full text Add to dashboard Cite

The problem of multivalued consensus is fundamental in the area of fault-tolerant distributed computing since it abstracts a very broad set of agreement problems in which processes have to uniformly decide on a specific value v ∈ V , where |V | ≥ 2. Existing solutions (that tolerate process failures) reduce the multivalued consensus problem to the one of binary consensus, e.g., Mostéfaoui-Raynal-Tronel and Zhang-Chen.Our study aims at the design of an even more reliable solution. We do so through the lenses of self-stabilization-a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient-faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact).This work proposes the first (to the best of our knowledge) self-stabilizing algorithm for multivalued consensus for asynchronous message-passing systems prone to process failures and arbitrary transient-faults. Our solution is also the first (to the best of our knowledge) to support wait-freedom. Moreover, using piggybacking techniques, our solution can invoke n binary consensus objects concurrently. Thus, the proposed self-stabilizing solution can terminate using fewer binary consensus objects than earlier non-self-stabilizing solutions by Mostéfaoui, Raynal, and Tronel, which uses an unbounded number of binary consensus objects, or Zhang and Chen, which is not wait-free.

show abstract

Section: Self-stabilizing Solutionsmentioning

confidence: 99%

“…This invocation changes p i 's state, such that O i .BC[k+1] = ⊥ does not hold any longer (because the binPropose i () operation initializes the state of O i .BC[k+1]). Since BC[] has n entries, there could be at most n such invocations until the system reaches c ∈ R, after which the if-statement condition in line 30…”

Section: Claim 63mentioning

confidence: 99%

Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems

Lundström¹,

Raynal²,

Schiller³

2021

Preprint

View full text Add to dashboard Cite

show abstract

Geographic routing on Virtual Raw Anchor Coordinate systems

Leone

Samarasinghe

2016

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

In this paper we present a novel combinatorial approach for geographic routing with delivery guarantees. Proposed algorithm can be seen as a variant of GFG (Greedy Face Greedy of Bose et.al) algorithm, but based on combinatorial properties derived in the Virtual Raw Anchor Coordinate system, which is the localization scheme of interest. We utilize a local planarization algorithm of a geometric graph, which is based on the Schnyder's characterization of planar graphs. The new approach is combinatorial in the sense that the nodes are ordered with respect to three distinct order relations satisfying suitable properties. The coordinate system that motivated the development of this routing algorithm is VRAC (Virtual Raw Anchor Coordinates), which localizes the nodes with the raw distances from three fixed anchors. Since the positions of the anchors are not known, the VRAC coordinate system does not correspond to the Euclidean location of nodes, yet leaving sufficient information to define necessary combinatorial constructs for routing with guaranteed delivery. In particular, the routing algorithm avoids the references to geographical arguments and makes use only of the order relations on the nodes. We expect that our approach will foster further research on building efficient order relations, that will prove to be useful in practical implementation of geographic routing algorithms. In particular, we expect that further work will prove that the combinatorial approach for geographic routing, based on a raw anchor based positioning system is more robust in the presence of distance measurement errors.

show abstract

Interacting Urns Processes for Clustering of Large-Scale Networks of Tiny Artifacts

Cited by 2 publications

References 32 publications

Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems

Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems

Geographic routing on Virtual Raw Anchor Coordinate systems

Contact Info

Product

Resources

About