754 Hits in 5.4 sec

A leader election algorithm for dynamic networks with causal clocks

Rebecca Ingram, Tsvetomira Radeva, Patrick Shields, Saira Viqar, Jennifer E. Walter, Jennifer L. Welch
2013 Distributed computing  
An algorithm for electing a leader in an asynchronous network with dynamically changing communication topology is presented.  ...  Thus there is a need for leader election algorithms that work in dynamic networks.  ...  Acknowledgements We thank Bernadette Charron-Bost, Antoine Gaillard, Nick Neumann, Lyn Pierce, Srikanth Sastry and Josef Widder for helpful conversations, and the anonymous reviewers for comments that  ... 
doi:10.1007/s00446-013-0184-1 fatcat:ck7gj5utx5ax5hlbop3v7cx6my

PALE: Partially Asynchronous Agile Leader Election [article]

Bronislav Sidik, Rami Puzis, Polina Zilberman, Yuval Elovici
2018 arXiv   pre-print
Thus, state-of-the-art leader election algorithms are not applicable in asynchronous environments with constant network changes.  ...  Many tasks executed in dynamic distributed systems, such as sensor networks or enterprise environments with bring-your-own-device policy, require central coordination by a leader node.  ...  RELATED WORK Numerous algorithms exist in the literature for distributed leader election in static, as well as dynamic networks, with different settings [6] .  ... 
arXiv:1801.03734v1 fatcat:nmjwl5uynnb6va4zdmrhlfo75e

Session Guarantees with Raft and Hybrid Logical Clocks [article]

Mohammad Roohitavaf, Jung-Sang Ahn, Woon-Hak Kang, Kun Ren, Gene Zhang, Sami Ben-Romdhane, Sandeep S. Kulkarni
2018 arXiv   pre-print
In this paper, we provide a protocol for providing session guarantees for NuKV, a key-value store developed for services with very high availability and performance requirements at eBay.  ...  We also use Hybrid Logical Clocks to eliminate the need for delaying write operations to satisfy session guarantees.  ...  After electing a leader, the leader has the complete responsibility for managing the log.  ... 
arXiv:1808.05698v1 fatcat:dqakm3ey2fecdf4ntyuwzzs2le

Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks [article]

Martin Biely and Peter Robinson and Ulrich Schmid and Manfred Schwarz and Kyrill Winkler
2015 arXiv   pre-print
We present a consensus algorithm that works correctly under a VSRC(1, 4H + 2) message adversary, where $H$ is the dynamic causal network diameter.  ...  run: Our algorithm guarantees at most $k$ decision values under a VSRC(n, d) + MAJINF(k) message adversary, which combines VSRC(n, d) (for some small $d$, ensuring termination) with some information flow  ...  [32] presented an asynchronous leader election algorithm for dynamic systems, where every component is guaranteed to elect a leader of its own.  ... 
arXiv:1501.02716v1 fatcat:vlghe6juuva6pmjgpcpzq5pzsu

Time Synchronization in Wireless Sensor Networks Using Max and Average Consensus Protocol

Zhao Dengchang, An Zhulin, Xu Yongjun
2013 International Journal of Distributed Sensor Networks  
This paper proposes a novel distributed time synchronization scheme for wireless sensor networks, which uses max consensus to compensate for clock drift and average consensus to compensate for clock offset  ...  Through several simulations, we can see that this protocol can reduce clock error to ±10 ticks, adapt to dynamic topology, and be suitable to large-scale applications.  ...  Section 4 introduces a model for the clock dynamics and formally defines the synchronization objectives, while Section 5 presents the TSMA algorithm in details.  ... 
doi:10.1155/2013/192128 fatcat:jeieh7ut4jfsbgrwkgtobrmwja

Distributed computation in dynamic networks

Fabian Kuhn, Nancy Lynch, Rotem Oshman
2010 Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10  
The T-interval connected dynamic graph model is a novel model, which we believe opens new avenues for research in the theory of distributed computing in wireless, mobile and dynamic networks.  ...  In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round.  ...  A k-COMMITTEE PROTOCOL FOR 1-INTERVAL CONNECTED GRAPHS To solve k-committee election in 1-interval connected graphs, we imagine that there is a unique leader in the network, and this leader invites k nodes  ... 
doi:10.1145/1806689.1806760 dblp:conf/stoc/KuhnLO10 fatcat:hqueuflenzhpbpq7izprbq3gku

Best Paper: Stabilizing Clock Synchronization for Wireless Sensor Networks [chapter]

Ted Herman, Chen Zhang
2006 Lecture Notes in Computer Science  
One of the simplest protocols for clock synchronization in wireless ad hoc and sensor networks is the converge-to-max protocol, which has the simple logic of adjusting each node's clock to be at least  ...  This paper examines the converge-to-max protocol, showing it to be stabilizing even when node clocks have skew, bounded domains, and dynamic communication links.  ...  Within multihop wireless sensor networks, a fault tolerant (and conceptually self-stabilizing) protocol is to elect one node, say the node with smallest identifier, to be the leader and construct a spanning  ... 
doi:10.1007/978-3-540-49823-0_24 fatcat:wm3wy7jtdfaxjpgbrleeywweia

Clock synchronization for wireless sensor networks: a survey

Bharath Sundararaman, Ugo Buy, Ajay D. Kshemkalyani
2005 Ad hoc networks  
This paper surveys and evaluates existing clock synchronization protocols based on a palette of factors like precision, accuracy, cost, and complexity.  ...  In such networks, data from each sensor is agglomerated using data fusion to form a single meaningful result, which makes time synchronization between sensors highly desirable.  ...  Hence, the protocols used for such networks, whether stationary or dynamic, must ensure selfconfiguration (by use of suitable neighborhood definition or leader election protocols) to achieve synchronization  ... 
doi:10.1016/j.adhoc.2005.01.002 fatcat:mjbs7x7aijc6vnmmrf5773ic4u

System support for partition-aware network applications

Özalp Babaoğlu, Renzo Davoli, Alberto Montresor, Roberto Segala
1998 ACM SIGOPS Operating Systems Review  
We propose a system layer consisting of group membership and reliable multicast services that provides systematic support for partition-aware application development.  ...  Network applications and services need to be environment-aware in order to meet non-functional requirements in increasingly dynamic contexts.  ...  Then, each worker p elects a leader c among the set of all workers that know a superset of the results known to p itself.  ... 
doi:10.1145/280559.280567 fatcat:7d2tdza6vfh3hkmgoizuxvhtue

Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks [chapter]

Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
2015 Lecture Notes in Computer Science  
We present a consensus algorithm that works correctly under a VSSC(1, 4E + 2) message adversary, where E is the dynamic network depth.  ...  , our results provide a significant step towards the exact solvability/impossibility border of general k-set agreement in directed dynamic networks.  ...  [49] presented an asynchronous leader election algorithm for dynamic systems, where every component is guaranteed to elect a leader of its own.  ... 
doi:10.1007/978-3-319-26850-7_8 fatcat:ri6g3li7xfempfcd4kb45f2zda

Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks [article]

Christian Boulinier
2007 arXiv   pre-print
From the Angluin impossibility results, we cannot elect a leader in a general anonymous network. Thus, it is impossible to build a rooted spanning tree.  ...  How to pass from local to global scales in anonymous networks? How to organize a selfstabilizing propagation of information with feedback.  ...  In particular, we do not assume a unique process identifier -the network is anonymous -or some consistent orientation of links in the network such that any dynamic election of a master clock can be feasible  ... 
arXiv:0706.4298v1 fatcat:xwvvru26pzguvcwly6darou26a

Reliable Content Distribution in P2P Networks Based on Peer Groups

Elias P. Duarte Jr., Ana Flavia B. Godoi
2014 International Journal of Internet and Distributed Systems  
Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet.  ...  In this work we present a strategy based on group communication for transparent and robust content access in P2P networks.  ...  This abstraction consists of a group management service and a distributed leader election module that designates the server for each request.  ... 
doi:10.4236/ijids.2014.22002 fatcat:3fze36jkfzcfpep2fhd7e5cyfq

DEXON: A Highly Scalable, Decentralized DAG-Based Consensus Algorithm [article]

Tai-Yuan Chen and Wei-Ning Huang and Po-Chun Kuo and Hao Chung and Tzu-Wei Chao
2018 arXiv   pre-print
First, we present a highly scalable sharding framework for blockchain.  ...  This framework takes an arbitrary number of single chains and transforms them into the blocklattice data structure, enabling high scalability and low transaction confirmation latency with asymptotically  ...  For the leader election, each node q ∈ S notary computes the signature σ q = Sig skq (status) with its secret key sk q .  ... 
arXiv:1811.07525v1 fatcat:vqnukg25prfi7pxodw5elrdi7u

Time Synchronization in Wireless Sensor Networks [chapter]

Jonggoo Bae, Bongkyo Moo
2010 Smart Wireless Sensor Networks  
The root of the network, a dynamically elected single node, maintains the global time and all other nodes synchronize their clocks to that of the root.  ...  Some of the nodes, upon receiving the message, become masters by using a leader election procedure.  ... 
doi:10.5772/13869 fatcat:k3dvfoy4ardwplrkir3426uusa

Cloudburst: Stateful Functions-as-a-Service [article]

Vikram Sreekanti, Chenggang Wu, Xiayue Charles Lin, Johann Schleier-Smith, Jose M. Faleiro, Joseph E. Gonzalez, Joseph M. Hellerstein, Alexey Tumanov
2020 arXiv   pre-print
Cloudburst accomplishes this by leveraging Anna, an autoscaling key-value store, for state sharing and overlay routing combined with mutable caches co-located with function executors for data locality.  ...  We argue that the benefits of serverless computing can be extended to a broader range of applications and algorithms.  ...  ] or leader election [7] .  ... 
arXiv:2001.04592v2 fatcat:txil6f7nprcezlmc45qscw7voe
« Previous Showing results 1 — 15 out of 754 results