![]() |
|
以作者查詢圖書館館藏 、以作者查詢臺灣博碩士 、以作者查詢全國書目 、勘誤回報 、線上人數:19 、訪客IP:3.141.41.194
姓名 曾柏嘉(Po-Chia Tseng) 查詢紙本館藏 畢業系所 資訊工程學系 論文名稱 行動網路 Web 服務探索之效能改善
(Performance Improvement in Web Services Discovery for Mobile Networks)相關論文 檔案 [Endnote RIS 格式]
[Bibtex 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
至系統瀏覽論文 ( 永不開放)
摘要(中) 以服務為導向之架構提供了一個具擴充性、跨平台的方法來組織分散式的資源。其架構最廣泛的實作便是網路服務( Web services ),而網路服務的必要功能之一就是網路服務搜尋( Web services discovery )。目前集中式的網路服務搜尋架構如 Universal Description and Discovery Integration (UDDI) 已知有單點故障與擴充性之問題。然而,現有點對點架構:以Gnutella為基礎或以 Chord為基礎之架構,則因需做多點跳躍才能取得所需的資料,在無線網路上會造成延遲增加之現象。為了解決單點失敗、擴充性、延遲之問題,本論文於行動網路中提升 Web 服務探索之效能。此系統提出點對點 Web 服務探索,藉由 Pastry 系統建構點對點網路,並採用 Pastry 之繞徑演算法及資料結構,提供分散且具減少延遲之語意搜尋服務,實現了 Web 服務在同儕網路上以關鍵字為基礎之服務搜尋。根據模擬與實驗數據顯示,延遲比起以 Chord 為基礎之服務搜尋改善了百分之六十七,並且能夠平衡負載,解決單點失敗之問題。 摘要(英) Service-Oriented Architecture (SOA) provides a scalable and interoperable paradigm for organizing distributed resources. In general, the SOA is implemented by Web services, and discovery service is the fundamental process of services engagement in Web services. However, a centralized architecture for Web services discovery, such as Universal Description and Discovery Integration (UDDI), goes through the single node of failure and scalability problem. Otherwise, the existing peer-to-peer architectures, such as Gnutella-based or Distributed Hash Table-based, were suffered from larger delay due to multi hops delivery in mobile networks especially. In this thesis, a Performance Improvement in Web Services Discovery for Mobile Networks is proposed, and the architecture is a decentralized and adaptive service discovery with enhancement of matching capability. This architecture adopts a distributed index system with support of Pastry overlay networks for services discovery. The keyword query for semantic search in peer-to-peer network is supported in the proposed architecture as well. Furthermore, the routing procedure and leaf set of Pastry is adopted to reduce delay in mobile networks. Results from simulation show that our proposed solution is scalable and improved the performance up to 67.85% compare to Chord-based solutions in mobile networks. 關鍵字(中) ★ 點對點
★ 網路服務搜尋
★ 延遲
★ 行動網路關鍵字(英) ★ Delay
★ Mobile Networks
★ Web services discovery
★ Peer-to-Peer論文目次 摘要...........................................................................................................................................i
Abstract...................................................................................................................................ii
Contents..................................................................................................................................iv
List of Figures........................................................................................................................vi
List of Tables.........................................................................................................................vii
Chapter 1. Introduction.....................................................................................................1
1.1 Overview.......................................................................................................................1
1.2 Motivations and Goals...................................................................................................2
1.3 Thesis Organization.......................................................................................................4
Chapter 2. Related Work...................................................................................................5
2.1 Web Services Description Language.............................................................................5
2.2 Semantic Markup for Web Services..............................................................................8
2.3 Universal Description and Discovery Integration.........................................................8
2.4 Peer-to-Peer Web Services Discovery...........................................................................9
2.4.1 WSPDS........................................................................................................10
2.4.2 SPiDeR........................................................................................................11
2.4.3 pService.......................................................................................................12
2.5 Pastry and P2P Simulation...........................................................................................14
2.5.1 Pastry...........................................................................................................14
2.5.2 PeerSim........................................................................................................16
2.6 Summarization of Related Work.................................................................................19
Chapter 3. Performance Improvement in Web Services Discovery.............................21 iv
3.1 Assumption and Modeling..........................................................................................23
3.2 Service Advertisement in PIWSD...............................................................................25
3.3 Service Lookup in PIWSD..........................................................................................29
3.4 Routing Algorithm for PIWSD....................................................................................33
3.5 PeerSim Modifications for PIWSD.............................................................................35
3.5.1 Lookup Message on PeerSim Simulator.....................................................35
3.5.2 Operation of the PIWSD code on Simulator...............................................36
3.5.3 Design of Changes towards Web Service Discovery..................................38
Chapter 4. Simulations and Discussions.........................................................................40
4.1 Testing Metrics............................................................................................................41
4.2 Web Service Discovery in the Static Environment......................................................42
4.3 Comparison of Web Service Discovery in Static Environment...................................45
4.4 Web Service Discovery in the Dynamic Environment................................................47
4.5 Comparison of Capacity Distribution..........................................................................49
4.6 Effects on Mobility......................................................................................................52
Chapter 5. Conclusion and Future Work.......................................................................54
References..............................................................................................................................56參考文獻 [1] Google Map, http://maps.google.com/
[2] Yahoo! Travel Web Services , http://developer.yahoo.com/travel
[3] Microsoft MapPoint, http://www.microsoft.com/mappoint/products/webservice/default.mspx
[4] Web Services Architecture, http://www.w3.org/TR/ws-arch/#discovery_ approaches
[5] WS Glossary, http://www.w3.org/TR/ws-arch/#WSAGLOSS
[6] M. Tin, A. Gramm, H. Ritter, J. H. Schiller and T. Voigt, “Adaptive QoS for Mobile Web Services through Cross-Layer Communication,” Computer Journal, pp.59-63, vol. 40 , iss. 2, Feb. 2007.
[7] Universal Description Discovery and Integration, http:// www.uddi.org/pubs/uddi_v3.htm
[8] C. Schmidt and M. Parashar, “A Peer-to-Peer Approach to Web Service Discovery,” World Wide Web Journal, vol. 7, pp. 211-229, 2004.
[9] F. B. Kashani, C. C. Chen and C. Shahabi, “WSPDS: Web Services Peer-to-peer Discovery Service,” Proceedings of International Symposium on Web Services and Applications, Nevada, USA, pp. 733-743, Jun. 2004.
[10] O. D. Sahin, C. E. Gerede, D. Agrawal, A. E. Abbadi, O. H. Ibarra and J. W. Su, “SPiDeR: P2P-Based Web Service Discovery,” Proceedings of International Conference on Service Oriented Computing, Amsterdam, The Netherlands , pp. 157-169, Oct. 2005.
[11] W.F. Lv and J.J. Yu, “pService: Peer-to-Peer based Web Services Discovery and Matching,” Proceedings of ICSNC 2007, French Riviera, France, pp. 54-54, Aug. 2007.
[12] G. Zhou, J. J. Yu, R. Chen and H. Zhang, “Scalable Web Service Discovery on P2P Overlay Network,” Proceedings of IEEE International Conference on Services Computing, Utah, USA, pp. 122-129, Jul. 2007.
[13] U. Srivastava1, K. Munagala, J. Widom and R. Motwani, “Query Optimization over Web Services,” Proceedings of the 32nd International Conference on VLDB, Seoul, Korea, vol. 32, Sep. 2006.
[14] S. Kona, A. Bansal, G. Gupta and T. D. Hite, “Semantics-based Efficient Web Service Discovery and Composition,” Proceedings of International Semantic Web Conference 2004, Hiroshima, Japan, Nov. 2004.
[15] D. Wu, T. Tian and K. W. Ng, “An Analytical Study on Optimizing the Lookup Performance of Distributed Hash Table Systems under Churn,” Transaction on Concurrency and Computation, vol. 19, pp.543-569, Jan. 2007.
[16] Q. Lin, R. Rao and M. Li, “DWSDM: A Web Services Discovery Mechanism Based on a Distributed Hash Table, ” Proceedings of the Fifth International Conference on Grid and Cooperative Computing Workshops, Changsha, China, pp. 176-180, 2006.
[17] E. Ayorak and A. B. Bener, “Super Peer Web Service Discovery Architecture,” Proceedings of International Conference on Data Engineering 2007, pp. 1360-1364, Apr. 2007
[18] T. Yu, Y. Zhang and K. J. Lin, “Efficient Algorithms for Web Services Selection with End-to-End QoS Constraints,” ACM Transactions on Web, vol. 1, iss. 1, May 2007.
[19] Web Services Description Language, “http://www.w3.org/TR/wsdl”
[20] Extensible Markup Language, “http://www.w3.org/XML/”
[21] Simple Object Access Protocol, “http://www.w3.org/TR/soap/”
[22] Hypertext Transfer Protocol, “http://www.ietf.org/rfc/rfc2616.txt”
[23] Multipurpose Internet Mail Extensions, “http://www.ietf.org/rfc/rfc2045.txt”
[24] XML Schema, “http://www.w3.org/XML/Schema”
[25] OWL-S, “http://www.ai.sri.com/daml/services/owl-s/1.2/”
[26] DAML-S, “http://www.daml.org/services/daml-s/0.9/”
[27] Seekda, “http://seekda.com/”
[28] XMethod, “http://www.xmethods.net/ve2/Tools.po”
[29] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek and H. Balakrishnan, “Chord: A Salable Peer-to-Peer Lookup Service for Internet Applications,” Proceedings of ACM SIGCOMM 2001, California, USA, pp. 149-160, Aug. 2001.
[30] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems, ” Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany, pp. 329-350, Nov. , 2001.
[31] PeerSim, http://peersim.sourceforge.net/
[32] N. Srinivasan, M. Paolucci and K. Sycaral, “CODE: A Development Environment for OWL-S Web Services,” Proceedings of International Semantic Web Conference 2004, Hiroshima, Japan, Nov. 2004.
[33] C. Buckley, “Implementation of the SMART Information Retrieval System,” Technical Report: TR85-686, 1985.指導教授 周立德(Li-Der Chou) 審核日期 2008-7-23 推文 plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
網路書籤 Google bookmarks
del.icio.us
hemidemi
myshare