• Distrib. Comput. (IF 0.894) Pub Date : 2020-10-07
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry

Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed

更新日期：2020-10-08
• Distrib. Comput. (IF 0.894) Pub Date : 2020-08-05
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik

Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of n identical agents (finite state machines) performs a global task like electing a unique leader or determining the majority opinion when each agent has one of two opinions. Agents communicate in pairwise interactions with randomly assigned communication partners. Quality is measured

更新日期：2020-08-05
• Distrib. Comput. (IF 0.894) Pub Date : 2020-07-26
Chaya Ganesh, Arpita Patra

The problems of Byzantine Broadcast (BB) and Byzantine Agreement (BA) are of interest to both the distributed computing and cryptography communities. Extension protocols for these primitives have been introduced to handle long messages efficiently at the cost of small number of single-bit broadcasts, referred to as seed broadcasts. While the communication optimality has remained the most sought-after

更新日期：2020-07-26
• Distrib. Comput. (IF 0.894) Pub Date : 2020-07-24
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic

Distributed optimization algorithms are frequently faced with solving sub-problems on disjoint connected parts of a network. Unfortunately, the diameter of these parts can be significantly larger than the diameter of the underlying network, leading to slow running times. This phenomenon can be seen as the broad underlying reason for the pervasive $$\tilde{\Omega }(\sqrt{n} + D)$$ lower bounds that

更新日期：2020-07-24
• Distrib. Comput. (IF 0.894) Pub Date : 2020-07-13
Reut Levi, Moti Medina, Dana Ron

We give a distributed algorithm in the CONGEST model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (Proceedings of the 30th International Symposium on Distributed Computing, pp. 43–56, 2016), who recently initiated the study of property testing in the distributed setting, our algorithm gives the following guarantee: For a

更新日期：2020-07-14
• Distrib. Comput. (IF 0.894) Pub Date : 2020-06-22
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli

We consider the problem of computing approximate Nash equilibria in monotone congestion games (a class of games generalizing network congestion games) with polynomially decreasing cost functions. In particular, we consider the case in which each resource j has a cost $$c_j$$ and the cost that each player incurs when using j is given by $$c_j/x^{\beta }$$ for some constant $${\beta }>0$$, where x is

更新日期：2020-06-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-05-28
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf

We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include: A $$(2+\epsilon )$$-approximation for all-pairs shortest paths in $$O(\log ^2{n} / \epsilon )$$ rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation

更新日期：2020-05-28
• Distrib. Comput. (IF 0.894) Pub Date : 2020-05-26
Antonio Fernández Anta, Theophanis Hadjistasi, Nicolas Nicolaou, Alexandru Popa, Alexander A. Schwarzmann

Communication cost is the most commonly used metric in assessing the efficiency of operations in distributed algorithms for message-passing environments. In doing so, the standing assumption is that the cost of local computation is negligible compared to the cost of communication. However, in many cases, operation implementations rely on complex computations that should not be ignored. Therefore, a

更新日期：2020-05-26
• Distrib. Comput. (IF 0.894) Pub Date : 2020-05-06
Eric E. Severson, David Haley, David Doty

We study the composability of discrete chemical reaction networks (CRNs) that stably compute (i.e., with probability 0 of error) integer-valued functions $$f:\mathbb {N}^d\rightarrow \mathbb {N}$$. We consider output-oblivious CRNs in which the output species is never a reactant (input) to any reaction. The class of output-oblivious CRNs is fundamental, appearing in earlier studies of CRN computation

更新日期：2020-05-06
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-25
Giuseppe A. Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta

In this paper we investigate the computational power of population protocols under some unreliable or weaker interaction models. More precisely, we focus on two features related to the power of interactions: omission failures and one-way communications. An omission failure, a notion that this paper introduces for the first time in the context of population protocols, is the loss by one or both parties

更新日期：2020-04-25
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-18
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela

The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the $$\mathsf {LOCAL}$$ model and locally checkable problems ($$\mathsf {LCL}$$s) in bounded-degree graphs, the following picture emerges: There are lots of problems with time complexities of $$\varTheta (\log ^* n)$$ or $$\varTheta (\log n)$$. It

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-09
Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen

We introduce a novel lower bound technique for distributed graph algorithms under bandwidth limitations. We define the notion of fooling views and exemplify its strength by proving two new lower bounds for triangle membership in the Congest$$(B)$$ model: 1. Any 1-round algorithm requires $$B\ge c\varDelta \log n$$ for a constant $$c>0$$. 2. If $$B=1$$, even in constant-degree graphs any algorithm must

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-02-22
Panagiota Fatourou, Nikolaos D. Kallimanis

A universal construction is a general mechanism for obtaining a concurrent implementation of any shared object from its sequential implementation. We present the family of RedBlue universal constructions which produce adaptive, linearizable, wait-free, concurrent implementations of shared objects. The proposed universal constructions improve upon previous universal constructions in terms of their step

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-02-20
Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang

We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications. The input to the problem is a graph G that has n vertices and the set of edges partitioned over k sites, and an approximation ratio

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-02-03
Sebastian Brandt, Jara Uitto, Roger Wattenhofer

Recently, there has been a growing interest in grid exploration by agents with limited capabilities. We show that the grid cannot be explored by three semi-synchronous finite automata, answering an open question by Emek et al. (Theor Comput Sci 608:255–267, 2015) in the negative. In the setting we consider, time is divided into discrete steps, where in each step, an adversarially selected subset of

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2019-12-21

The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems studied in this area is to determine whether for a given graph H, the input network contains a subgraph isomorphic to H or not. We investigate this problem for H being a clique $$K_{\ell }$$ in the classical distributed CONGEST model, where the communication topology is the same

更新日期：2020-04-23
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-21
David Yu Cheng Chan; Vassos Hadzilacos; Sam Toueg

The set agreement power of a shared object O describes O’s ability to solve set agreement problems: it is the sequence $$(n_1, n_2, {\ldots }, n_k, {\ldots })$$ such that, for every $$k\ge 1$$, using O and registers one can solve the k-set agreement problem among at most $$n_k$$ processes. It has been shown that the ability of an object O to implement other objects is not fully characterized by its

更新日期：2020-04-21
• Distrib. Comput. (IF 0.894) Pub Date : 2020-04-18
Keren Censor-Hillel; Merav Parter; Gregory Schwartzman

This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions. Our main contribution is in providing tools for derandomizing solutions to local problems, when the n nodes can only send $$O(\log n)$$-bit messages in each round of communication. Our framework mostly follows

更新日期：2020-04-18
• Distrib. Comput. (IF 0.894) Pub Date : 2019-12-03
Chryssis Georgiou; Seth Gilbert; Dariusz R. Kowalski

Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of this reliability and efficiency derives from processes collaborating, sharing the work of distributing information. As a result of this collaboration, processes may receive information that was not originally intended for them. For example, some process may act as an intermediary

更新日期：2019-12-03
• Distrib. Comput. (IF 0.894) Pub Date : 2019-11-16
Vidhya Tekken Valapil; Sandeep S. Kulkarni

Stabilization is a key dependability property for dealing with unanticipated transient faults, as it guarantees that even in the presence of such faults, the system will recover to states where it satisfies its specification. One of the desirable attributes of stabilization is the use of bounded space for each variable. In this paper, we present an algorithm that transforms a stabilizing program that

更新日期：2019-11-16
• Distrib. Comput. (IF 0.894) Pub Date : 2019-11-11
Shady Issa; Pascal Felber; Alexander Matveev; Paolo Romano

Transactional memory (TM) aims at simplifying concurrent programming via the familiar abstraction of atomic transactions. Recently, Intel and IBM have integrated hardware based TM (HTM) implementations in commodity processors, paving the way for the mainstream adoption of the TM paradigm. Yet, existing HTM implementations suffer from a crucial limitation, which hampers the adoption of HTM as a general

更新日期：2019-11-11
• Distrib. Comput. (IF 0.894) Pub Date : 2019-11-05

Mutex locks have traditionally been the most common mechanism for protecting shared data structures in concurrent programs. However, the robustness of such locks against process failures has not been studied thoroughly. The vast majority of mutex algorithms are designed around the assumption that processes are reliable, meaning that a process may not fail while executing the lock acquisition and release

更新日期：2019-11-05
• Distrib. Comput. (IF 0.894) Pub Date : 2019-09-13
Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita

The Meeting problem for $$k\ge 2$$ searchers in a polygon P (possibly with holes) consists in making the searchers move within P, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the shape

更新日期：2019-09-13
• Distrib. Comput. (IF 0.894) Pub Date : 2019-09-04
Faith Ellen; Rati Gelashvili; Nir Shavit; Leqi Zhu

For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best explanation of the relative power of various objects. Since real multiprocessors allow the different instructions they support to be applied to any memory location, it makes sense to consider combining the instructions supported by different objects, rather than considering collections of different objects.

更新日期：2019-09-04
• Distrib. Comput. (IF 0.894) Pub Date : 2019-08-07
Irvan Jahja; Haifeng Yu; Yuda Zhao

This paper considers several closely-related problems in synchronous dynamic networks with oblivious adversaries, and proves novel $$\varOmega (d + \text{ poly }(m))$$ lower bounds on their time complexity (in rounds). Here d is the dynamic diameter of the dynamic network and m is the total number of nodes. Before this work, the only known lower bounds on these problems under oblivious adversaries

更新日期：2019-08-07
• Distrib. Comput. (IF 0.894) Pub Date : 2019-08-06
Xavier Défago; Maria Potop-Butucaru; Philippe Raipin-Parvédy

Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial locations and no initial agreement on a global coordinate system, gathering requires that all robots, following their algorithm, reach the exact same but not predetermined location. Gathering is particularly challenging in networks where robots are oblivious (i.e., stateless)

更新日期：2019-08-06
• Distrib. Comput. (IF 0.894) Pub Date : 2019-07-06
Thomas Dickerson; Paul Gazzillo; Maurice Herlihy; Eric Koskinen

Modern cryptocurrency systems, such as the Ethereum project, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times, always without real concurrency. First, all smart contracts are serially executed by miners before appending them to the blockchain. Later, those contracts are serially re-executed by validators to verify that

更新日期：2019-07-06
• Distrib. Comput. (IF 0.894) Pub Date : 2019-06-19

We study the effect of different progress conditions on the computability of distributed systems. For a system with n processes, we define exponentially many new progress conditions and explore their properties and relative strength. We cover many known and new interesting conditions and propose a new classification for evaluating the strength of shared objects. The classification is based on finding

更新日期：2019-06-19
• Distrib. Comput. (IF 0.894) Pub Date : 2019-06-13
Heger Arfaoui; Pierre Fraigniaud; David Ilcinkas; Fabien Mathieu; Andrzej Pelc

Given a boolean predicate on labeled networks (e.g., the network is acyclic, or the network is properly colored, etc.), deciding in a distributed manner whether a given labeled network satisfies that predicate typically consists, in the standard setting, of every node inspecting its close neighborhood, and outputting a boolean verdict, such that the network satisfies the predicate if and only if all

更新日期：2019-06-13
• Distrib. Comput. (IF 0.894) Pub Date : 2019-06-01
George Giakkoupis; Philipp Woelfel

We study randomized test-and-set (TAS) implementations from registers in the asynchronous shared memory model with n processes. We introduce the problem of group election, a natural variant of leader election, and propose a framework for the implementation of TAS objects from group election objects. We then present two group election algorithms, each yielding an efficient TAS implementation. The first

更新日期：2019-06-01
• Distrib. Comput. (IF 0.894) Pub Date : 2019-05-31
Chen Avin; Kaushik Mondal; Stefan Schmid

Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and traffic patterns which they serve. This insight led to the development of demand-aware datacenter interconnects which can be reconfigured depending on the workload. Motivated

更新日期：2019-05-31
• Distrib. Comput. (IF 0.894) Pub Date : 2019-05-21
Soumyottam Chatterjee; Gopal Pandurangan; Peter Robinson

This paper focuses on studying the message complexity of implicit leader election in synchronous distributed networks of diameter two. Kutten et al. (J ACM 62(1):7:1–7:27, 2015) showed a fundamental lower bound of $$\varOmega (m)$$ (m is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success

更新日期：2019-05-21
• Distrib. Comput. (IF 0.894) Pub Date : 2019-05-16
Keren Censor-Hillel; Michal Dory

The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph G and a spanning tree T for it, and the goal is to augment T with a minimum set of edges Aug from G, such that $$T \cup Aug$$ is 2-edge-connected. TAP has been widely studied in the sequential setting. The best known approximation ratio of 2 for the weighted case dates back to the work of Frederickson

更新日期：2019-05-16
• Distrib. Comput. (IF 0.894) Pub Date : 2019-03-16
Giuseppe A. Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Yukiko Yamauchi

Shape formation (or pattern formation) is a basic distributed problem for systems of computational mobile entities. Intensively studied for systems of autonomous mobile robots, it has recently been investigated in the realm of programmable matter, where entities are assumed to be small and with severely limited capabilities. Namely, it has been studied in the geometric Amoebot model, where the anonymous

更新日期：2019-03-16
• Distrib. Comput. (IF 0.894) Pub Date : 2019-02-13
Kyrill Winkler; Manfred Schwarz; Ulrich Schmid

We consider the problem of solving consensus using deterministic algorithms in a synchronous dynamic network with unreliable, directional point-to-point links, which are under the control of a message adversary. In contrast to the large body of existing work that focuses on message adversaries that pick the communication graphs from a predefined set of candidate graphs arbitrarily, we consider message

更新日期：2019-02-13
• Distrib. Comput. (IF 0.894) Pub Date : 2019-02-04
Mohsen Ghaffari; Juho Hirvonen; Fabian Kuhn; Yannic Maus; Jukka Suomela; Jara Uitto

The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. We present deterministic distributed

更新日期：2019-02-04
• Distrib. Comput. (IF 0.894) Pub Date : 2019-02-04
Niloufar Shafiei

This paper presents a non-blocking Patricia trie implementation for an asynchronous shared-memory system using Compare&Swap. The trie is a linearizable implementation of a set and supports three update operations: insert adds an element to the trie, delete removes an element from the trie and replace replaces one element by another. The replace operation is interesting because it changes two different

更新日期：2019-02-04
• Distrib. Comput. (IF 0.894) Pub Date : 2018-12-15
Manuel Alcántara; Armando Castañeda; David Flores-Peñaloza; Sergio Rajsbaum

Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its surroundings and obtains a snapshot containing the vertices of G, where all robots are located; based on this snapshot, each robot Computes a vertex (adjacent

更新日期：2018-12-15
• Distrib. Comput. (IF 0.894) Pub Date : 2018-10-04
Manuela Fischer

We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to our knowledge. A sampling of our end results

更新日期：2018-10-04
• Distrib. Comput. (IF 0.894) Pub Date : 2018-09-26
Keren Censor-Hillel; Ran Gelles; Bernhard Haeupler

We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $$\varTheta (1/n)$$ fraction of all messages and incurring a moderate blowup of $$O(n\log ^2 n)$$ in the

更新日期：2018-09-26
• Distrib. Comput. (IF 0.894) Pub Date : 2018-09-12
Christoph Lenzen; Joel Rybicki

Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given $$C>1$$. In the self-stabilising firing squad problem, the task is to eventually guarantee

更新日期：2018-09-12
• Distrib. Comput. (IF 0.894) Pub Date : 2018-09-08
Marek Klonowski; Dariusz R. Kowalski; Jarosław Mirek

An execution of a distributed algorithm is often seen as a game between the algorithm and a conceptual adversary causing specific distractions to the computation. In this work we define a class of ordered adaptive adversaries, which cause distractions—in particular crashes—online according to some partial order of the participating stations, which is fixed by the adversary before the execution. We

更新日期：2018-09-08
• Distrib. Comput. (IF 0.894) Pub Date : 2018-08-30
Pierre Fraigniaud; Boaz Patt-Shamir; Mor Perry

Proof-labeling schemes, introduced by Korman et al. (Distrib Comput 22(4):215–233, 2010. https://doi.org/10.1007/s00446-010-0095-3), are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find applications in many contexts, e.g., the design of fault-tolerant distributed algorithms. In a proof-labeling scheme, predicate verification consists of neighbors

更新日期：2018-08-30
• Distrib. Comput. (IF 0.894) Pub Date : 2018-08-20
G. Di Luna; S. Dobrev; P. Flocchini; N. Santoro

In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the main focus has been on graphs that are static; that is, the topology is either invariant in time or subject to localized changes. The few studies on exploration

更新日期：2018-08-20
• Distrib. Comput. (IF 0.894) Pub Date : 2018-07-12
Sébastien Bouchard; Marjorie Bournat; Yoann Dieudonné; Swan Dubois; Franck Petit

In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them in finite time within each other’s range of vision. The agents execute the same deterministic algorithm and are assumed to have a compass showing the cardinal directions as well as a unit measure. On the other hand, they

更新日期：2018-07-12
• Distrib. Comput. (IF 0.894) Pub Date : 2018-06-20
Lili Su; Nitin H. Vaidya

This paper addresses the problem of non-Bayesian learning over multi-agent networks, where agents repeatedly collect partially informative observations about an unknown state of the world, and try to collaboratively learn the true state out of m alternatives. We focus on the impact of adversarial agents on the performance of consensus-based non-Bayesian learning, where non-faulty agents combine local

更新日期：2018-06-20
• Distrib. Comput. (IF 0.894) Pub Date : 2018-06-07
Nicolas Tabareau; Éric Tanter

Distributed applications are challenging to program because they have to deal with a plethora of concerns, including synchronization, locality, replication, security and fault tolerance. Aspect-oriented programming (AOP) is a paradigm that promotes better modularity by providing means to encapsulate crosscutting concerns in entities called aspects. Over the last years, a number of distributed aspect-oriented

更新日期：2018-06-07
• Distrib. Comput. (IF 0.894) Pub Date : 2018-06-06
Pierre Fraigniaud; Emanuele Natale

Error-correcting codes are efficient methods for handling noisy communication channels in the context of technological networks. However, such elaborate methods differ a lot from the unsophisticated way biological entities are supposed to communicate. Yet, it has been recently shown by Feinerman et al. (PODC 2014) that complex coordination tasks such as rumor spreading and majority consensus can plausibly

更新日期：2018-06-06
• Distrib. Comput. (IF 0.894) Pub Date : 2018-05-07
Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra

We consider the Embedded Pattern Formation (epf) problem introduced in Fujinaga et al. (SIAM J Comput 44(3):740–785, 2015). Given a set F of distinct points in the Euclidean plane (called here fixed-points) and a set R of robots such that $$|R|=|F|$$, the problem asks for a distributed algorithm that moves robots so as to occupy all points in F. Initially, each robot occupies a distinct position. When

更新日期：2018-05-07
• Distrib. Comput. (IF 0.894) Pub Date : 2018-04-27
Weiming Feng; Yuxin Sun; Yitong Yin

The local computation of Linial [FOCS’87] and Naor and Stockmeyer [STOC’93] studies whether a locally defined distributed computing problem is locally solvable. In classic local computation tasks, the goal of distributed algorithms is to construct a feasible solution for some constraint satisfaction problem (CSP) locally defined on the network. In this paper, we consider the problem of sampling a uniform

更新日期：2018-04-27
• Distrib. Comput. (IF 0.894) Pub Date : 2018-03-23
Rati Gelashvili

The optimal space complexity of consensus in asynchronous shared memory was an open problem for two decades. For a system of n processes, no algorithm using a sublinear number of registers is known. Up until very recently, the best known lower bound due to Fich, Herlihy, and Shavit was $${\varOmega }(\sqrt{n})$$ registers. Fich, Herlihy, and Shavit first proved their lower bound for the special case

更新日期：2018-03-23
• Distrib. Comput. (IF 0.894) Pub Date : 2018-03-17
Lucas Boczkowski; Amos Korman; Emanuele Natale

This paper considers the basic $${\mathcal {PULL}}$$ model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each interaction (message size) that nevertheless allows for efficient and robust computations of fundamental information dissemination tasks. We focus on the Majority

更新日期：2018-03-17
• Distrib. Comput. (IF 0.894) Pub Date : 2018-03-16
Éric Goubault; Samuel Mimram; Christine Tasson

We show that the protocol complex formalization of fault-tolerant protocols can be directly derived from a suitable semantics of the underlying synchronization and communication primitives, based on a geometrization of the state space. By constructing a one-to-one relationship between simplices of the protocol complex and (di)homotopy classes of (di)paths in the latter semantics, we describe a connection

更新日期：2018-03-16
• Distrib. Comput. (IF 0.894) Pub Date : 2018-02-27
Magnús M. Halldórsson; Yuexuan Wang; Dongxiao Yu

We examine the utility of multiple channels of communication in wireless networks under the SINR model of interference. The central question is whether the use of multiple channels can result in linear speedup, up to some fundamental limit. We answer this question affirmatively for the data aggregation problem, perhaps the most fundamental problem in sensor networks. To achieve this, we form a hierarchical

更新日期：2018-02-27
• Distrib. Comput. (IF 0.894) Pub Date : 2018-02-13
Christoph Lenzen; Boaz Patt-Shamir; David Peleg

We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design

更新日期：2018-02-13
• Distrib. Comput. (IF 0.894) Pub Date : 2018-02-13
Ning Chen; Martin Hoefer; Marvin Künnemann; Chengyu Lin; Peihan Miao

The secretary model is a popular framework for the analysis of online admission problems beyond the worst case. In many markets, however, decisions about admission have to be made in a distributed fashion. We cope with this problem and design algorithms for secretary markets with limited information. In our basic model, there are m firms and each has a job to offer. n applicants arrive sequentially

更新日期：2018-02-13
• Distrib. Comput. (IF 0.894) Pub Date : 2018-02-08
Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra

Given any multiset F of points in the Euclidean plane and a set R of robots such that $$|R|=|F|$$, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that moves robots so as to reach a configuration similar to F. Similarity means that robots must be disposed as F regardless of translations, rotations, reflections, uniform scalings. Initially, each robot occupies a distinct

更新日期：2018-02-08
• Distrib. Comput. (IF 0.894) Pub Date : 2018-02-01
Jeremy T. Fineman; Seth Gilbert; Fabian Kuhn; Calvin Newport

In this paper, we study upper and lower bounds for contention resolution on a single hop fading channel; i.e., a channel where receive behavior is determined by a signal to interference and noise ratio equation. The best known previous solution solves the problem in this setting in $$O(\log ^2{n}/\log \log {n})$$ rounds, with high probability in the system size n. We describe and analyze an algorithm

更新日期：2018-02-01
• Distrib. Comput. (IF 0.894) Pub Date : 2018-01-18
Keren Censor-Hillel; Eldar Fischer; Gregory Schwartzman; Yadu Vasudev

We initiate a thorough study of distributed property testing—producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, while in the general model we obtain faster tests for triangle-freeness and cycle-freeness, and in the sparse

更新日期：2018-01-18
• Distrib. Comput. (IF 0.894) Pub Date : 2017-12-30
Magnús M. Halldórsson; Sven Köhler; Dror Rawitz

We consider the k-Service Assignment problem ($$k$$-SA). The input consists of a network that contains servers and clients. Associated with each client is a demand and a profit. In addition, each client c has a service requirement, where $$\kappa (c)$$ is a positive integer. A client c is satisfied only if its demand is handled by exactly $$\kappa (c)$$ neighboring servers. The objective is to maximize

更新日期：2017-12-30
Contents have been reproduced by permission of the publishers.

down
wechat
bug