Abstract:
This paper gives an efficient simulation to show that dynamic networks are as fast as static ones up to a constant multiplicative factor. That is, any task can be performed in a dynamic asynchronous network essentially as fast as in a static synchronous network. The simulation protocol is based on a new approach, perceiving "locality " as the key to fast adaptation to changes in network topology. The heart of our simulation is a new technique, called a dynamic synchronizer which achieves "local" simulation of a global "clock" in a dynamic asynchronous network. Using this result we obtain improved solutions to a number of well known problems on dynamic networks. It can also be used to improve the solution to certain static network problems. 1 Introduction The Dynamic Asynchronous network, where links may repeatedly fail and recover, is a realistic model of existing commercial communication networks, such the ARPANET [23]. Design and analysis of protocols for such networks is much more...
Citations
|
275
|
A Simple Parallel Algorithm for the Maximal Independent Set Problem
– Luby
- 1985
|
|
251
|
A distributed algorithm for minimum weight spanning trees
– Gallager, Humblet, et al.
- 1983
|
|
251
|
Checkpointing and Rollback-Recovery for Distributed Systems
– Koo, Toueg
- 1987
|
|
231
|
The new routing algorithm for the ARPANET
– McQuillan, Richer, et al.
- 1980
|
|
221
|
Termination detection for diffusing computations
– Dijkstra, Scholten
- 1980
|
|
176
|
Complexity of Network Synchronization
– Awerbuch
- 1985
|
|
119
|
The Drinking Philosophers Problem
– Chandy, Misra
- 1984
|
|
116
|
Distributed network protocols
– Segall
- 1983
|
|
64
|
Optimal Algorithms for Byzantine Agreement
– Feldman
- 1988
|
|
63
|
Applying static network protocols to dynamic networks
– Afek, Awerbuch, et al.
- 1987
|
|
39
|
Resynch procedures and failsafe network protocol
– Finn
- 1979
|
|
23
|
A new distributed algorithm to find breadth first search trees
– Awerbuch, Gallager
- 1987
|
|
20
|
Parallel symmetry breaking in sparse graphs
– Goldberg, Plotkin, et al.
- 1987
|
|
13
|
Broadcasting Topology Information in Computer Networks
– Spinelli, Gallager
- 1989
|
|
12
|
Distributed minimum hop algorithms
– Gallager
- 1982
|
|
11
|
Distributed BFS algorithms
– Awerbuch, Gallager
- 1985
|
|
11
|
A shortest path routing algorithm with automatic resynch
– Gallager
- 1976
|
|
8
|
On the effects of feedback in dynamic network protocols
– Awerbuch
- 1988
|
|
7
|
Topology resynchronization: A new paradigm for fault tolerance in distributed algorithms
– Gafni
- 1987
|
|
6
|
On the Computational Complexity of Finding a Connectionist Model's Stable State Vectors
– Lipscomb
- 1987
|
|
4
|
The computational complexity of the stable configuration problem for connectionist models
– Godbeer
- 1988
|
|
4
|
Locality as an obstacle to distributed computing
– Linial
- 1987
|
|
3
|
and Yehuda Afek. Local fail-safe resynch procedure. unpublished manuscript
– Gafni
- 1987
|
|
3
|
Synthesis of efficient drinking philosophers algorithms, Unpublished manuscript
– Lundelius, Lynch
- 1988
|
|
1
|
private communication
– Unpublished
- 1988
|
