Budan Wu

Integrating RESTful Service into BPEL Business Process on Service Generation System

New value-added business, generated by Web service composition in BPEL, provides more powerful and flexible features. SOAP-based web services invoked in BPEL are heavy with redundant information and lower performance. RESTful Web service is brought forward to new value-added business as an alternative solution. However, its a big challenge to compose RESTful Web services with SOAP-based Web Services in SOA BPEL business processes. BPEL is not designed to use RESTful Web services because these types of services do not use WSDL to describe themselves. This paper proposes a novel approach for integrating RESTful Web services and SOAP-based Web services in business processes described in BPEL. The approach is applied to a practical multimedia conference BPEL process, and the experimental data show the stability of the new RESTful BPEL process with a higher performance.

A New Ontology-Based Service Matching Algorithm

Service discovery is the process of finding suitable services and selecting the best alternative for a given task, and service matching algorithm is the kernel technology of the step. Nowadays there are no quantity index of service Query Complete Rate (QCR) and Query Accuracy Rate (QAR), and the efficiency of service matching is low. This paper defines QCR and QAR, and provides a new ontology-based service matching algorithm that uses the theory of query rewriting from key-words to ontology to select suitable services.

A Security PaaS Container with a Customized JVM

PaaS is known as an application engine which third party developers can deploy their application onto. Security of PaaS becomes important as applications shares resources. How to secure and isolation the resources become an important topic. In this paper, a security PaaS container is proposed which is based on a customized JVM. This container is fully implemented and evaluated in real setting.

lightEPC: A Formal Approach for Modeling Personalized Lightweight Event-Driven Business Process

A considerable number of business process modeling approaches are developed for end-users in recent years. The core issue of end-user oriented business process modeling is how to fill the gap between end-user friendly business process model and professional IT process model. In our previous work, a wizard based lightweight event-driven modeling method is designed for end-users to create their own personalized process. We observe that such a process created by end-users often cause execution time errors, which cannot be effectively detected by existing modeling languages. In this paper, we propose a formal model based on extended event-driven process chain (eEPC), which is named lightweight event-driven process chain (lightEPC). We give complete formalization of lightEPC and present two error patterns and corresponding detection algorithms to perform design-time model checking based on this model. These approaches effectively help end-users to create correct business process satisfying their personalized requirements.

A Measure Standard for Ontology-Based Service Recommendation

Web Service is becoming the next generation of web-based application. With enhancement of quality of services and increasing quantity of services, how to recommend the suitable services according to personalized requirement becomes an urgent question. In the existing approaches of service recommendation, the result of service recommendation is the service list in which there is no evaluation standard that we can use to distinguish services with high relevancy and low relevancy. So in real-world, the user may obtain low relative services. To address the problem, in this paper, membership function is analyzed and recommendation measure standard is proposed. With dynamic programming theory, an ontology based approach of service recommendation is provided. In the result of service recommendation, membership as measure index is used to divide high relative services, medium relative services and low relative services. High relative services are recommended to the user. So the recommended services are accurate and available.

Critical Nodes Detecting in Virtual Networking Environment

As cloud computing goes, How to provide a security cloud becomes an important problem. Virtual networking plays an important role in cloud computing infrastructure. To identify which node is a critical node become an important research question. In this study, our team analyzed the fat tree network and small-world network, and proposed a network modeling method for the virtual networking. On this basis, we analyze time performance and detecting accuracy of the two critical nodes detecting algorithms. One is based on depth-first search, while the other concentricity analysis.

EKMPC: Enhanced KMP Allocation for Virtual Network Service Provision in Cloud

Resource Virtualization is one of major capabilities in cloud. Computing and Storage virtualization is widely used in cloud. Networking virtualization becomes a trend of cloud computing. In past, user can only request a networking resource offline, virtual network can be allocation as needed. Allocating the network on demand will become a challenge for network. In this work in progress study, we propose an Enhanced KMP (Knuth-Morris-Pratt) algorithm for Virtual Network Allocation in cloud (EKMPC), which use the concept of KMP.

Dynamic Integration Mechanism of Business Process for Internet of Things

For adapting to the dynamic characteristics of Internet of Things, a dynamic integration mechanism of business process has been proposed. The mechanism realizes redirecting and restructuring of process logic using rules that can be edited at runtime. A dynamic integration algorithm is designed to implement this mechanism. First, the algorithm creates a state transition digraph based on the current rules. Then, it finds a path to meet business objectives according to the current states. Finally, it performs services sequence obtained from the path to complete the business objectives. Our proposed method has a high flexibility, and process logic can easily be redirected according to different requirements.

An Auto Window Filter Algorithm for Resource Monitoring in Cloud

Cloud computing provide computing resource on demand which helps people to make full use of legacy computing asset. Resource provision is transparent to user but not to provider. Computing provider need to aware of resource utilization. How to monitoring resource utilization become an important problem in cloud computing. In this study, we propose a monitoring architecture and a monitoring model. An Auto window filter algorithm is introduced to help reduce the network traffic.

The Location and Capacity of Distributed Generation Based on Genetic Algorithm

Distributed generation (DG) has a certain impact on grid power flow, network loss, and power supply reliability when it accesses power gird. Its location directly affects operating efficiency of distribution network. The traditional location optimization algorithm is generally studied for the constant output of distributed generation. Based on the original research, a genetic algorithm based on total cost of grid operation as objective function is proposed. The algorithm simplifies and evaluates the external characteristics of the distributed generation and establishes the analysis model. The chromosome coding, crossover, mutation and other operations about distributed generation is achieved based on this implementation, and then match the genetic algorithm model. By analyzing power grid system of IEEE 33 nodes and comparing the existing research, the method proposed in this paper has been proved. This model with genetic algorithm has practical significance in reducing economic operating costs and optimizing parameters of power grid with distributed generation.