Tong-Ying Tony Juang

Learn More
—We present an optimistic crash recovery technique without any communication overhead during normal operations of the distributed system. Our technique does not append any information to the application messages, it does not suffer from the domino effect, and each processor rolls back at most once during recovery. We present three distributed rollback(More)
[6] R. K. Yedavalli, " Improved measures of stability robustness for linear state space models, " IEEE Trans. Reduced conservatism in stability robustness bounds by state transformation, " IEEE Trans. Automat. Stability robustness bounds for state-space modes with structured uncertainty, " IEEE Trans. Automat. Robust stability bounds on time-varying(More)
—In this paper 1 , a new approach is proposed to reduce handoff operation in IEEE 802.16e network. Traditional mobile approaches, such as mobile IPv6 (MIPv6) and hierarchical MIPv6 (HMIPv6), can support smoothly handoff. These approach, ,unfortunately, suffer large handoff delay and packet lost in macro mobility for mobile users. With the aid of the partner(More)
Trees are a common structure to represent the inter-task communication pattern of a parallel algorithm. In this paper, we consider the embedding a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: i) a congestion-free, dilation-2, load-1 embedding of a level-p binary tree, and ii) a(More)
1 Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. In this paper, we develop a new multicasting model for such networks based on the concept of Euler path/circuit in graph theory. The model can support multiple concurrent multicasts freely from deadlock and can be applied(More)
The arrangement graph A nYk is not only a generalization of star graph (n À k ˆ 1), but also more ¯exible. In this investigation, we elucidate the problem of embedding of multiple spanning trees in an arrangement graph with the objective of congestion-free. This result is to report how to exploit 2…n À k† edge disjoint spanning trees in an arrangement(More)
In this paper, we propose three strategies for building a multicasting tree in a high-speed network. These strategies can be used in any network topology. The rst one is based on voting, the second based on constructing a minimum spanning tree, and the third based on repeatedly constructing multiple minimum spanning trees. To demonstrate the eeectiveness of(More)