【正文】 [8] 哈特 著 .孟憲瑞，易磊 譯 . 經(jīng)典教程 —— C篇 .人民郵電出版社 . 2020 [9] David Sceppa 著 . 梁超 ， 張莉 ， 賀堃 譯 . 技術(shù)內(nèi)幕 .清華大學(xué)出版社 .2020 [10] 胡百敬 ， 姚巧玫 著 .SQL Server 2020 數(shù)據(jù)庫開發(fā)詳解 .電子工業(yè)出版社 .2020 [11] Jason Beres 著 .袁鵬飛 譯 . 21 天學(xué)通 Visual 版社 .2020 [12] 明日科技 . 數(shù)據(jù)庫系統(tǒng)開發(fā)案例精選 .人民郵電出版社 . 2020 [13] 金銀秋 著 .數(shù)據(jù)庫原理與設(shè)計 .北京 :科學(xué)出版社 ,2020 [14] 劉乃麗 著 . 精通 +SQL Server 2020 項目開發(fā) .人民郵電出版社 . 2020 [15] 譚振林 著 . 道不遠人 —— 深入解析 控件開發(fā) .電子工業(yè)出版社 . 2020 24 附錄 Dynamic Web Service Selection for ReliableWeb Service Composition SanYih Hwang, Member, IEEE Computer Society, EePeng Lim, Senior Member, IEEE, ChienHsiang Lee, and ChengHung Chen Abstract—This paper studies the dynamic Web service selection problem in a failureprone environment, which aims to determine a subset of Web services to be invoked at runtime so as to successfully orchestrate a posite Web service. We observe that both the posite and constituent Web services often constrain the sequences of invoking their operations and, therefore, we propose using a finite state machine to model the permitted invocation sequences of Web service operations. We assign each state of execution an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each Web service may fail with some probability. We show that the putation of aggregated reliabilities is equivalent to eigenvector putation and adopt the power method to efficiently derive aggregated reliabilities. In orchestrating a posite Web service, we propose two strategies to select Web services that are likely to successfully plete the execution of a given sequence of operations. A prototype that implements the proposed approach using BPEL for specifying the invocation order of a Web service is developed and serves as a testbed for paring our proposed strategies and other baseline Web service selection strategies. Index Terms—Reliability, service position, Web services, Web service selection. 1 INTRODUCTION THE Inter today has radically changed how businesses interact with applications distributed within and across anizational boundaries. With Web service (WS) technologies fast being the de facto standard to expose the functions of business applications, WSs will be the building blocks for developing the next generation applications using he serviceoriented architecture (SOA). Although the current WS architecture supports registry, discovery, and consumption of WSs, how to effectively integrate several WSs into a posite one remains to be a challenge and attracts much attention from both industry and academia. The position of WSs involves using an orchestration model to 1) define the possible orders of calling WSs at design time and 2) dynamically select WSs to be invoked at runtime. To address the former, several theoretical orchestration models have been proposed in the literature, including finite state machine (FSM), Petri , calculus, activity hierarchies, and rulebased orchestration [2]. Practical service position languages, such as BPEL, WSChoreography, WSCL, XPDL, and OWLS have also been proposed, and many mercial service platforms or products that implement the available standards and position languages are available in the market, including the Sun ONE framework based on J2EE, , the Oracle BPEL Process Manager, the HP WSs Management Platform, and the IBM Web Sphere Application Server. However, none of the 25 above works provide strategies or mechanisms to dynamically select WSs to be invoked when executing a series of operations in a posite WS. While deciding on a set of constituent WSs for a posite WS a priori is simple and practically used by most of today’s applications, it promises the flexibility and is especially vulnerable to failures in a dynamic environment on which WSs are executed. Dynamic WS selection refers to choosing the available WSs to be invoked so as to realize the functionality of a posite WS constructed using an orchestration model at runtime. While the WS selection problem has been extensively studied in the past few years, and various QoS measures, such as response time, cost, reliability, avail ability, and fidelity, have been proposed as the criteria for selection [15], [19], [20], [30], most works regard a WS as the basic unit for position. In reality, however, a WS may prise multiple operations such that their invocation sequence is constrained. A typical constraint is separation of duties, which is a wellestablished practice in security applications. In our context, separation of duties dictates that two operations must be delegated to two different WSs to avoid potential fraud [5]. On the other hand, an opposite constraint binding of duties may be needed under other circumstances. For example, we often mandate orders and payments to be made through the same WS. In addition, an enterprise may impose further constraints on the execution orders of its published operations to conform to its business logic. It is imperative that the dynamic WS selection procedure takes all these constraints into account. Researchers in previous works on automatic WS position [3], [7] therefore consider each service operation as the basic unit to pose aWS, and an FSMhas been adopted to specify the order among operations in a given WS. In addition, when choosing the operations of WSs to pose a (posite) WS, the atomicity of each WS, which requires either none of its operations to be invoked or some final state to be reached, has to hold at the end ofWS position. The goal of automatic WS position is therefore to determine whether a given posite WS can be derived using a set of WSs, and if so, the steps to construct the posite WS .While these works study automatic WS position as a decision problem, they have no