WSS
1997
13 years 6 months ago
1997
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
WSS
2001
13 years 6 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
WSS
2001
13 years 6 months ago
2001
We present a formal specification of the PING protocol, and use three concepts of convergence theory, namely closure, convergence, and protection, to show that this protocol is se...
WSS
2001
13 years 6 months ago
2001
We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabiliz...
WSS
2001
13 years 6 months ago
2001
WSS
2001
13 years 6 months ago
2001
WSS
2001
13 years 6 months ago
2001
Abstract. We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm c...