Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"Leader Election"”.
-
Churn-tolerant leader election on weakly-consistent membership
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms
-
Leader election and renaming with optimal message complexity
… obstacles for designing efficient algorithms. Leader election (test-and-set) and renaming are two fundamental distributed tasks. We prove that both tasks can be solved using expected O(n²) messages -- the same asymptotic complexity as a single all-to-all broadcast -- and that this message …
-
Leader election and group management in vehicular ad hoc network
Made available in DSpace on 2016-07-07T20:27:57Z (GMT). No. of bitstreams: 2 NIE-THESIS-2016.pdf: 1423126 bytes, checksum: 93ad7bcfef8608a58f8dfd0c5d6f82c3 (MD5) LICENSE.txt: 4207 bytes, checksum: f4eaba5199e45c1f013bfc9ca795a447 (MD5) Previous issue date: 2016-04-26
-
Properties of link reversal algorithms for routing and leader election
… in routing protocols and algorithms for solving leader election and mutual exclusion. While proofs exist to establish the acyclicity property of PR, they rely on assigning labels to either the nodes or the edges in the graph. In this work we present simpler direct proof of the acyclicity property …
-
The loudest one wins : efficient communication in theoretical wireless networks
… limitations. To this end, we study the leader election and broadcast problems in wireless networks, modeling them using the Signal-to- Interference-plus-Noise-Ratio (SINR) model. Our main result is an algorithm that solves the leader election problem in two communication rounds using …
-
On the complexity of synchronization
… solving synchronization tasks, such as leader election and consensus. We make contributions towards a better understanding of the complexity of central tasks in standard distributed models. In the population protocols model, we demonstrate how to solve majority and leader election …
-
Dynamic Control Structures for Cooperating Processes (Elections, Deadlock Detection, Decentralized, Agreement)
… achieve different performance, careful selection of the control structure is important if high performance is to be maintained. Moreover, as processor load, traffic density, or other system parameters vary, the control structure should be reassessed, and if necessary a new one adopted. …
-
Automatic code generation: from process algebraic architectural descriptions to multithreaded java programs
… repainting system and the implementation of a leader election algorithm, in order to summarize the whole approach. The outcome of this thesis is the implementation of the proposed approach in a translator called PADL2Java and its integration in the architecture-centric verification tool …
-
The effects of uncertainty and penalty on cooperative behavior in a resource dilemma
… mean group harvest, whether members elected a leader who would harvest for the group instead of harvesting for themselves, and mean absolute deviation among members' harvests. Results showed that subjects harvested less when uncertainty was high, a finding opposite to the results of previous …
-
Assessing Log-Based Coordination Systems for Managed Cloud Environments
… subset of coordination features, including leader election, membership tracking, and ephemeral state management. The same is noted for migration from an existing ZooKeeper-based application to this work's library, requiring minimal design changes while preserving coordination guarantees. …
-
Distributed synchronizers in network simulator (Ns) software
… implement them by considering two applications: leader election and breadth-first search algorithms. The algorithms are implemented on arbitrary networks. We compare the algorithms in terms of communication complexity. We also discuss the suitability of NS as a platform to implement synchronous …
-
Parameterised verification of randomised distributed systems using state-based models
… this via case studies: two randomised leader election protocols. We illustrate how induction can also be employed to prove properties of semi-degenerative systems by considering a simple gossip protocol.
-
Secure, Efficient and Privacy-aware Framework for Unstructured Peer-to-Peer Networks
… Service Centres are allocated using a novel leader election mechanism within unstructured scalable P2P networks. This allows providing fair and equitable access for existing and new nodes without having to make complex changes to the network topology. Moreover, the scale-free and clustering …
-
To mirror or not to mirror : modeling relationships in social trading
… investment strategies [5] However, few studied leader election, individual adaptation, and social dynamics in the financial market. This lack of research is mostly due to a lack of centralized research entities to implement large-scale experiments. Luckily, a new investment mechanism, social …
-
Survivability Against Intelligent Adversary in Next-Generation Wireless Networks
… decentralized, and another hybrid solution with leader election. In this battle for coexistence, the broadcasting and open nature of transmission leaves a CRN open to jamming based Denial of Service (DoS) attacks. Since SUs use different channels for communication and attacker is also capable of …
-
New consistency orchestrators for emerging distributed systems
… a consistent view of the failed nodes, leader election, consistent primary replica selection, coherence in smart home's current state, etc. Orchestrators are dedicated entities that use specialized protocols (e.g., Chubby, ZooKeeper etc.) to help coordinate the components. Distributed …
-
Trustworthy and Efficient Blockchain-based E-commerce Model
… The modifications primarily target the leader election process and the communication protocols between leader and follower nodes within the PBFT consensus framework. In the domain of tangible assets, our primary objective is to elevate trust among various stakeholders and bolster the …
-
An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks
The pace of mobile networking is rapidly changing. Each year, waves of new smartphones, tablets, netbooks, and laptops are being released to consumers and subsequently being adopted in greater numbers than ever before. The e ect is a much denser environment, rich with mobile devices able to keep …