Scalability and Fragility in Bounded-Degree Consensus Networks
نویسندگان
چکیده
منابع مشابه
Fault Tolerance in Networks of Bounded Degree
Achieving processor cooperation in the presence of faults is a major problem in distributed systems. Popular paradigms such as Byzantine agreement have been studied principally in the context of a complete network. Indeed, Dolev [J. Algorithms, 3 (1982), pp. 14-30] and Hadzilacos [Issues of Fault Tolerance in Concurrent Computations, Ph.D. thesis, Harvard University, Cambridge, MA, 1984] have s...
متن کاملBounded Degree Approximations of Stochastic Networks
We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against vi...
متن کاملReal-Time Emulations of Bounded-Degree Networks
In this paper, we survey the state of the art in real-time emulations of various bounded-degree networks | that is, where one bounded-degree network performs an arbitrary computation of some other network with only a constant-factor degradation in both space and time. The results use a variety of techniques, from simple embeddings of one network structure into another to quite complex general e...
متن کاملThe complexity of broadcasting in bounded-degree networks
Because of cost and physical limitations there is an interest in broadcast networks with a fixed maximum number of communication links for each node, [BHLP,LP,DFF]. In this note we show that given an arbitrary bounded-degree network, determining the minimum broadcast time for any originating node is NPcomplete. For the NP-completeness proof of the general case of unbounded-degree networks, it i...
متن کاملBounded-degree minimum-radius spanning trees in wireless sensor networks
a r t i c l e i n f o a b s t r a c t In this paper, we study the problem of computing a spanning tree of a given undirected disk graph such that the radius of the tree is minimized subject to a given degree constraint *. We first introduce an (8, 4)-bicriteria approximation algorithm for unit disk graphs (which is a special case of disk graphs) that computes a spanning tree such that the degre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.12.131