Responsive image
博碩士論文 etd-0730112-141657 詳細資訊
Title page for etd-0730112-141657
論文名稱
Title
在Choreography環境中以π-演算為基礎的網路服務組裝方法
A π-calculus Based Approach for Web Services Composition in Choreography Environment
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
103
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2012-07-02
繳交日期
Date of Submission
2012-07-30
關鍵字
Keywords
網路服務適合性、網路服務、π-演算、網路服務選擇、網路服務組合
Web Service composition, π-calculus, Web Service selection, Choreography, Web service compatibility
統計
Statistics
本論文已被瀏覽 5966 次,被下載 347
The thesis/dissertation has been browsed 5966 times, has been downloaded 347 times.
中文摘要
在網路科技發達的今日,網路服務逐漸已成為了組織間之商業流程整合的標準協定。透過網路服務的各項標準,組織可以快速地組裝其內部的網路服務以應對外部環境的變動。更重要的是,組織間可以透過分享其網路服務以進行跨組織的商業流程整合與溝通。一般而言,網路服務的組裝的方式可分為兩種- Orchestration 與 Choreography。 Orchestration 主要應用於單一流程的建立與組合,組織內外部的網路服務可以透過此方法進行整合、調整與溝通。 相對而言,Choreography則用於跨組織的溝通與流程整合。在Choreography 環境中,各個網路服務皆為一獨立個體,且各個網路服務可以自主的選擇與啟用其它網路服務以完成其工作。 在Choreography環境中,各個網路服務之間是否能夠互相搭配與整合是一個相當重要的議題。因此,我們研究如何在Choreography環境中透過資訊的分享以提高整體商業流程的成功率。在我們的方法中,每一個網路服務皆可透過一個固定之機制來宣告與分享其服務之行為與需求,且各個服務可透過其夥伴服務所提供之資訊建立一個局部視圖以指導其服務內部各項作業之運作。本研究之實驗與評估的方法為,在不同網路服務的可用性下分別進行100,000次的模擬執行以評估各個方法的成功率。實驗結果顯示,我們所提出的方法確實能有效的提高整體商業流程的成功率。
Abstract
Nowadays, Web Services technology has become a standard to integrate business processes across organizations. In general, there are two approaches for web service composition: Orchestration and Choreography. Orchestration is used to develop a single process that integrates services within or across an organization to achieve a business goal. On the other hand, Choreography is often used for cross-organizational communication and serves as a specification for communication. In a choreographed environment, each Web service is an independent entity, and each service selects the partner services using its own selection policy without knowing all the other services in the choreography. In this thesis, we use π-calculus for modeling the Web Services. Afterwards, we propose an approach for each constituent process to choose and invoke other processes using the limited information provided by its partners. In our method, each service proclaims the requirments of its potential service providers (or consumers) and itself and provides to its partners. Subsequently each service will generate a local view using the information provided by its service consumers and providers to guide the selection. We evaluate our method by simulating 100,000 executions with different degrees of service availability. The experimental results indicate that our proposed method can indeed improve the success rate of the entire choreography.
目次 Table of Contents
Abstract ii
中文摘要 iii
CHAPTER 1 – Introduction 1
1.1 Background 1
1.2 Motivation 2
1.3 Thesis Organization 6
CHAPTER 2 Literature Review 7
2.1 Web Service Technologies 7
2.1.1 SOAP 8
2.1.2 WSDL 9
2.2 Orchestration and Choreography 10
2.2.1 Orchestration 10
2.2.2 Choreography 11
2.3 Web Service Composition 12
2.4 Web Service Selection 13
2.5 Theoretical Process Models 15
2.5.1 Finite State Machine 15
2.5.2 Petri Net 16
2.5.3 The π- Calculus 16
CHAPTER 3 Choreography Model and Problem Definition 21
3.1 Using π-calculus for Modeling Web Services 21
3.1.1 Basic Operation 21
3.1.2 Structural Activities 23
3.1.3 Sequential Composition 24
3.1.4 Alternative Composition 25
3.1.5 Repeat-Until Composition 27
3.1.6 While Loop 28
3.1.7 Parallel Composition 29
3.2 Composability Checking 31
3.3 Choreography model 35
3.4 An Illustrating Example 37
3.5 Problem Description 42
CHAPTER 4 The Method 44
4.1 Architecture 44
4.2 Generating Viewc for Service Consumer 46
4.2.1 General Case 48
4.2.2 Multiple Instances Case 56
4.3 Generating Viewp for Service Provider 58
4.4 Building Local Composition 59
CHAPTER 5 Performance Evaluation 65
5.1 Experimental Design 67
5.2 Success Rates of Four Methods 69
5.2 The Influence of Partner-Hierarchy 73
5.3 The Influence of Transitive Callback 78
5.4 The Scenario of Multiple Instance Case 82
CHAPTER 6 Conclusion 87
Reference 89
參考文獻 References
Alrifai, M., & Risse, T. (2009). Combining global optimization with local selection for efficient QoS-aware service composition. Paper presented at the Proceedings of the 18th international conference on World wide web, Madrid, Spain.
Berardi, D., Calvanese, D., De Giacomo, G., Lenzerini, M., & Mecella, M. (2003). Automatic composition of e-services that export their behavior. Service-Oriented Computing-ICSOC 2003, 43-58.
Booth, D., Haas, H., McCabe, F., Newcomer, E., Champion, M., Ferris, C., & Orchard, D. (2004). Web Services Architecture: W3C Web Services Architecture Working Group.
Bultan, T., Fu, X., Hull, R., & Su, J. (2003). Conversation specification: a new approach to design and analysis of e-service composition. Paper presented at the Proceedings of the 12th international conference on World Wide Web, Budapest, Hungary.
Christensen, E., Curbera, F., Meredith, G., & Weerawarana, S. (2001). Web services description language (WSDL) 1.1.
Curbera, F., Duftler, M., Khalaf, R., Nagy, W., Mukhi, N., & Weerawarana, S. (2002). Unraveling the Web services web: an introduction to SOAP, WSDL, and UDDI. Internet Computing, IEEE, 6(2), 86-93.
Decker, G., Puhlmann, F., & Weske, M. (2006). Formalizing service interactions. Business Process Management, 414-419.
Foster, H., Uchitel, S., Magee, J., & Kramer, J. (2006). LTSA-WS: a tool for model-based verification of web service compositions and choreography. Paper presented at the Proceedings of the 28th international conference on Software engineering, Shanghai, China.
Fu, X., Bultan, T., & Su, J. (2002). Formal verification of e-services and workflows. Web Services, E-Business, and the Semantic Web, 795-804.
Haas, H., & Brown, A. (2004). Web services glossary. World Wide Web Consortium(February), 1-18.
Hwang, S. Y., Liao, W. P., & Lee, C. H. (2010, 5-10 July 2010). Web Services Selection in Support of Reliable Web Service Choreography. Paper presented at the Web Services (ICWS), 2010 IEEE International Conference on Web Service.
Hwang, S. Y., Lim, E. P., Lee, C. H., & Chen, C. H. (2008). Dynamic web service selection for reliable web service composition. Services Computing, IEEE Transactions on Service Computing, 1(2), 104-116.
Lucchi, R., & Mazzara, M. (2007). A pi-calculus based semantics for WS-BPEL. Journal of Logic and Algebraic Programming, 70(1), 96-118.
Martens, A. (2005). Analyzing web service based business processes. Fundamental Approaches to Software Engineering, 19-33.
Milner, R. (1999). Communicating and mobile systems: the [symbol for pi]-calculus: Cambridge Univ Pr.
Milner, R., Parrow, J., & Walker, D. (1992). A calculus of mobile processes, i. Information and computation, 100(1), 1-40.
Mitra, N., & Lafon, Y. (2003). Soap version 1.2 part 0: Primer. W3C recommendation, 24, 12.
Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4), 541-580.
Peltz, C. (2003). Web services orchestration and choreography. Computer, 36(10), 46-52.
Puhlmann, F., & Weske, M. (2005). Using the π-calculus for formalizing workflow patterns. Business Process Management, 153-168.
Vasiliev, Y. (2007). SOA and WS-BPEL. Birmingham-Mumbai.: Packt Publishing.
Yu, T., Zhang, Y., & Lin, K. J. (2007). Efficient algorithms for Web services selection with end-to-end QoS constraints. ACM Transactions on the Web (TWEB), 1(1), 6.
Zeng, L., Benatallah, B., Ngu, A. H. H., Dumas, M., Kalagnanam, J., & Chang, H. (2004). QoS-aware middleware for web services composition. Software Engineering, IEEE Transactions on, 30(5), 311-327.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code