Proceedings of the 39th Symposium on Principles of Distributed Computing最新文献_第6页

Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers 分布式多写原子寄存器快速实现的细粒度分析

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-01-22 DOI: 10.1145/3382734.3405698

Kaile Huang, Yu Huang, Hengfeng Wei

引用次数: 2

Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks 简要公告:多信道无线网络中资源竞争广播对抗自适应对手

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-01-12 DOI: 10.1145/3382734.3405697

Haimin Chen, Chaodong Zheng

{"title":"Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks","authors":"Haimin Chen, Chaodong Zheng","doi":"10.1145/3382734.3405697","DOIUrl":"https://doi.org/10.1145/3382734.3405697","url":null,"abstract":"Broadcasting in wireless networks is vulnerable to adversarial jamming. To thwart such behavior, researchers have proposed resource competitive analysis. In this framework, sending, listening, or jamming on one channel for one time slot costs one unit of energy. The adversary can employ arbitrary strategy to disrupt communication, but has a limited energy budget T. The honest nodes, on the other hand, aim to accomplish broadcast while spending only o(T). Previous work has shown, in a C-channels network containing n nodes, each node can receive the message in roughly O(T/C) time, while spending only roughly [EQUATION] energy. However, these algorithms only work for C = O(n), and can only tolerate an oblivious adversary. We improve the result by considering an adaptive adversary and arbitrary values of n and C. In our algorithms, for large T values, each node's runtime is O(T/C), and each node's energy cost is [EQUATION]. The time complexity is asymptotically optimal, while the energy complexity is near optimal in some cases. We use \"epidemic broadcast\" with proper working probabilities to achieve time efficiency and resource competitiveness, and leverage coupling arguments in the analysis to handle the adaptivity of the adversary.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114551023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Efficient Deterministic Distributed Coloring with Small Bandwidth 小带宽的高效确定性分布式着色

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2019-12-05 DOI: 10.1145/3382734.3404504

P. Bamberger, F. Kuhn, Yannic Maus

引用次数: 34

Want to Gather? No Need to Chatter! 想要聚会吗?没有必要喋喋不休!

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2019-08-29 DOI: 10.1145/3382734.3405693

S. Bouchard, Yoann Dieudonné, A. Pelc

{"title":"Want to Gather? No Need to Chatter!","authors":"S. Bouchard, Yoann Dieudonné, A. Pelc","doi":"10.1145/3382734.3405693","DOIUrl":"https://doi.org/10.1145/3382734.3405693","url":null,"abstract":"A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels which are positive integers, and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally considered under the assumption that when some agents are at the same node then they can talk, i.e., exchange currently available information. In this paper we ask the question of whether this ability of talking is needed for gathering. The answer turns out to be no. Our main contribution are two deterministic algorithms that always accomplish gathering in a much weaker model. We only assume that at any time an agent knows how many agents are at the node that it currently occupies but agents do not see the labels of other co-located agents and cannot exchange any information with them. They also do not see other nodes than the current one. Our first algorithm works under the assumption that agents know a priori some upper bound N on the size of the network, and it works in time polynomial in N and in the length ℓ of the smallest label. Our second algorithm does not assume any a priori knowledge about the network but its complexity is exponential in the size of the network and in the labels of agents. Its purpose is to show feasibility of gathering under this harsher scenario. As a by-product of our techniques we obtain, in the same weak model, the solution of the fundamental problem of leader election among agents: One agent is elected a leader and all agents learn its identity. As an application of our result we also solve, in the same model, the well-known gossiping problem: if each agent has a message at the beginning, we show how to make all messages known to all agents, even without any a priori knowledge about the network. If agents know an upper bound N on the size of the network then our gossiping algorithm works in time polynomial in N, in the length of the smallest label and in the length of the largest message. This result about gossiping is perhaps our most surprising finding: agents devoid of any transmitting devices can solve the most general information exchange problem, as long as they can count the number of agents present at visited nodes.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114759546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems 看得远与看得宽:局部图问题的体积复杂性

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2019-07-18 DOI: 10.1145/3382734.3405721

Will Rosenbaum, J. Suomela

{"title":"Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems","authors":"Will Rosenbaum, J. Suomela","doi":"10.1145/3382734.3405721","DOIUrl":"https://doi.org/10.1145/3382734.3405721","url":null,"abstract":"Assume we have a graph problem that is locally checkable but not locally solvable---given a solution we can check that it is feasible by verifying all constant-radius neighborhoods, but to find a feasible solution each node needs to explore the input graph at least up to distance Ω (log n) in order to produce its own part of the solution. Such problems have been studied extensively in the recent years in the area of distributed computing, where the key complexity measure has been distance: how far does a node need to see in order to produce its own part of the solution. However, if we are interested in e.g. sublinear-time centralized algorithms, a much more appropriate complexity measure would be volume: how large a subgraph does a node need to see in order to produce its own part of the solution. In this work we study locally checkable graph problems on bounded-degree graphs and we give a number of constructions that exhibit different tradeoffs between deterministic distance, randomized distance, deterministic volume, and randomized volume: • If the deterministic distance is linear, it is also known that randomized distance is near-linear. We show that volume complexity is fundamentally different: there are problems with a linear deterministic volume but only logarithmic randomized volume. • We prove a volume hierarchy theorem for randomized complexity: Among problems with (near) linear deterministic volume complexity, there are infinitely many distinct randomized volume complexity classes between Ω(log n) and O(n). Moreover, this hierarchy persists even when restricting to problems whose randomized and deterministic distance complexities are Θ(log n). • Similar hierarchies exist for polynomial distance complexities: we show that for any k, ℓ ∈ N with k ≤ ℓ, there are problems whose randomized and deterministic distance complexities are Θ(n1/ℓ), randomized volume complexities are [EQUATION], and whose deterministic volume complexities are [EQUATION]. We also consider connections between our volume model and massively parallel computation (MPC). We give a general simulation argument that any volume-efficient algorithm can be transformed into a space-efficient MPC algorithm.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131275249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

Distributed Construction of Light Networks 轻型网络的分布式构建

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2019-05-07 DOI: 10.1145/3382734.3405701

Michael Elkin, Arnold Filtser, Ofer Neiman

{"title":"Distributed Construction of Light Networks","authors":"Michael Elkin, Arnold Filtser, Ofer Neiman","doi":"10.1145/3382734.3405701","DOIUrl":"https://doi.org/10.1145/3382734.3405701","url":null,"abstract":"A t-spanner H of a weighted graph G = (V, E, w) is a subgraph that approximates all pairwise distances up to a factor of t. The lightness of H is defined as the ratio between the weight of H to that of the minimum spanning tree. An (α, β)-Shallow Light Tree (SLT) is a tree of lightness β, that approximates all distances from a designated root vertex up to a factor of α. A long line of works resulted in efficient algorithms that produce (nearly) optimal light spanners and SLTs. Some of the most notable algorithmic applications of light spanners and SLTs are in distributed settings. Surprisingly, so far there are no known efficient distributed algorithms for constructing these objects in general graphs. In this paper we devise efficient distributed algorithms in the CONGEST model for constructing light spanners and SLTs, with near optimal parameters. Specifically, for any k ≥ 1 and 0 < ∈ < 1, we show a (2k − 1) · (1 + ∈)-spanner with lightness O(k·n1/k) can be built in [EQUATION] rounds (where n = |V| and D is the hop-diameter of G). In addition, for any α > 1 we provide an [EQUATION] rounds. The running times of our algorithms cannot be substantially improved. We also consider spanners for the family of doubling graphs, and devise a [EQUATION] rounds algorithm in the CONGEST model that computes a (1 + ∈)-spanner with lightness (log n)/∈O(1). As a stepping stone, which is interesting in its own right, we first develop a distributed algorithm for constructing nets (for arbitrary weighted graphs), generalizing previous algorithms that worked only for unweighted graphs.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125535861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

How much does randomness help with locally checkable problems? 随机性对局部可检查问题有多大帮助?

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2019-02-18 DOI: 10.1145/3382734.3405715

A. Balliu, S. Brandt, D. Olivetti, J. Suomela

引用次数: 22

Positive Aging Admits Fast Asynchronous Plurality Consensus 正老化承认快速异步多元共识

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2018-06-07 DOI: 10.1145/3382734.3406506

Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaž Krnc

{"title":"Positive Aging Admits Fast Asynchronous Plurality Consensus","authors":"Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaž Krnc","doi":"10.1145/3382734.3406506","DOIUrl":"https://doi.org/10.1145/3382734.3406506","url":null,"abstract":"We study distributed plurality consensus among n nodes, each of which initially holds one of k opinions. The goal is to eventually agree on the initially dominant opinion. We consider an asynchronous communication model in which each node is equipped with a random clock. Whenever the clock of a node ticks, it may open communication channels to a constant number of other nodes, chosen uniformly at random or from a list of constantly many addresses acquired in previous steps. The tick rates and the delays for establishing communication channels (channel delays) follow some probability distribution. Once a channel is established, communication between nodes can be performed instantaneously. We consider distributions for the waiting times between ticks and channel delays that have constant mean and the so-called positive aging property. In this setting, asynchronous plurality consensus is fast: if the initial bias between the largest and second largest opinion is at least [EQUATION] log n, then after O(log logα k · log k + log log n) time all but a 1/polylog n fraction of nodes have the initial plurality opinion. Here α denotes the initial ratio between the largest and second largest opinion. After additional O(log n) steps all nodes have the same opinion w.h.p., and this result is tight. If additionally the distributions satisfy a certain density property, which is common in many well-known distributions, we show that consensus is reached in O(log logα k + log log n) time for all but n/polylog n nodes, w.h.p. This implies that for a large range of initial configurations partial consensus can be reached significantly faster in this asynchronous communication model than in the synchronous setting. To obtain these results, we first assume the existence of a designated base station and later present fully distributed algorithms. Additionally, we derive tail bounds on the Pólya-Eggenberger distribution, which might be of independent interest.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"9 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121918171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4