• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.109-116
• /
• 2007

Nowadays, with the proliferation of Web services, developer and user can implement a complex application by composing registered Web services. In this trend, the quality of service of a composite Web service is of crucial importance for today's Service Oriented Computing (SOC) environment. But the global optimization of a composite Web service satisfying given QoS is classified to NP-hard problem. To solve this problem, we propose K-way Super node approach and show the effect of it from experimental results.

• 한국경영정보학회:학술대회논문집
• /
• 2007.11a
• /
• pp.377-382
• /
• 2007

To transform the enterprise system into the 'Real Time Enterprise' with respect to IT, I suggest the conceptual application model which is composed of pieces(components) extracted from different packaged applications working in a heterogeneous environment based on the 'business activity' in other words, business services provided by internal (inter-enterprise) and external (extended enterprise) application to support a business activity within in an enterprise and the design mechanism focusing service tier which acts as intermediate tier within application architecture.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1841-1861
• /
• 2011

The advance in Service-Oriented Architecture (SOA) and web services has led to the development of new types of a system in which heterogeneous service components can connect and compose to solve a complex business problem. In the SOA, even though these service components are valid in their functionality, there is a need to test their behaviors when those services are composited. In recent years, WS-BPEL has received a wide acceptance as a means of integrating distributed service components. To test the composite service, the existing testing techniques have been focused on the functional features based on the WS-BPEL process. However as SOA approach is applying to real-time software development, the performance of composite service becomes one of important issues. This paper proposes a technique to the performance testing of a composite service with WS-BPEL extension which combined with the concept of aspect. Our WS-BPEL extension has been made towards annotating aspect component which is measuring the response time of the composite service. This paper also explains the procedure of performance testing with on-line transaction system. Our technique can apply to choose an adequate component in service composition with considering the performance among several candidate web service components.

• Journal of the Korea Society for Simulation
• /
• v.16 no.4
• /
• pp.77-86
• /
• 2007

Web services are considered as the critical component in the business plans of corporations as they offers the potential for creating highly dynamic and versatile distributed applications that span across business boundaries. Web Service Orchestration studies composition of already-existing web services to create new value-added services. The composite web services could be executed in a centralized or peer-to-peer(P2P) orchestration model. Compared with centralized-orchestration model, the P2P-based orchestration model provides better scalability, reliability, and performance for the overall services. However, recent P2P-orchestration solutions have limitation in supporting complex workflow patterns. Therefore, they could not effectively handle sophisticated business workflow, which contains complex workflow patterns. In this paper, we propose the WORKGLOW system, which can deal with complex workflow patterns while it is able to perform composite services in P2P orchestration manner. Comparing with centralized orchestration systems, the WORKGLOW brings up more business logic advantages, better performance, and higher flexibility with only a little overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.971-989
• /
• 2015

With the development of cloud computing, more and more Web services are deployed on geo-distributed datacenters and are offered to cloud users all over the world. Through service composition technologies, these independent fine-grain services can be integrated to value-added coarse-grain services. During the composition, a number of Web services may provide the same function but differ in performance. In addition, the distribution of cloud datacenters presents a geographically dispersive manner, which elevates the impact of the network on the QoS of composite services. So it is important to select an optimal composition path in terms of QoS when many functionally equivalent services are available. To achieve this objective, we first present a graph model that takes both QoS of Web services and QoS of network into consideration. Then, a novel approach aiming at selecting the optimal composition path that fulfills the user's end-to-end QoS requirements is provided. We evaluate our approach through simulation and compare our method with existing solutions. Results show that our approach significantly outperforms existing solutions in terms of optimality and scalability.

• Journal of Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.89-104
• /
• 2012

In dynamic Web service environments, the performance of the Internet is unpredictable; the reliability and effectiveness of remote Web services are also unclear. Therefore, it can hardly be guaranteed that the quality of Web service (QoWS) attributes of Web services do not fluctuate with the dynamic Web service environments. When a composite service is planned in the context of dynamic service environments, there is another aspect which has not been taken into account by existing works, namely, concurrency - the fact that multiple requests to a composite service may arrive at the same time. Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service selection scheme which adopts top-k dominating queries to generate a composition solution rather than only select the best composition solution for a given request. The experimental results have investigated the efficiency and effectiveness of our approach and shown that it outperforms baseline and traditional methods for service selection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.187-199
• /
• 2009

With the advent of Web 2.0, OpenAPIs are becoming an increasing trend to emphasize Web as platform recently. OpenAPIs are used to combine services and generate new services by mashup. However because the standard documents for OpenAPIs do not exist, it may restrict the use of OpenAPIs. Previous studies of OpenAPIs mashup have been limited to tool design or language definition for service combination rather than dynamic composition. On the other hand, Web services that are a software technology implementing SOA provide standard documents such as WSDL to explain each service, UDDI to register it, and SOAP to transfer messages. Thus Web applications can interpret and execute services by using these technologies. Recent works have also been performed to provide semantic features and dynamic composition for SOA. If a dynamic and systematic approach is provided to combine Web services and OpenAPIs, Web applications can provide users with diverse services. In this study, we present a SOA based framework for mashup of OpenAPIs and Web services. The framework supports dynamic composition of OpenAPIs and Web services, where the process of composite services is described in OWL-S. A prototype is provided to validate our framework. The framework is expected to add diversity to typical Web services.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.43-52
• /
• 2007

As the number of public Web Services increases, there will be many services with the same functionality. These services. however, will vary in their QoS properties, such as price, response time and availability, and it is very important to choose a best service while satisfying given QoS constraints. This paper brings parallel branching and response time constraint of business processes into focus and investigates several service selection plans based on multidimensional multiple choice Knapsack model. Specifically. proposed in the paper are a plan with response time constraints for each execution flow, a plan with a single constraint over the whole service types and a plan with a constraint on a particular execution path of a composite Web Services. Experiments are conducted to observe the performance of each plan with varying the number of services, the number of branches and the values of response time constraint. Experimental results show that reducing the number of candidate services using Pareto Dominance is very effective and the plan with a constraint over the whole service types is efficient in time and solution quality for small to medium size problems.

• Steel and Composite Structures
• /
• v.6 no.1
• /
• pp.15-31
• /
• 2006

Beams with web openings are an attractive system for multi-storey buildings where it is always desirable to have long spans. The openings in the web of steel beams enable building services to be integrated within the constructional depth of a floor, thus reducing the total floor depth. At the same time, the increased beam depth can give high bending moment capacity, thus allowing long spans. However, almost all of the research studies on web openings have been concentrated on beam behaviour at ambient temperature. In this paper, a preliminary numerical analysis using ABAQUS is conducted to develop a general understanding of the effect of the presence of web opening on the behaviour of steel beams at elevated temperatures. It is concluded that the presence of web openings will have substantial influence on the failure temperatures of axially unrestrained beams and the opening size at the critical position in the beam is the most important factor. For axially restrained beams, the effect of web openings on the beam's large deflection behaviour and catenary force is smaller and it is the maximum opening size that will affect the beam's response at very high temperatures. However, it is possible that catenary action develops in beams with web openings at temperatures much lower than the failure temperatures of the same beam without axial restraint that are often used as the basis of current design.