面向QoS全局优化的大规模Web服务组合方法

把多个简单Web服务组合成为更强大的组合Web服务是面向服务计算的目标之一。由于存在多个功能相同但服务质量属性不同的候选Web 服务,因此需要针对服务质量要求进行服务组合。鉴于Web服务组合规模的不断增长和特定领域的时限要求,面向实时大规模Web服务组合问题的快速收敛算法尤为重要,然而目前相关工作还很少。论文提出一种新的Web服务组合算法GAELS（Genetic Algorithm Embedded Local Searching）,运用高适应度初始种群和局部搜索的变异策略,加快收敛速度。通过实验评测表明与简单遗传算法相比,GAELS算法能更快得到近似最优解,且随着服务规模增长,拥有更好的适应性。     

Component meets service: what does the mongrel look like?

Computing with services has attracted much attention as a promising approach for developing distributed applications. The approach is often advertised as being superior to distributed component-based software engineering (CBSE), because it provides a higher potential to bridge heterogeneous IT application and infrastructure landscapes. It facilitates cross-institutional cooperation, lets services run over all kinds of ubiquitous communication infrastructure, scales better and simplifies legacy software integration. If this were absolutely true, there would be no reason for a consortium of major vendors of service and Java EE technology to come up with a new specification, called service component architecture (SCA). This emerging standard tries to leverage service-oriented architecture (SOA) principles with component-based software development techniques. In this article we discuss some commonalities and fundamental differences of the CBS and SOA worlds. We illustrate SCA briefly using snippets of an ongoing case study based on an e-university federation. Then we elaborate on the qualities and current deficits of SCA in the light of CBSE findings and related works.     

An adaptive algorithm for QoS-aware service composition in grid environments

Service composition enables users to realize their complex needs as a single request and it has been recognized as a flexible way for resource sharing and application integration since the appearance of Service-Oriented Architecture (SOA). For each of the needed individual services there may be many candidate services available presented by different vendors and with different functional and non-functional properties such as Quality of Service (QoS). Approaches are needed to select candidate services with various QoS levels according to user’s performance requirements meanwhile adapt to dynamic churn in grid environments. This paper mainly focuses on adaptive management of QoS-aware service composition in grid environments and proposes an adaptive algorithm for QoS-aware service composition (AQSC). In AQSC we model this problem as the Multi-Constrained Optimal Path selection problem (MCOP) and use heuristic approach for service selection, then backup services set is introduced as an adaptive mechanism so as to ensure the fulfillment of composite service when some candidate services fail or withdraw. Both theoretical analysis and simulation results indicate that AQSC has high composition success rate, finish rate and low cost.     

A service composition approach based on sequence mining for migrating e-learning legacy system to SOA

With the fast development of business logic and information technology, today's best solutions are tomorrow's legacy systems. In China, the situation in the education domain follows the same path. Currently, there exists a number of e-learning legacy assets with accumulated practical business experience, such as program resource, usage behaviour data resource, and so on. In order to use these legacy assets adequately and efficiently, we should not only utilize the explicit assets but also discover the hidden assets. The usage behaviour data resource is the set of practical operation sequences requested by all users. The hidden patterns in this data resource will provide users' practical experiences, which can benefit the service composition in service-oriented architecture (SOA) migration. Namely, these discovered patterns will be the candidate composite services (coarse-grained) in SOA systems. Although data mining techniques have been used for software engineering tasks, little is known about how they can be used for service composition of migrating an e-learning legacy system (MELS) to SOA. In this paper, we propose a service composition approach based on sequence mining techniques for MELS. Composite services found by this approach will be the complementation of business logic analysis results of MELS. The core of this approach is to develop an appropriate sequence mining algorithm for mining related data collected from an e-learning legacy system. According to the features of execution trace data on usage behaviour from this e-learning legacy system and needs of further pattern analysis, we propose a sequential mining algorithm to mine this kind of data of the legacy system. For validation, this approach has been applied to the corresponding real data, which was collected from the e-learning legacy system; meanwhile, some investigation questionnaires were set up to collect satisfaction data. The investigation result is 90% the same with the result obtained through our approach.     

Dynamic real-time scheduling strategies for interactive continuous media servers

In this paper, we propose and study a dynamic approach to schedule real-time requests in a video-on-demand (VOD) server. Providing quality of service in such servers requires uninterrupted and on-time retrieval of motion video data. VOD services and multimedia applications further require access to the storage devices to be shared among multiple concurrent streams. Most of the previous VOD scheduling approaches use limited run-time,0 information and thus cannot exploit the potential capacity of the system fully. Our approach improves throughput by making use of run-time information to relax admission control. It maintains excellent quality of service under varying playout rates by observing deadlines and by reallocating resources to guarantee continuous service. It also reduces start-up latency by beginning service as soon as it is detected that deadlines of all real-time requests will be met. We establish safe conditions for greedy admission, dynamic control of disk read sizes, fast initial service, and sporadic services. We conduct thorough simulations over a wide range of buffer capacities, load settings, and over varying playout rates to demonstrate the significant improvements in quality of service, throughput and start-up latency of our approach relative to a static approach.     

Experimental evaluation of behavior-based failure-detection schemesin real-time communication networks

Effective detection of failures is essential for reliable communication services. Traditionally, non-real-time computer networks have relied on behavior-based techniques for detecting communication failures. That is, each node uses heartbeats to detect the failure of its neighbors and the end-to-end transport protocol (e.g., TCP) achieves reliable communication by acknowledgment/retransmission. Recently, there has been a growing demand for reliable “real-time” communication, but little research has been done on the failure detection problem. In this paper, we present two behavior-based failure-detection schemes-neighbor detection and end-to-end detection-for reliable real-time communication services and experimentally evaluate their effectiveness. Specifically, we measure and analyze the coverage and latency of these detection schemes through fault-injection experiments. The experimental results have shown that nearly all failures can be detected very quickly by the neighbor detection scheme, while the end-to-end detection scheme uncovers the remaining failures with larger detection latencies     

Composing semantic Web services under constraints

Web service composition is an inevitable aspect of Web services technology, which solves complex problems by combining available basic services and ordering them to best suit the problem requirements. Automatic composition gives us flexibility of selecting best candidate services at composition time satisfying QoS requirements; this would require the user to define constraints for selecting and composing candidate Web services. In this work, a Web service composition approach is presented in which a rich set of constraints can be defined on the composite service. The output of the framework is the schedule of Web service composition in which how and when services are executed is defined. The basic properties of the proposed approach is converting Web service composition problem into a constraint satisfaction problem in order to find the best solution that meets all criteria defined by user and providing semantic compatibility and composability during composition.     

Toward the automation of a QoS-driven SLA establishment in the Cloud

Composite software as a service (SaaS)-based SOA offers opportunities for enterprises to offer value-added services. The cornerstone for such a business is service level agreements between Cloud customers and Cloud providers. In spite of the hype surrounding composite SaaS, standardized methods that enable a reliable management of service level agreements starting from the SLA derivation from the customer requirements to the SLA establishment between the two stockholders are still missing. To overcome such a drawback, we propose a method for SLA establishment guided by QoS for composite SaaS. Our method provides: (1) a requirement specification language for the Cloud customer to define the composition schemas of the requested services along with its QoS constraints; (2) a Cloud provider offer specification language and method to help in identifying the services and resources that satisfy the customer requirements; and (3) an SLA document definition language and method to specify a deployable composite SaaS on the Cloud. Our approach for SLA establishment embraces model-driven architecture principles to automate the SLA document generation from the customer requirements document. The automation is handled through model transformations along with enrichment algorithms to ensure the generation of complete SLA documents.     

一种基于本体的分布式面向服务的体系结构风格

语义Web服务,作为本体技术与面向服务的体系架构的完美结合,已经成为语义Web和面向服务的软件工程的一个重要研究方向。OWL-S和WSMF等语义Web服务方法,为Web服务描述标准（WSDL）,提供了基于本体的框架,从而实现服务的自动化发现、调用和组合。但基于原有语义Web服务方法,处理组合服务时,对子服务构件之间通信的建模缺乏实际意义上的语义。基于本体和P2P技术,建立一套通用的分布式的面向服务的体系结构——DisOntoSOA。DisOntoSOA不局限于任何一种编程语言和任何一种特定的Web服务技术。因此,只要是结合本体与SOA的方法,都适用于该体系。     

服务合成的性能预测

One benefit of SOA is from service composition which combines existing services to form a new valued-added service in the form of business process. This also creates the need to ensure that the performance of those composite services meets the business requirements. This paper proposes a method for evaluating the performance of composite services. We automatically transform a composite service modeled by BPEL, into a performance model based on Layered Queuing Networks (LQN) and then leverage existing LQN solvers to predict their performance. The inputs to our transformation algorithm are an XML file which contains a service composition model complying with the BPEL4WS specification, a related performance profile and a service topology. The output of the model is the corresponding LQN model which can be directly analyzed using existing LQN solvers.     

基于SOA企业应用集成框架研究与实现

通过深入分析传统的企业应用集成(EAI)优势与不足,将Web服务技术、SOA引入到EAI领域,提出了采用SOA模型的企业应用集成框架,并讨论了相关的支撑技术,给出了Web服务集成实现模型--网络通信层、消息传输层、服务描述层,服务发现层、服务保证层和服务组合层.为用户提供一个灵活;松耦合、跨平台、分布式、可扩展的基础集成服务平台.     

用于科技基础条件平台的服务合成研究与应用

Web服务之间的交互是面向服务的体系结构（Service-Oriented Archimcmre,SOA,也称为面向服务架构）中的关键问题。单个Web服务提供的功能往往不能完全满足用户的实际需求．将多个Web服务进行合成实现功能更为强大的服务是SOA必须要解决的问题之一。分析了Web服务合成的研究现状,介绍了Web服务合成方式的分类和商业流程执行语言BPEL4WS,给出了“科技基础条件平台应用服务支撑系统”项目中SOA的设计方案．描述了Web服务合成的关键步骤。该研究成果成功地应用于科技基础条件平台应用服务集成之中,并已通过科技部的前期验收     

基于Dijkstra算法的Web服务合成选择策略研究

Web服务合成中操作的选择是一个关键问题,这直接影响到用户对合成的复合服务的满意度、解决该问题的关键是对候选Web服务的输入输出数据关系进行建模,以及有效利用这些已有的数据依赖关系实现服务合成的请求。通过从Web服务规范语言中提取Web服务的语义信息．掏建Web服务的有向图,并分析Diikstra算法用于Web服务合成的问题。提出了相应的船决办法,给出了一个基于Diikstra算法的Web服务合成选择策略的算法。该算法能在合成中选择最恰当的操作组合．产生最终的复合服务。     

A monolithic approach to automated composition of semantic web services with the Event Calculus

In this paper, a web service composition and execution framework is presented for semantically -annotated web services. A monolithic approach to automated web service composition and execution problem is chosen, which provides some benefits by separating composition and execution phases. An AI planning method using a logical formalism, namely Abductive Event Calculus, is chosen for the composition phase. This formalism allows one to generate a narrative of actions and temporal orderings using abductive planning techniques given a goal. The functional properties of services, namely input/output/precondition/effects (IOPE) are taken into consideration in the composition phase and non-functional properties, namely Quality of Service (QoS) parameters are used in selecting the most appropriate solution to be executed. The repository of OWL-S semantic web services are translated to the Event Calculus axioms and the resulting plans found by the Abductive Event Calculus Planner are converted to graphs. These graphs can be sorted according to a score calculated using the defined quality of service parameters of the atomic services in the composition to determine the optimal solution. The selected graph is converted to an OWL-S file which is executed consequently.     

Web服务组合测试综述

随着面向服务技术和云计算技术的不断成熟,尤其是面向服务体系结构SOA的不断完善以及推广,使得其主要内容Web服务已经被广泛应用.为了充分利用Web服务并解决单个Web服务的功能有限的问题,业界将多个原子Web服务按照一定的规则和业务逻辑进行组合,以提供更多功能更强大的服务,实现了Web服务的增值和复用.为保证Web服务组合的质量,需要对Web服务组合进行全面、充分的测试.然而,由于Web服务组合的动态特性和分布式特点,使得其测试技术与方法和传统的软件测试有很大区别,存在很多挑战.本文针对Web服务组合测试,对近年来Web服务组合测试研究中的测试用例生成技术、回归测试技术、测试执行和度量方法进行了系统地总结和分析.此外,我们还对Web服务组合测试中有待研究的问题进行了分析和展望.     

一种Web服务复杂网络的构建方法

Web服务是继SOA后的又一研究热点,存在于Internet上大量的Web服务必然会形成一个结构复杂、节点繁多,具有相互影响的复杂网络,目前国内外并没有提出完善的关于Web服务的复杂网络模型,对Web服务复杂网络特性的研究也处于发展阶段.提出以Web服务为节点,服务功能相似关系为边,构建复杂网络的模型和算法,并对构建的网络的特性展开研究.本文设计并实现了一个原型系统,利用Web服务的匹配关系构建了网络模型,并且证明该网络具有小世界特性和无标度特性.该方法的提出把对Web服务的研究从传统的SOA模型中引领到复杂网络模型中,对推动Web服务组合和发现等应用具有一定的指导意义.     

Through Personalized Web Service Composition Specification: From BPEL to C-BPEL

Over the last few years, Web services technologies offered a new and successful way for interoperability among web applications. A Web service is a software system designed in a way that other software components and humans can discover and invoke to satisfy different needs. The vision of WS as a software component allows to combine several WS, providing a global value-added WS, called composite WS.Although there are several researches in web services composition, more effort should be focused on its personalization, particularly regarding how well the composition results correspond to what the user really wants. Accordingly, we present in this paper an approach that may contribute to the personalization of web services composition specification. Our approach is a context-based proposal that makes services composition specification more efficient by taking into account both user context, needs, and preferences and web services context, and by integrating them to the composition process. In addition, to permit the reuse of specifications, we enhance BPEL by developing a specification language based on context to be used in composition that we called C-BPEL.