English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Leader election is one of the fundamental problems in distributed computing. It calls for all nodes of a network to agree on a single node, called the leader. If the nodes of the network have distinct labels, then agreeing on a single node means that all nodes have to output the label of the elected leader. If the nodes of the network are anonymous, the task of leader election is formulated as follows: every node v of the network must output a simple path, which is coded as a sequence of port numbers, such that all these paths end at a common node, the leader. In this article, we study deterministic leader election in anonymous trees. Our aim is to establish tradeoffs between the allocated time tau and the amount of information that has to be given a priori to the nodes to enable leader election in time tau in all trees for which leader election in this time is at all possible. Following the framework of algorithms with advice, this information (a single binary string) is provided to all nodes at the start by an oracle knowing the entire tree. The length of this string is called the size of advice. For a given time tau allocated to leader election, we give upper and lower bounds on the minimum size of advice sufficient to perform leader election in time tau. For most values of t, our upper and lower bounds are either tight up to multiplicative constants, or they differ only by a logarithmic factor. Let T be an n-node tree of diameter diam <= D. While leader election in time diam can be performed without any advice, for time diam-1 we give tight upper and lower bounds of Theta(log D). For time diam-2 we give tight upper and lower bounds of Theta(log D) for even values of diam, and tight upper and lower bounds of (log n) for odd values of diam. Moving to shorter time, in the interval [beta . diam, diam-3] for constant beta > 1/2, we prove an upper bound of O(n log n/D) and a lower bound of Omega(n/D), the latter being valid whenever diamis odd or when the time is at most diam-4. Hence, with the exception of the special case when diamis even and time is exactly diam-3, our bounds leave only a logarithmic gap in this time interval. Finally, for time alpha . diam for any constant alpha < 1/2 (except for the case of very small diameters), we again give tight upper and lower bounds, this time Theta(n).

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees