Download:
|
by Sukumar Ghosh, Arobinda Gupta, Sriram, V. Pemmaraju
Distributed Computing
http://www.stat.uiowa.edu/ftp/sriram/self_stabilization/flow.ps.gz
Add To MetaCart
Abstract:
Abstract. The maximum flow problem is a fundamental problem in graph theory and combinatorial optimization with a variety of important applications. Known distributed algorithms for this problem do not tolerate faults or adjust to dynamic changes in network topology. This paper presents the first distributed self-stabilizing algorithm for the maximum flow problem. Starting from an arbitrary state, the algorithm computes the maximum flow in a acyclic network in finitely many steps. Since the algorithm is self-stabilizing, it is inherently tolerant to transient faults and can automatically adjust to topology changes and to changes in other parameters of the problem. The paper presents extensive experimental results to indicate that the algorithm requires n 2 moves in an average-case setting. A slight modification of the original algorithm is also presented and it is conjectured that the new algorithm computes a maximum flow in arbitrary networks.
Citations
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
504
|
Data structures and network algorithms
– Tarjan
- 1983
|
|
449
|
Self-Stabilizing Systems in Spite of Distributed Control
– Dijkstra
- 1974
|
|
278
|
Guarded commands, nondeterminacy, and formal derivation of programs
– Dijkstra
- 1975
|
|
266
|
A new approach to the maximum flow problem
– Goldberg, Tarjan
- 1988
|
|
187
|
Theoretical improvements in algorithmic efficiency for network problems
– Edmonds, Karp
- 1972
|
|
42
|
A self-stabilizing algorithm for constructing spanning trees
– Chen, Yu, et al.
- 1991
|
|
35
|
Maximal flow through a network, Canadian
– Ford, Fulkerson
- 1956
|
|
29
|
Efficient graph algorithms for sequential and parallel computers
– Goldberg
- 1987
|
|
27
|
A self-stabilizing algorithm for coloring planar graphs
– Ghosh, Karaata
- 1993
|
|
22
|
An O(n log n) parallel max-flow algorithm
– Shiloach, Vishkin
- 1982
|
|
20
|
A self-stabilizing algorithm for constructing breadth-first trees
– Huang, Chen
- 1992
|
|
19
|
Self-stabilizing depth-first search
– Collin, Dolev
- 1994
|
|
13
|
Goldberg's Algorithm for the Maximum Flow in Perspective: a Computational Study
– Anderson, Setubal
- 1993
|
|
9
|
Self-stabilizing algorithms for finding centers and medians of trees
– Karaata, Pemmaraju, et al.
- 1994
|
|
7
|
Some Recent Advances in Network Flows
– Ahuja, Magnanti, et al.
- 1991
|
|
1
|
A simple load-control approximation algorithm for multicommodity flow
– Awerbuch, Leighton
- 1993
|
