Shun-Sheng Wang

Towards a Load Balancing in a three-level cloud computing network

Network bandwidth and hardware technology are developing rapidly, resulting in the vigorous development of the Internet. A new concept, cloud computing, uses low-power hosts to achieve high reliability. The cloud computing, an Internet-based development in which dynamically scalable and often virtualized resources are provided as a service over the Internet has become a significant issue. The cloud computing refers to a class of systems and applications that employ distributed resources to perform a function in a decentralized manner. Cloud computing is to utilize the computing resources (service nodes) on the network to facilitate the execution of complicated tasks that require large-scale computation. Thus, the selecting nodes for executing a task in the cloud computing must be considered, and to exploit the effectiveness of the resources, they have to be properly selected according to the properties of the task. However, in this study, a two-phase scheduling algorithm under a three-level cloud computing network is advanced. The proposed scheduling algorithm combines OLB (Opportunistic Load Balancing) and LBMM (Load Balance Min-Min) scheduling algorithms that can utilize more better executing efficiency and maintain the load balancing of system.

An Integrated Intrusion Detection System for Cluster-based Wireless Sensor Networks

A Wireless Sensor Network (WSN) consists of many low-cost, small devices. Usually, as they are deployed to an open and unprotected region, they are vulnerable to various types of attacks. In this research, a mechanism of Intrusion Detection System (IDS) created in a Cluster-based Wireless Sensor Network (CWSN) is proposed. The proposed IDS is an Integrated Intrusion Detection System (IIDS). It can provide the system to resist intrusions, and process in real-time by analyzing the attacks. The IIDS includes three individual IDSs: Intelligent Hybrid Intrusion Detection System (IHIDS), Hybrid Intrusion Detection System (HIDS) and misuse Intrusion Detection System. These are designed for the sink, cluster head and sensor node according to different capabilities and the probabilities of attacks these suffer from. The proposed IIDS consists of an anomaly and a misuse detection module. The goal is to raise the detection rate and lower the false positive rate through misuse detection and anomaly detection. Finally, a decision-making module is used to integrate the detected results and report the types of attacks.

A Three-Phases Scheduling in a Hierarchical Cloud Computing Network

Network bandwidth and hardware technology are developing rapidly, resulting in the vigorous development of the Internet. A new concept, cloud computing, uses low-power hosts to achieve high usability. The cloud computing refers to a class of systems and applications that employ distributed resources to perform a function in a decentralized manner. Cloud computing is to utilize the computing resources (service nodes) on the network to facilitate the execution of complicated tasks that require large-scale computation. Thus, the selecting nodes for executing a task in the cloud computing must be considered. However, in this study, a three-phases scheduling in a hierarchical cloud computing network is advanced. The proposed scheduling can utilize better executing efficiency and maintain the load balancing of system.

Achieving efficient agreement within a dual-failure cloud-computing environment

Fault-tolerance is an important research topic in the study of distributed systems. To counter the influence of faulty components, it is essential to reach a common agreement in the presence of faults before performing certain tasks. However, the agreement problem is fundamental to fault-tolerant distributed systems. In previous studies, protocols dealing with the agreement problem have focused on a fully connected network or on a general connectivity. However, cloud-computing, an Internet-based development in which dynamically scalable and often virtualized resources are provided as a service over the Internet has become a significant issue. In a cloud-computing environment, the connected topology is not very significant. Therefore, previous protocols for the agreement problem are not suitable for a cloud-computing environment. To enhance fault-tolerance, the agreement problem in a cloud-computing environment is revisited in this study. The proposed protocol is called the Dual Agreement Protocol of Cloud-Computing (DAPCC). DAPCC achieves agreement on a common value among all nodes in a minimal number of message exchange rounds, and can tolerate a maximal number of allowable faulty components in a cloud-computing environment.

Towards a hybrid load balancing policy in grid computing system

Grid computing has become conventional in distributed systems due to technological advancements and network popularity. Grid computing facilitates distributed applications by integrating available idle network computing resources into formidable computing power. As a result, by using efficient integration and sharing of resources, this enables abundant computing resources to solve complicated problems that a single machine cannot manage. However, grid computing mines resources from accessible idle nodes and node accessibility varies with time. A node that is currently idle, may become occupied within a second of time and then be unavailable to provide resources. Accordingly, node selection must provide effective and sufficient resources over a long period to allow load assignment. This study proposes a hybrid load balancing policy to integrate static and dynamic load balancing technologies. Essentially, a static load balancing policy is applied to select effective and suitable node sets. This will lower the unbalanced load probability caused by assigning tasks to ineffective nodes. When a node reveals the possible inability to continue providing resources, the dynamic load balancing policy will determine whether the node in question is ineffective to provide load assignment. The system will then obtain a new replacement node within a short time, to maintain system execution performance.

Hybrid Intrusion Detection System for enhancing the security of a cluster-based Wireless Sensor Network

Recent advances in Wireless Sensor Networks (WSNs) make them more important to apply. Therefore, security issues are more significant in WSNs. WSNs are susceptible to some types of attacks since they are consisted of cheap and small devices and are deployed in open and unprotected environments. In this research, an Intrusion Detection System (IDS) created in cluster head is proposed. The proposed IDS is a Hybrid Intrusion Detection System (HIDS). It consists of anomaly and misuse detection module. The goal is to raise the detection rate and lower the false positive rate by the advantages of misuse detection and anomaly detection. However, a decision-making module is used to integrate the detect results and to report the types of attacks.

Reaching Agreement among Virtual Subnets in Hybrid Failure Mode

Fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence of faulty components, reaching a common agreement in the presence of faults before performing certain tasks is essential. However, the Byzantine Agreement (BA) problem is a fundamental problem in fault-tolerant distributed systems. In previous studies, protocols dealing with the BA problem focused on static networks; however, these do not perform well in dynamically changing mobile networks. The most well known mobile network is the Mobile Ad-hoc Network (MANET). To enhance fault-tolerance and MANET reliability, the BA problem in virtual subnets of MANET is revisited in this paper. The proposed protocol is called the Hybrid Agreement Protocol (HAP). It achieves agreement on a common value among all functional mobile processors in a minimal number of message exchange rounds, and can tolerate a maximal number of allowable faulty components in the virtual subnet of MANET.

An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network

Mobile ad hoc NETworks (MANETs) are becoming more popular due to the advantage that they do not require any fixed infrastructure, and that communication among processors can be established quickly. For this reason, potential MANET applications include military uses, search and rescue and meetings or conferences. Therefore, the fault-tolerance and reliability of the MANET is an important issue, which needs to be considered. The problem of reaching agreement in the distributed system is one of the most important areas of research to design a fault-tolerant system. With an agreement, each correct processor can cope with the influence from other faulty components in the network to provide a reliable solution. In this research, a potential MANET with a dual failure mode is considered. The proposed protocol can use the minimum number of rounds of message exchange to reach a common agreement and can tolerate a maximum number of allowable faulty components to induce all correct processors to reach a common agreement within the MANET.

Achieving high efficient agreement with malicious faulty nodes on a cloud computing environment

The reliability of the distributed system has been an important topic of research. Agreement protocols, which allow the correct nodes to agree on a common value, have been brought up to aid the reliable execution of tasks. In previous works, fully connected networks, generalized connected networks or multicastinge components were proposed to solve the agreement problem. Recently, a new concept of distributed computing, cloud computing, is proposed to provide several services. The cloud computing that can make more application for user from the internet. Unfortunately, existing agreement problem and results cannot cope with the new computing environment and the agreement problem thus needs to be revisited. In this paper, a new protocol is proposed to adapt to the cloud computing environment and derive its bound of allowable faulty components.

An Optimal Solution of Byzantine Agreement in a Scale Free Network

With the fast development of Internet, in order to increase systematic operation ability, the distributed system has replaced the large-scale computer system gradually. In generally, the task in a distributed system must achieve an agreement. Such a unanimity problem is called the Byzantine agreement (BA). The BA problem is one of the most important problems in designing a fault-tolerant distributed system. Traditionally, this problem was well formulated in a random network. However, in recently, many large complex networks have emerged and displayed a scale free feature. It is an important topic that can represent the structure of highly fault-tolerant ability in the scale free network (SFN). In our research, the BA problem is revisited in a SFN. The proposed protocol uses the minimum number of message exchanges to reach an agreement within the distributed system while tolerating the maximum number of faulty components in SFN.