研究生: |
陳柏元 Bo-Yuan Chen |
---|---|
論文名稱: |
基於市場的網路服務分配機制 Market Based Web Service Allocation Mechanisms |
指導教授: |
蘇豐文
Von-Wun Soo |
口試委員: | |
學位類別: |
碩士 Master |
系所名稱: |
電機資訊學院 - 資訊系統與應用研究所 Institute of Information Systems and Applications |
論文出版年: | 2007 |
畢業學年度: | 95 |
語文別: | 中文 |
論文頁數: | 79 |
中文關鍵詞: | 代理人 、網路服務 、市場 、拍賣 |
外文關鍵詞: | agent, web service, market, auction |
相關次數: | 點閱:2 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
網路服務(web service)為企業或組織之系統整合提供一個良好的技術平台,各部門或組織成員將工作發佈成網路服務,以供其他部門或組織成員使用。我們需要一個良好的網路服務分配機制,有效率地幫助我們匹配服務需求者至所需之服務。良好的分配機制應該顧及服務需求者與服務提供者之整體利益,並能解決需求衝突之問題。
應用經濟學的概念於分散式計算,為市場精神所在;市場本身由許多自私(self-interest)的個體所組成,透過既合作且競爭(Cooperation and Competition model)的方式自由競爭、各取所需,以達到供需平衡。市場如同一隻隱形之推手(invisible hand),將複雜的問題推向一個穩定的結果,該結果是否如我們所預期?就要看我們如何去設計這個市場。
網路服務需求者與網路服務提供者可能在一個企業內部網路(intranet),亦或是分散於不同的網路環境中,需求者與提供者自由競爭、各取所需,如同一個渾然天成的市場環境;我們利用經濟學上之理論,包含生產函數、組合式拍賣等來設計適合本系統架構之價格策略、底價訂定策略與效用函數等;一旦健全的市場建立,利用市場之隱形推手,最後終將推導至我們預期之結果,也就是一個最佳化服務需求者與服務提供者之整體利益的網路服務分配方式。
另外在設計市場環境之前,我們必須了解網路服務本身的一些屬性,即網路服務品質。服務需求者透過呼叫高品質之網路服務以得到更高之效益,於是網路服務的服務品質為影響分配機制之主要因素。我們參考許多已發展的服務品質理論,將服務需求者的經驗加入至我們的服務品質考量,可以為服務之品質屬性提供一個經驗式的衡量準則。
最後,將於實驗中討論在不同的市場參數設定下之整體效益值,觀察市場環境中服務需求者與提供者之行為,以得到在何種情況下之參數設定所導致之網路服務分配逼近於最佳分配之整體效益值。
Web service technique provides a platform for integration of enterprise and organizations, and each member of organizations announces their applications as web services in the network. We need a web service allocation mechanism to allocate web services to those who need it. A perfect allocation mechanism will take the benefit of service demanders and service providers into consideration, and with the ability of solving demand conflict.
To apply economic concept to distributed computing is the main idea of market. Market based mechanism is constituted by many self-interesting individualities. The individualities of market cooperate and compete with each other to reach their goal, and the market with an invisible hand will infer the complex problem to a stable result. How to make the stable result conform to our expectation depends on how we design the market.
Service demanders and service providers exist in the same intranet or distribute in distinct network. They cooperate and compete with each other like a market environment. We exploit economical theory, includes production function, combination auction, to design our price policy, reserve price setting policy and utility function etc. Once the market established, the invisible hand of market will infer the problem to our expected result: an optimal allocation.
Before design market mechanisms, we must take qualities of web services into consideration. The service demanders call high quality services to enhance their benefit, such that the quality of web service is the most important effecting metric of allocation mechanism design. We refer to previous research and take users feedback into QoS consideration to develop our QoS metrics.
[1] F. Curbera et al., “Unraveling the Web Services Web: An Introduction to SOAP, WSDL, and UDDI, ” IEEE Internet Computing, vol. 6, no. 2, Mar./Apr. 2002, pp. 86-93.
[2] “Web Service Activity, ” World Wide Web Consortium, www.w3.org/2002/ws/.
[3] 戚玉樑 , “網路服務技術導論, “ 全華科技圖書, 2004
[4] Jorge Cardoso1, Amit Sheth2, John Miller2, Jonathan Arnold3, and Krys Kochut2, “Quality of Service for Workflows and Web Service Processes, ” Journal of Web Semantics 2004
[5] Daniel A. Menascé, “QoS Issues in Web Services, ” IEEE Internet Computing Volume: 6 On page(s): 72- 75 Nov/Dec 2002
[6] L. Cherkasova and P. Phaal, “Session-Based Admission Control: A Mechanism for Peak Load Management of Commercial Web Sites, ” IEEE Trans. Computers, vol. 51, no. 6, June 2002, pp. 669-685.
[7] Anbazhagan Mani, Arun Nagarajan, “Understanding quality of service for Web services, ” IBM Jan 2002
http://www.ibm.com/developerworks/library/ws-quality.html
[8]賴威慎, “利用網路服務程式的品質與本體論自動組合網路服務程式 – 以尋找開放讀架為範例, ” 國立清華大學/資訊工程學系/93/碩士/093NTHU5392067
[9] Michail G. Lagoudakis' Marc Berhaultt Sven Koenigt Pinar Keskinocak' Anton J. Kleywegt', “Simple Auctions with Performance Guarantees for Multi-Robot Task Allocation, ” Proceedings of 2004 IEEEIRSI International Conference on lntelllgent Robot8 and Systems September 28 -October 2,2004, Sendai, Japan
[10] Brian P. Gerkey and Maja J. Mataric, “Sold!: Auction Methods for Multirobot Coordination, ” IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 18, NO. 5, OCTOBER 2002
[11] M. Bernardine Dias, Robert Zlot, Nidhi Kalra, and Anthony Stentz, “Market-Based Multirobot Coordination: A Survey and Analysis, ” Proceedings of the IEEE, July 2006 Volume: 9 page(s): 1257- 1270
[12] Jia Yu, Srikumar Venugopal, and Rajkumar Buyya, “A Market-Oriented Grid Directory Service for Publication and Discovery of Grid Service Providers and their Services, ” The Journal of Supercomputing 2006 Volume 36 Issue 1 (April 2006) Pages: 17 - 31
[13] Chia-Hung Chien, Paul Hsueh-Min, Chang Von-Wun Soo, “Market-Oriented Multiple Resource Scheduling in Grid Computing Environments, ” Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on Publication Date: 28-30 March 2005 Volume: 1, On page(s): 867- 872 vol.1
[14] Daniel A. Menascé, “Composing Web Services: A QoS view, ”IEEE internet computing November/December 2004 (Vol. 8, No. 6) pp. 88-90
[15] Yutu Liu, Anne H.H., Ngu Liangzhao Zeng, “QoS computation and policing in dynamic web service selection, ” Feldman SI, uretsky M, Najork M, Wills CE, eds. Proc. of the 13th Int'l Conf. on World Wide Web (WWW 2004). New York: ACM Press, 2004. 66-73.
[16] Taher L., Basha R., El Khatib H., ” Establishing Association between QoS Properties in service Oriented Architecture, “ NWeSP 2005. International Conference 22-26 Aug. 2005 On page(s): 6 pp.-
[17] M. Wellman, “Market-Oriented Programming: Some Early Lessons, “ Market-Based Control: A Paradigm for Distributed Resource Allocation, World Scientific, 1996.
[18] M. Kumar and S. I. Feldman, "Business Negotiation on the Internet," IBM Institute for Advanced Commerce, Yorktown heights, NY March 11, 1998.
[19] David Vickrey, “Counter Speculation, Auctions, and Competitive Sealed Tenders, ” The Journal of Finance, March 1961, pp. 9-37.
[20] Iain Fraser, “The Cobb-Douglas Production Function: An Antipodean Defence? ” Economic Issues, Vol.7, Part 1, March 2002
[21] Soumaya M Tohamy and J. Wilson Mixon Jr., “Case Study: The Use of Cobb-Douglas and Constant Elasticity of Substitution Utility Functions to Illustrate Consumer Theory, ” June 2002 http://www.economicsnetwork.ac.uk/showcase/tohamy_ces.htm
[22] 王敬育, “一個關於使用群體智慧解決非線性資源分配問題之研究, ” 國立暨南大學/資訊管理研究所/94/碩士論文
[23] Ralph Schäfer1, “Rules for Using Multi-Attribute Utility Theory for Estimating a User’s Interests, ” Agent Based Information Systems (ABIS) Workshop, 2001
[24] Wellman M.P.A market-oriented programming environment and its application to distributed multicommodity flow problems[J].Journal of Artificial Intelligence Research,1993,1(1):1-123.
[25] Scarf H.E., “The computation of equilibrium prices, ” IN Scarf H.E. & Shoven J.B.(Eds.), Aplied General Equilibrium Analysis, pp. 1-49. Cambridge University Press, Cambridge
[26] Crockett, Sean, Spear, Stephen E. and Sunder, Shyam, "Learning Competitive Equilibrium" (April 2006). Available at SSRN: http://ssrn.com/abstract=907390
[27] M. Lagoudakis, M. Berhault, P. Keskinocak, S. Koenig, and A. Kleywegt, “Simple auctions with performance guarantees for multi-robot task allocation,” in Proceedings of the International Conference on Intelligent Robots and Systems, September 2004.
[28] Rajkumar Buyya, David Abramson, and Jonathan Giddy, “A Case for Economy Grid Architecture for Service Oriented Grid Computing, “10th Heterogeneous Computing Workshop, 2001
[29] Nisan, N. "Bidding and allocation in combinatorial auctions." In Proceedings of the 2nd ACM conference on Electronic Commerce. Minneapolis, Minnesota, October 17-20, 2000, pp. 1-12.
[30] Fujishima Y, Leyton-Brown K, Shoham Y. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches,IJCAI, 1999. 548∼553