Proceedings ArticleDOI
Communication-optimal maintenance of replicated information
Baruch Awerbuch,Israel Cidon,Shay Kutten +2 more
- pp 492-502
TLDR
It is shown that keeping track of history allows significant improvements in the realistic model of communication complexity of dynamic network protocols, and it is found that amortized communication complexity, i.e. incremental cost of adapting to a single topology change, can be smaller than the communications complexity of solving the problem from scratch.Abstract:
It is shown that keeping track of history allows significant improvements in the realistic model of communication complexity of dynamic network protocols. The communication complexity for solving an arbitrary graph problem is improved from Theta (E) to Theta (V), thus achieving the lower bound. Moreover, O(V) is also the amortized complexity of solving an arbitrary function (not only graph functions) defined on the local inputs of the nodes. As a corollary, it is found that amortized communication complexity, i.e. incremental cost of adapting to a single topology change, can be smaller than the communication complexity of solving the problem from scratch. The first stage in the solution is a communication-optimal maintenance of a spanning tree in a dynamic network. The second stage is the optimal maintenance of replicas of databases. An important example of this task is the problem of updating the description of the network's topology at every node. For this problem the message complexity is improved from O(EV) to Theta (V). The improvement for a general database is even larger if the size of the database is larger than E. >read more
Citations
More filters
Proceedings ArticleDOI
SuperStabilizing protocols for dynamic distributed systems
Shlomi Dolev,Ted Herman +1 more
TL;DR: In this article, the authors introduce the notion of superstabilizing protocols, which is defined as a distributed protocol that is guaranteed to satisfy a passage predicate at all times when the system undergoes topology changes starting from a legitimate state.
Journal ArticleDOI
The local detection paradigm and its applications to self-stabilization
TL;DR: D deterministic and randomized self-stabilizing algorithms that maintain a rooted spanning tree in a general network whose topology changes dynamically, which provide for the easy construction of self-Stabilizing protocols for numerous tasks.
Journal ArticleDOI
Fault-Local Distributed Mending
Shay Kutten,David Peleg +1 more
TL;DR: In this paper, the authors introduce the concepts of fault locality and fault-locally mendable problems, which are problems for which there are correction algorithms (applied after faults) whose cost depends only on the (unknown) number of faults.
Proceedings ArticleDOI
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
TL;DR: This paper develops a fully dynamic distributed algorithm for maintaining sparse spanners that improves drastically the quiescence time and improves significantly upon the state-of-the-art algorithm in all efficiency parameters.
Proceedings ArticleDOI
Distributed, scalable routing based on link-state vectors
TL;DR: In this paper, a new family of routing algorithms for the distributed maintenance of routing information in large networks and internets is introduced, called link vector algorithms (LVA), and is based on the selective diffusion of link-state information based on a distributed computation of preferred paths, rather than on the flooding of complete link state information to all routers.
References
More filters
Book
Graph Algorithms
TL;DR: A thoroughly revised second edition of Shimon Even's Graph Algorithms, with a foreword by Richard M. Karp and notes by Andrew V Goldberg, explains algorithms in a formal but simple language with a direct and intuitive presentation.
Journal ArticleDOI
A Distributed Algorithm for Minimum-Weight Spanning Trees
TL;DR: A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights that can be initiated spontaneously at any node or at any subset of nodes.
ReportDOI
A Distributed Algorithm for Minimum Weight Spanning Trees. Revision
TL;DR: In this paper, a distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights, where a processor exists at each node of the graph, knowing initially only the weights of the adjacent edges.
Journal ArticleDOI
The New Routing Algorithm for the ARPANET
TL;DR: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
Journal ArticleDOI
A Minimum Delay Routing Algorithm Using Distributed Computation
TL;DR: A new global convergence theorem for noncontinuous iteration algorithms is developed that converges, with successive updates of the routing tables, to the minimum average delay over all routing assignments.