Time vs. Information Tradeoffs for Leader Election in Anonymous Trees

Author:

Glacet Christian1,Miller Avery2,Pelc Andrzej2

Affiliation:

1. CNR -IEIIT, Torino, Italy

2. Université du Québec en Outaouais

Abstract

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 τ and the amount of information that has to be given a priori to the nodes to enable leader election in time τ 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 τ allocated to leader election, we give upper and lower bounds on the minimum size of advice sufficient to perform leader election in time τ. For most values of τ, 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 diamD . While leader election in time diam can be performed without any advice, for time diam − 1 we give tight upper and lower bounds of Θ(log D ). For time diam − 2 we give tight upper and lower bounds of Θ(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 [β · diam , diam − 3] for constant β > 1/2, we prove an upper bound of O ( n log n / D ) and a lower bound of Ω( n / D ), the latter being valid whenever diam is odd or when the time is at most diam − 4. Hence, with the exception of the special case when diam is even and time is exactly diam − 3, our bounds leave only a logarithmic gap in this time interval. Finally, for time α · diam for any constant α < 1/2 (except for the case of very small diameters), we again give tight upper and lower bounds, this time Θ( n ).

Funder

NSERC Discovery

ANR project DISPLEXITY

Research Chair in Distributed Computing at the Université du Québec en Outaouais

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Reference42 articles.

1. Compact Labeling Scheme for Ancestor Queries

2. Alfred V. Aho John E. Hopcroft and Jeffrey D. Ullman. 1983. Data Structures and Algorithms. Addison-Wesley. Alfred V. Aho John E. Hopcroft and Jeffrey D. Ullman. 1983. Data Structures and Algorithms. Addison-Wesley.

3. Local and global properties in networks of processors (Extended Abstract)

4. Better computing on the anonymous ring

5. Computing on an anonymous ring

Cited by 16 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Brief Announcement: Local Advice and Local Decompression;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Deterministic size discovery and topology recognition in radio networks with short labels;Information and Computation;2023-06

3. Four shades of deterministic leader election in anonymous networks;Distributed Computing;2023-05-31

4. Lower and upper bounds for deterministic convergecast with labeling schemes;Theoretical Computer Science;2023-03

5. Self-stabilising Priority-Based Multi-Leader Election and Network Partitioning;2022 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS);2022-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3