Nian-Shing Chen, Hwey-Pyng Yu, and Shing-Tsaan Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a random neighbor of pursuer upon reading a 3 value for the variable, starts a tree construction to search for a trace of the evader. Note that by using a depth , the pursuer tree is guaranteed to encounter a mote 1 . Several extant self stabilizing tree construction programs [1, 7, 9] suffice for constructing the pursuer tree in steps and to complete the information feedback within another steps. Also since the root of the pursuer tree is static (root does not change dynamically unlike the root of the tracking tree) it is possible to achieve self stabilization of pursuer ....

....maintain tracking information with accuracy proportional to the distance from the evader. Also maintaining the tracking tree in a directional manner and only up to the location of the pursuer will help conserve energy. Related work. Several self stabilizing programs exist for tree construction ([1, 7, 9] to name a few) However, our evader centric program is unique in the sense that a spanning tree is maintained even though the root changes dynamically. In our program, we choose to update the location of the evader immediately. In [5] three strategies for when to update the location the evader ....

N.S. Chen and S.T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters (IPL), 39:147--151, 1991.

.... based on the 4 state algorithm of Dijkstra [5] and its variation by Ghosh [11] Although our algorithm relies upon an underlying tree network topology it is not less general than the protocol in [13] since a spanning tree of a network can be obtained by a number of self stabilizing algorithms [1] [4], 12] 17] Token passing on a spanning tree thus places no restriction on the topology of the underlying distributed system. The remainder of the paper is organized as follows. In the next section, we introduce the system model and the formal definition of the problem. The token passing ....

....daemon case by showing serializability of simultaneous moves. The algorithm may be applied to distributed systems whose interconnection network is a connected graph by using layering techniques and combining it with one of the well known self stabilizing spanning tree algorithms such as [1] [4]. The algorithm in [13] is a non deterministic depth first search token circulation on a connected network whereas ours is a deterministic token circulation algorithm on tree networks. Furthermore, unlike [13] we formally prove the correctness of our algorithm under the distributed daemon ....

N. Chen, H. Yu, and S. Huang, "A Self-Stabilizing Algorithm for Constructing Spanning Trees," Information Processing Letters, Vol. 39, 1991, pp. 147-151.

....by the system s environment without any outside intervention, assuming that the system is given enough time to do so. Since the work of Dijkstra many papers addressing this topic have appeared, for example [Kru79, BP89, AG92] and many self stabilizing algorithms have been invented, for example [AB89a, AG90, CYH91, Len93]. Reasoning about self stabilization is often complicated and it was not until recently that people attempted to deal with it more formaly. Although people are usually aware of various standard design methods, applying them formally can suddenly be an entirely different experience. Without a ....

....correct value. However, if the process responsible for maintaining d:a:d is executed first it will assign 1 to d:a:d, which is not the correct final value. Indeed, induction is an important technique. In fact, many self stabilizing programs require complicated inductive proofs (for example as in [AB89b, CYH91, Len93]) We will return to above example later in Section 7. There will also be other examples where we show how some intuitive ideas about how to (inductively) decompose a specification are translated to the formal level. Another topic we want to address is compositionality. Consider again the program ....

[Article contains additional citation context not shown here]

N.S. Chen, H.P. Yu, and S.T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39(3):147--151, 1991.

....a distinct identifier to each (anonymous) processor of a uniform system (naming problem) Except in [20] all self stabilizing PIF algorithms in the current literature work on a rooted tree. These protocols assume an underlying self stabilizing rooted spanning tree construction algorithm, [1, 3, 4, 12, 15]. So, to design a reset or snapshot protocol using these self stabilizing PIF algorithms, the PIF algorithms must be modified such that every processor sends messages to all its outgoing links including the links which are not in the spanning tree. A reset al..gorithm for arbitrary networks is ....

N. Chen, H. Yu, and S. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

....In [9] the authors provide a token circulation scheme for arbitrary networks by constructing a spanning tree and implementing the depth rst token circulation scheme on the constructed spanning tree. There exists many selfstabilizing spanning tree construction algorithms in the literature, e.g. [1, 2, 5]. The algorithms proposed in [16, 18, 19] can be combined with any spanning tree construction providing a token circulation scheme for arbitrary networks. Note that the resulting protocol is not necessary a depth rst token circulation for general networks, but it depends on the structure of the ....

NS Chen, HP Yu, and ST Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147-151, 1991.

....c[w] end Figure 2.3: Maximum Flow Tree Protocol: Program of Vertex v 2.3 Correctness Requirements of the Protocol In the next two sections, we prove the correctness of the above maximum flow tree protocol. Our correctness requirements are similar to those given in [AG94] AGH90] and [CYH91]. In particular, we must prove that the protocol satisfies the two properties of closure and convergence stated below. Before we can formally state these properties, we need to define the concepts of protocol states, fixed points, and computations. A state of the protocol is defined by one value ....

....tree, but the protocol does not minimize the depth of each vertex among all maximum flow trees. It is worth noting that if we remove the second and third conditions and do not consider flow (leaving only the first condition) then we arrive at a spanning tree protocol that is similar the one in [CYH91]. If we keep the first condition, remove the second condition and do not consider flow in the third condition, then we arrive at a protocol similar to the one in [AGH90] The program for a vertex v other than the root r is given in Figure 3.2. The program of the root r is exactly the same as in ....

N. S. Chen, F. P. Yu, and S. T. Huang, "A Self-Stabilizing Algorithm for Constructing Spanning Trees," Information Processing Letters, 39 (1991), pp. 147-151.

....[11] a self stabilizing mutual exclusion protocol based on token circulation. They combined two protocols: one to construct a spanning tree and the other to circulate a token in the DFS order over the spanning tree. Other papers dealing with self stabilizing spanning trees constructions include [2, 3, 7, 8, 14]. In the state model, Huang and Chen [15] proposed the rst self stabilizing depth rst token circulation protocol for arbitrary (rooted) networks. The space complexity of their algorithm depends on the number of processors (O(log n) bits) In the state model but assuming that each processor can ....

Chen, N. S.|Yu, H. P.|Huang, S. T.: A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, Vol. 39, 1991, pp. 147-151.

.... coloring planar graphs is in [GK93] while self stabilizing dynamic programming on trees is seen in [GGKP95] The basic approach for achieving self stabilization in tree structured sys9 tems is introduced in [Kru79] while one of many algorithms to construct self stabilizing spanning trees is in [CYH91] with a breadth rst version in [HC92] Work on local adjustments for self stabilization [DH97, GGHP96] is also relevant to our solution of constraint systems. Additional details on modeling self stabilization for dynamic systems is found in [DIM93] In [AVG96] constraints are used in a very ....

N. S. Chen, H. P. Yu, and S. T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147-151, 1991.

....n if t p #= q Figure 2: Superstabilizing tree protocol for processor p know that the system has stabilized, and must make a deterministic choice of edges to be included in the tree. We propose a superstabilizing approach to tree construction, which is a variant of the algorithm proposed in [CYH91]. The protocol given in this section successfully ignores all dynamic changes that add links to an existing spanning tree or crash links not contained in the tree. All trajectories considered in this section are free of crash p or recover p 5 2 events; the number of processors remains fixed at ....

N. S. Chen, H. P. Yu, and S. T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

....such faults and reaches a legitimate state without any external intervention. However, the importance of self stabilizing systems is not limited to their tolerance of transient faults. In many cases, self stabilizing protocols can dynamically adapt to changes in topology of the underlying network [4, 13, 16, 19, 23]. Therefore, such protocols can be thought of as being tolerant to permanent faults, such as the crash of a node or a link, that change the topology of the network. Some self stabilizing protocols [23, 11] have the ability to automatically adjust to dynamic changes in the parameters of a problem ....

....importance for two reasons: i) the dramatic growth in network sizes and (ii) the fact that in practice, a transient fault usually corrupts a small number of components. For example, consider a broadcasting protocol that uses a spanning tree computed by an underlying self stabilizing protocol (see [13] for an example of a self stabilizing spanning tree protocol) A transient fault at a single process, say i, that corrupts the spanning tree information local to i may contaminate the spanning tree information in a large portion 3 of the system, if the fault is not contained. The faulty spanning ....

[Article contains additional citation context not shown here]

N. S. Chen, H. P. Yu, and S. T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

....spanning the entire network. Improving the efficiency of the underlying spanning tree algorithm usually also correspondingly improves the efficiency of the particular task at hand. Note that other constructions of spanning trees in a self stabilizing way are known. Some authors (as in [1] and [4]) have presented algorithms with a central demon. Huang and Chen [9] construct a minimal spanning tree with a distributed demon. Sur and Srimani [12] have presented a similar algorithm but the correctness proof is substantially simpler, based on graph theoretical reasoning. Dolev, Israeli, and ....

Nian-Shing Chen, Hwey-Pyng Yu, and Shing-Tsaan Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

....in work on fault tolerance and regarded self stabilization to be a very important concept in fault tolerance and to be a very 4 fertile field for research . The field has seen tremendous growth in the last ten years. Self stabilizing protocols have been designed for a large variety of problems [3, 5, 7, 9, 11, 12, 13, 14, 17, 18, 21, 22, 23, 27] and underlying principles have also been explored. A survey of some of the basic issues of self stabilization and self stabilizing protocols designed for various problems can be found in [31] The importance of self stabilizing systems in the area of fault tolerance results primarily from their ....

....is acceptable, as long as correct behavior is restored after the faults are over. 5 The importance of self stabilizing systems is not limited to their tolerance to transient faults. In many cases, self stabilizing protocols can dynamically adapt to changes in topology of the underlying network [3, 9, 12, 13, 7]. In such cases, the protocols are also tolerant to permanent faults that change the topology of the network, such as the crash of a node or a link. Since the parameters of a problem can be viewed of as part of the state of a system solving the problem, many self stabilizing protocols are also ....

[Article contains additional citation context not shown here]

N. S. Chen, H. P. Yu, and S. T. Huang, "A self-stabilizing algorithm for constructing spanning trees," Information Processing Letters, Vol. 39, 1991, pp. 147-151.

....from any perturbation (be that a failure or an update sent by the system s environment) without any outside intervention. Since the work of Dijkstra there have been many papers addressing the topic, for example [13, 6, 5] and many self stabilizing algorithms have been invented, for example [4, 8, 14]. Reasoning about self stabilization is often complicated. Most people are aware of various design strategies, yet applying them formally can suddenly be an entirely di erent experience. It was not until recently that people attempt to deal with self stabilization more formally. The rst to ....

....termination we can built the detection program as a layer on top the actual program. 2.2 Inductive Stabilization A self stabilizing system typically relies on some inductive stabilization strategy to reach its goal. The strategy can be simple, or, as in quite many cases, it can be complicated [1, 8, 14]. This strategy is important because it is the heart of the system, and consequently also the center around which the correctness proof of the system is built. Typically, well founded induction on progress is used to formally capture the inductiveness. But stabilization is a stronger property than ....

[Article contains additional citation context not shown here]

N.S. Chen, H.P. Yu, and S.T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39(3):147-151, 1991.

....of initializing distributed systems may no longer be needed, since self stabilizing protocols regain correct behavior regardless of the initial state. Leader election is one of the most fundamental distributed problems and numerous self stabilizing solutions have been provided, such as [1] 3] [6] and [9] Most of these solutions are based on a selfstabilizing tree construction, where the root of the tree becomes the elected node. Our approach is identifier based and it does not need a self stabilizing tree construction. A few previous works concern both self stabilization and cut through ....

N.S. Chen, H.P. Yu and S.T. Huang, "A Self-stabilizing Algorithm for Constructing Spanning Trees," Information Processing Letters, Vol. 39, pp 147--151, 1991.

.... The local synchronizer of [13] synchronizes only two processors, whereas Algorithm NS presented in this paper synchronizes a processor with all its neighbors (parent and children in the tree network) The self stabilizing spanning tree construction algorithms have been proposed in [1] 3] 5] [10], 12] and [15] Any of these algorithms can be combined with our synchronizer to design a synchronizer for a general network. In [14] Gouda and Haddix proposed a selfstabilizing alternator on a chain that transforms any linear system that is stabilizing, but works under a central daemon, to one ....

N. Chen, H. Yu, and S. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

....spanning the entire network. Improving the efficiency of the underlying spanning tree algorithm usually also correspondingly improves the efficiency of the particular task at hand. Note that other constructions of spanning trees in a self stabilizing way are known. Some authors (as in [1] and [4]) have presented algorithms with a central demon. Huang and Chen [9] construct a minimal spanning tree with a distributed demon. Sur and Srimani [12] have presented a similar algorithm but the correctness proof is substantially simpler, based on graph theoretical reasoning. Dolev, Israeli, and ....

Nian-Shing Chen, Hwey-Pyng Yu, and Shing-Tsaan Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

....in some consistent state: consistent i j (l i n) l i = lNeigh i (p i ) 1) 8j 2 C i : lNeigh i (j) l i 1) Intuitively, when consistent i is true, i perceives its children and itself to be each in some legitimate state. 7. A sub protocol (modified from Chen, Yu, and Huang s protocol [1]) is shown in Figure 1. It results from the introduction of image variables. It corresponds to the procedure arbitrary move i in the final version of the protocol (see Figure 3) For x = 1; 2; 3, we denote G x i and A x i correspond to the guard and action of statement S x i . The guards G 1 ....

N. S. Chen, H. P. Yu, and S. T. Huang. A self-stabilizing algorithm for constructing spanning tree. Information Processing Letters, 39:147--151, 1991.

....of the nodes r distinguished as the root, and the protocol is to build a spanning tree with root r. This chapter describes some of the work that were done previously on such protocol. We first present a self stabilizing protocol for constructing a spanning tree, designed by Chen, Yu, and Huang [3]. This is followed by Gupta s modified fault containing version of the protocol [15] The problems with these two versions of protocol are discussed at the end of the chapter. CHAPTER 3. SPANNING TREE PROTOCOL: PREVIOUS WORK 16 3.1 Self Stabilizing Spanning Tree Using the local shared memory ....

....In this and the next section we are proving the self stabilizing and faultcontainment property of the protocol. In certain parts of the proofs that follow, the basic approach or idea may be similar to the proofs given in the previous two protocols for the local shared memory model [3, 15]. However, in Chen, Yu, and Huang s proof they assumed the presence of a central daemon who decides which node is to execute next. In Gupta s proof, on top of the assumption that guard statements are atomic, he also assume that the nodes execute one after another, that is, no two processes execute ....

N. S. Chen, H. P. Yu, and S. T. Huang. A self-stabilizing algorithm for constructing spanning tree. Information Processing Letters, 39:147--151, 1991.

.... for coloring planar graphs is in [GK93] while self stabilizing dynamic programming on trees is seen in [GGKP95] The basic approach for achieving self stabilization in tree structured systems is introduced in [Kru79] while one of many algorithms to construct self stabilizing spanning trees is in [CYH91] with a breadth first version in [HC92] Work on local adjustments for self stabilization [DH97, GGHP96] is also relevant to how we solve constraint systems. Additional details on modeling self stabilization for dynamic systems is found in [DIM93] In [AVG96] constraints are used in a very ....

N.S. Chen, H.P. Yu, and S.T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

No context found.

Nian-Shing Chen, Hwey-Pyng Yu, and Shing-Tsaan Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

No context found.

Nian-Shing Chen, Hwey-Pyng Yu, and Shing-Tsaan Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147--151, 1991.

No context found.

N.S. Chen, H.P. Yu, and S.T. Huang. A Self-Stabilizing Algorithm for Constructing Spanning Trees. Information Processing Letters, 39:147-151, 1991.

No context found.

NS Chen, HP Yu, and ST Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147-151, 1991.

No context found.

N Chen, H Yu, and S Huang. Self-stabilizing algorithm for constructing spanning trees. Inf. Proc. Letters, Vol 39, pages 147-151, 1991.

No context found.

N. S. Chen, F. P. Yu, and S. T. Huang, "A SelfStabilizing Algorithm for Constructing Spanning 7 Trees," Information Processing Letters, 39 (1991), pp. 147-151.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC