Che-Cheng Chang

Learn More
The agreement problem is usually exploited to improve the fault-tolerant capability of software systems. For self-organized networks like cloud computing architectures that possess highly decentralized and self-organized natures, consensus, which is essential to solving the agreement problem, in such networks cannot be achieved in the ways for traditional(More)
The Distributed Trigger Counting (DTC) problem is o raise an alert while the number of riggers received by the whole system reaches a pre-defined amount. There have been several algorithms proposed to solve such a problem in the literature. However, these existing algorithms are all under the assumption that here is no even regarding process moving, leaving(More)
The distributed trigger counting (DTC) problem is to raise an alert while the number of triggers received by the system reaches a pre-specified amount. Particularly, there have been several algorithms proposed to solve the DTC problem in the literature. However, these existing algorithms are all under the assumption that each node knows what kind of(More)
Placing replicas in a P2P network can reduced the number of hops required by a node to search an object. One existing replica placement strategy for structured P2P networks allocates replicas at nodes that are continuously close to the destination. In this paper, we investigate the effectiveness of such an approach. We propose an optimal algorithm to place(More)
For self-organized networks that possess highly decentralized and self-organized natures, neither the identity nor the number of processes is known to all participants at the beginning of the computation because no central authority exists to initialize each participant with some context information. Hence, consensus, which is essential to solving the(More)