K.Q. Yan

The Anatomy Study of Load Balancing in Distributed System

In recent years, network bandwidth and quality has been drastically improved in a speed even much faster than the enhancement of computer performance. Various communication and computing tasks in the fields can be integrated and applied in a distributed system in nowadays. However, those resources are heterogeneous and dynamic in distributed systems connecting a broad range of resources. This study proposed a hybrid load balancing policy to maintain performance and stability of distributed system

Enhance the stability of MANET by using Mobile Agent

In recent years, people are more rely on wireless network services so that they may obtain latest information at any time anywhere. Of wireless networks, to effectively allow several or more mobile devices to send data with one another has become an important research topic. In our research, the Mobile Agent is adapted to assists Mobile Host within the working area, and takes advantage of Active Route-Maintenance Protocol to ensure the stability of routing path.

Reaching Byzantine Agreement in a Processor Fallible Virtual Subnet Network

Mobile ad-hoc network (MANET) is practical more and more due to it can provide processor joins to the network or leaves away anytime with non-infrastructure. Further, the fault-tolerance and reliability of the MANET has also been an important topic. The problem of reaching agreement in the distributed system is one of the most important issues to design a fault-tolerance system. In previous works, reach a common agreement among correct processors to cope with the influence from faulty components is significant in a fault-tolerance system. In this paper, the agreement problem is revisited in a MANET, which the processors maybe subject to malicious failure

Visiting the New Territory of Interactive Consistency

Conventional, Interactive Consistency (IC) problem is revisited the IC problem with the assumption of link failure on dormant faults and malicious faults. A simple and efficient algorithm is proposed. The complexity of information exchange required by the algorithm is O(n(superscript 2)).The algorithm uses minimum number of rounds to achieve an IC and can tolerate maximum number of allowable faulty components.

Consensus problem on a generalized network connected by unreliable transmission media

Summary form only given. The authors consider a distributed system in which all processors are reliable during the consensus execution, while the message TMs (transmission mediums) may be distributed by noise or an intruder and the exchange message altered maliciously. By definition, if consensus can be reached under the symptom of malicious fault, the other cases of fault assumption are solved. Therefore, an efficient and reliable protocol is proposed, and its efficiency and reliability are proved. The common term round is used to denote the interval of a message exchange. The proposed protocol, GLINK, can tolerate the maximal number of faulty TMs and requires only two rounds. Protocol GLINK achieves consensus by using two phrases: the message exchange phase, which requires only two rounds, and the decision-making phase, for which no rounds are required.<<ETX>>