博碩士論文 etd-0222115-195730 詳細資訊


[回到前頁查詢結果 | 重新搜尋]

姓名 徐千景(Chien-Ching Hsu) 電子郵件信箱 E-mail 資料不公開
畢業系所 資訊管理學系研究所(Information Management)
畢業學位 碩士(Master) 畢業時期 103學年第2學期
論文名稱(中) 具有機率性QoS的網路服務之服務選擇機制之探討
論文名稱(英) The Research on Service Selection for Web Services with Probabilistic QoS
檔案
  • etd-0222115-195730.pdf
  • 本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
    請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
    論文使用權限

    紙本論文:5 年後公開 (2020-03-27 公開)

    電子論文:使用者自訂權限:校內 5 年後、校外 5 年後公開

    論文語文/頁數 英文/66
    統計 本論文已被瀏覽 5362 次,被下載 0 次
    摘要(中) Web service可以分為兩個觀點,功能觀點與非功能觀點。由於目前可用的Web service的數量非常龐大,因此一個功能需求我們通常可以找到多個services來完成,但這些提供相同功能的services他們的品質卻不一定相同,因此要如何為每一個任務選擇出一個適當的service,並使得選擇結果能符合使用者的要求將會是一個很重要的問題。
    先前服務選擇相關的works大多都將QoS(Quality of Service)當作是一個定值,但這樣是比較不洽當的做法。因為在不同時間點或是不同環境下執行,QoS值實際上是會變動的。因此這篇論文中QoS值是以機率分布的方式來做描述,並提出一個服務選擇方法使得選擇的結果能符合使用者給予的QoS要求並能在合理的時間內完成。
    我們提出的演算法首先會選出一組初始的composition,接著利用再調整的方法來對初始composition作調整的動作,而再調整主要是結合simulated annealing和tabu list的一個方法。
    最後我們也執行了數個實驗來證明我們的方法確實有比先前的work有更好的表現,而這邊先前的work方法包括整數規劃的方法與(Schuller et al., 2012)所提出的penalty method。
    摘要(英) Web services can be described from two perspectives, functional and non-functional descriptions. Due to the large number of Web services available on the Internet, it is possible to have several services that possess the same function. However services with equivalent functions may have different values for their non-functional attributes. It is often crucial to select a service for each task in workflow so as to achieve the desired quality. Most of the former works in Web service selection treat the QoS (Quality of service) values as constants. However, the value of QoS varies in different execution environments. In this work, we address the service selection problem, where the QoS value of service is described as probability distribution. The goal is to select a set of services that collectively have the high chance of satisfying constraints and the incurred execution time overhead is reasonable. Our proposed algorithm starts with an initial composition, which is later adjusted by a readjust algorithm that combines tabu list and simulated annealing. We conduct some experiments and the results show that our approach generally performs better than previous works, such as the integer programming method and the penalty method proposed by Schuller et al. (Schuller, Lampe, Eckert, Steinmetz, & Schulte, 2012).
    關鍵字(中)
  • 工作流程
  • 網路服務
  • 品質分析與衡量
  • 服務選擇
  • 服務推薦
  • 關鍵字(英)
  • web-based services
  • quality analysis and evaluation
  • service selection
  • service recommendation
  • workflow
  • 論文目次 論文審定書 i
    致謝 ii
    Abstract iii
    摘要 iv
    Table of Contents v
    LIST OF FIGURE vii
    LIST OF TABLES viii
    CHAPTER 1- Introduction 1
    1.1 Background 1
    1.2 Motivation 2
    CHAPTER 2- Literature Review 5
    2.1 Web Service Technology 5
    2.1.1 SOAP 5
    2.1.2 WSDL 6
    2.1.3 UDDI 7
    2.2 Modeling Service QoS 7
    2.3 Service Selection with Static QoS value 8
    2.4 Service Selection with Probabilistic QoS value 9
    CHAPTER 3- Problem Definition 11
    3.1 Preliminaries 11
    3.2 Problem description 15
    CHAPTER 4- Our Approach 19
    4.1 Architecture of our Approach 19
    4.2 Decomposition of Global Constraint 23
    4.3 Identification of locally optimal services 27
    4.4 Computing Constraint Satisfaction Probability for a Web service Assignment 28
    4.5Readjust method 29
    CHAPTER 5- Performance Evaluation 35
    5.1 Experiment Design 35
    5.2 Experimental Result 44
    CHAPTER 6- Conclusion 55
    References 57
    參考文獻 Al-Masri, Eyhab, & Mahmoud, Qusay H.). The QWS Dataset. from http://www.uoguelph.ca/~qmahmoud/qws/
    Alonso, Gustavo, Casati, Fabio, Kuno, Harumi, & Machiraju, Vijay. Web Services: Concepts, architectures and applications. 2004: Springer.
    Alrifai, M., Risse, T., Dolog, P., & Nejdl, W. (2009). A scalable approach for qos-based web service selection. Paper presented at the Service-Oriented Computing–ICSOC 2008 Workshops.
    Ardagna, Danilo, & Pernici, Barbara. (2005). Global and local QoS constraints guarantee in web service selection. Paper presented at the Web Services, 2005. ICWS 2005. Proceedings. 2005 IEEE International Conference on.
    Christensen, E., Curbera, F., Meredith, G., & Weerawarana, S. (2001). Web services description language (WSDL) 1.1.
    Hwang, S.Y., Wang, H., Tang, J., & Srivastava, J. (2007). A probabilistic approach to modeling and estimating the QoS of web-services-based workflows. Information Sciences, 177(23), 5484-5503.
    Klein, A., Ishikawa, F., & Bauer, B. (2009). A probabilistic approach to service selection with conditional contracts and usage patterns. Service-Oriented Computing, 253-268.
    Ko, Jong Myoung, Kim, Chang Ouk, & Kwon, Ick-Hyun. (2008). Quality-of-service oriented web service composition algorithm and planning architecture. Journal of Systems and Software, 81(11), 2079-2090.
    Lafon, Y., & Mitra, N. (2007). SOAP version 1.2 part 0: Primer World Wide Web Consortium (W3C) recommendation.
    Richardson, Leonard, & Ruby, Sam. (2008). RESTful web services: O'Reilly.
    Schuller, D., Lampe, U., Eckert, J., Steinmetz, R., & Schulte, S. (2012). Cost-driven Optimization of Complex Service-based Workflows for Stochastic QoS Parameters. Paper presented at the Web Services (ICWS), 2012 IEEE 19th International Conference on.
    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.
    Zheng, H., Yang, J., & Zhao, W. (2010). Qos probability distribution estimation for web services and service compositions. Paper presented at the Service-Oriented Computing and Applications (SOCA), 2010 IEEE International Conference on.
    口試委員
  • 魏志平 - 召集委員
  • 馬尚彬 - 委員
  • 黃三益 - 指導教授
  • 口試日期 2013-07-17 繳交日期 2015-03-27

    [回到前頁查詢結果 | 重新搜尋]


    如有任何問題請與論文審查小組聯繫