雲端運算中多屬性範圍搜尋機制之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：73

、訪客IP：3.16.82.140

姓名

任紀安(Chi-An Jen) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

雲端運算中多屬性範圍搜尋機制之研究
(A Multi-Attribute Range Query Mechanism in Cloud Computing)

相關論文

★ 無線行動隨意網路上穩定品質服務路由機制之研究	★ 應用多重移動式代理人之網路管理系統
★ 應用移動式代理人之網路協同防衛系統	★ 鏈路狀態資訊不確定下QoS路由之研究
★ 以訊務觀察法改善光突發交換技術之路徑建立效能	★ 感測網路與競局理論應用於舒適性空調之研究
★ 以搜尋樹為基礎之無線感測網路繞徑演算法	★ 基於無線感測網路之行動裝置輕型定位系統
★ 多媒體導覽玩具車	★ 以Smart Floor為基礎之導覽玩具車
★ 行動社群網路服務管理系統－應用於發展遲緩兒家庭	★ 具位置感知之穿戴式行動廣告系統
★ 調適性車載廣播	★ 車載網路上具預警能力之車輛碰撞避免機制
★ 應用於無線車載網路上之合作式交通資訊傳播機制以改善車輛擁塞	★ 智慧都市中應用車載網路以改善壅塞之調適性虛擬交通號誌

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

隨著近年網際網路技術的快速發展與使用人數的大幅增加，傳統的網路架構已經無法應付如此龐大的使用量及變化量。為了降低龐大網路營運成本及更有效率的使用硬體資源，雲端運算 (Cloud Computing) 在此呼應而生。雲端運算是分散式系統 (Distributed System) 所延伸出的一種新概念，具有高擴充性、快速部屬、高可靠性及結合公用運算中的按使用量付費等優點。因為雲端運算擁有諸多上述優點，眾多的雲端服務提供者 (Cloud Service Provider) 如雨後春筍般出現，如Amazon EC2、Google App Engine和Microsoft Azure。
雲端運算目前乃在發展中，當使用者要存取不同雲端服務提供者的資源時，必須要向各雲端服務提供者的搜尋系統查詢，並沒有一個統一且有效率的搜尋機制。為了解決上述問題，本論文將提出兩種不同的機制，第一種機制，以分散式雜湊表為基底之多屬性範圍搜尋機制 (DHT-based Mechanism for Multi-attribute Range Query; DMMRQ)，讓使用者透過本機制能夠搜尋不同雲端中的資源。DMMRQ利用同儕網路 (Peer-to-Peer Network) 中的具有地域性的CAN (Content Addressable Network) 為基底來改良，具備分散性、高擴充性及防止單點故障等特性。除此之外，由網路模擬軟體PeerSim模擬結果顯示，DMMRQ的平均搜尋hop數較CAN改善31.43%，節點間的負載平衡改善24.71%。
而本論文的第二種機制為實作一個以代理人為基底之雲端搜尋機制 (Agent-based Cloud Query Mechanism) 於嵌入式開發板上，雲端代理人可替使用者來尋找不同雲端中資源的訊息。使用者只需要安裝一個應用程式且不需要去維護雲端資訊的清單和協定，即可輕易的索取不同雲端的資源訊息。在實驗中我們發現，當雲端代理人建置於家用閘道器嵌入式板上時，能夠同時承受大約300位使用者的連線數量，說明了雲端代理人的低負擔。

摘要(英)

Due to the increasing amount of internet users and fast growing of internet technique in recent years, traditional internet structure cannot deal with such huge amount of users and change anymore. As a results, in order to reduce the huge cost of operating internet and more use hardware resources efficiently. Cloud computing comes into existence. Cloud computing is a new concept derived from distributed systems. It has contains advantages of high expansion, fast distribution, high reliability, and combining deciding payment by using amount of public computing. Thus, many cloud service providers has mushroomed in few years, such as Amazon EC2, Google App Engine, Microsoft Azure, etc.
Cloud computing is still in development. When users need to access resources from different cloud service providers, user has to query the query system from cloud service providers; however, there is still no consistent and efficient query mechanism. Hence, in order to solve this problem, this thesis propose two different mechanisms, The first mechanism is a multi-attribute range query mechanism based on Distribution Hash Table (DHT) in cloud computing. By this mechanism, users can fast query resources from different clouds. The proposed query mechanism in this thesis enhances Content Addressable Network (CAN) with locality in peer-to-peer network, and therefore contains characteristics of distribution, high expansion, and preventing prevention of single peer breakdown. Furthermore, the simulation resulted by PeerSim show that the average query hop number of DMMRQ is faster than CAN by 31.43%, and the load balance between peers enhances 24.71%.
The second proposed mechanism is Agent-based Cloud Query Mechanism (ACQM) implemented on embedded systems is the second proposed mechanism in this thesis. Cloud agent will search resource messages from different clouds in place of users. What users need to do is just install a application but doesn’t need to maintain the list and protocol of cloud information. Consequently, users can get resource messages from different clouds easily. By the experiment, show that when cloud agent is built on home gateway embedded board, it could sustain the online amount of about 300 clients at the same time. This represents the low overhand of ACQM.

關鍵字(中)

★ 雲端運算
★ 範圍搜尋
★ ARP
★ CAN
★ 同儕網路

關鍵字(英)

★ Peer-to-Peer Network
★ Range Query
★ Cloud Computing
★ ARP
★ CAN

論文目次

第一章緒論 1
1.1 概要 1
1.2 研究動機 2
1.3 研究目的 3
1.4 論文架構 4
第二章背景知識與相關研究 5
2.1 雲端運算 5
2.2 同儕網路 10
2.2.1 非結構化之P2P網路架構 11
2.2.2 結構化之P2P網路架構 13
2.3 網路模擬器PeerSim 19
2.4 雲端運算之互通性研究議題 20
2.5 網路管理相關通訊協定 24
2.5.1 網路管理之ICMP 24
2.5.2 遠端網路管理之TR-069 26
第三章系統之設計 29
3.1 網路環境與假設 29
3.2 位置感知加入機制 30
3.2.1 節點位置估算模組 30
3.2.2 節點加入模組 33
3.2.3 虛擬群模組 37
3.2.4 屬性正規化模組 40
3.2.5 路由模組 41
3.3 多屬性搜尋機制 43
3.4 維護模組 45
3.5 回收模組 47
第四章模擬結果與分析 50
4.1 模擬環境說明 50
4.2 模擬結果與討論 52
4.2.1 模擬實驗1 : 網路搜尋之效能比較 52
4.2.2 模擬實驗2 : 網路節點之負載度比較 55
4.2.3 模擬實驗3 : 地標數量之網路效能影響 58
4.2.4 模擬實驗4 : 維度與節點數量之關係 60
4.2.5 模擬實驗5 : 節點維護資料與維度之影響 62
4.2.6 模擬實驗6 : 詢問封包與節點數量之影響 64
4.2.7 模擬實驗7 : 詢問封包與搜尋範圍之影響 67
第五章雲端資源搜尋之實作 69
5.1 設計方法與架構 69
5.2 開發工具與軟硬體環境 70
5.3 系統功能與展示 72
5.4 實驗與討論 76
第六章結論與未來展望 81
6.1 結論 81
6.2 未來展望 82
參考文獻 84

參考文獻

[1] I Foster, Y Zhao, I Raicu, S Lu, “Cloud Computing and Grid Computing 360-Degree Compared, ” Grid Computing Environments Workshop, pp. 1-10, Nov 2008.
[2] Jayant Baliga, Robert W. A. Ayre, Kerry Hinton, and Rodney S. Tucker; University of Melbourne, Australia, “Green Cloud Computing: Balancing Energy in Processing, Storage and Transport, ” Proceedings of the IEEE, vol.99, issues. 99, pp. 149-167, Jan. 2011.
[3] Diaz-Sanchez, D. ; Almenarez, F. ; Marin, A. ; Proserpio, D. ; Cabarcos, P.A.Media Cloud: An Open Cloud Computing Middlewarefor Content Managemen, ” Consumer Electronics, IEEE Transactions, vol.57, issue.2, pp. 970-978, May. 2011
[4] Michael Armbrust, Armando Fox, Rean Griffith, Anthony D. Joseph, Randy H. Katz, Andrew Konwinski, Gunho Lee, David A. Patterson, Ariel Rabkin, Matei Zaharia, “Above the Clouds: A Berkeley View of Cloud Computing,” Tech. Reprot No. UCB/EECS-2009-28, Feb. 2009.
[5] Boss, G., et al.: Cloud Computing, IBM Corporation white paper, Oct. 2007.
[6] Daniel Nurmi, Rich Wolski, Chris Grzegorczyk, Graziano Obertelli, Sunil Soman, Lamia Youseff, Dmitrii Zagorodnov, “The Eucalyptus Open-source Cloud-computing System, ” Proceedings of 9th IEEE International Symposium on Cluster Computing and the Grid, pp. 124-131, May. 2009.
[7] Google App Engine, http://www.google.com
[8] Amazon EC2, http://aws.amazon.com/ec2/
[9] Microsoft-Azure, http://www.microsoft.com/windowsazure/windowsazure
[10] Mladen A. Vouk, “Cloud Computing – Issues, Research and Implementations, ” Information Technology Interfaces, 2008. ITI 2008. 30th International Conference, pp. 31-40, June. 2008.
[11] Jeffrey Dean, Sanjay Ghemawat, “MapReduce: Simplied data processing on large clusters,” Communications of the ACM, Vol. 51, no.1, pp.107-133, Jan. 2008.
[12] Kang Chen, Weimin Zheng, “Cloud Computing: System Instances and Current Research,” Journal of Software, vol.20, no.5, pp.1337-1348, May. 2009.
[13] E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “A survey and comparison of peer-to-peer overlay network schemes, ” IEEE Communications Surveys and Tutorials, vol. 7, no. 2, July. 2005.
[14] Nabhendra Bisnik and Alhussein Abouzeid, “Modeling and analysis of random walk search algorithms in p2p networks,” Proceedings of Second International Workshop on Hot Topics in Peer-to-Peer Systems, pp. 95–103, Oct. 2005.
[15] Nabhendra Bisnik and Alhussein Abouzeid, “Optimizing random walk search algorithms in p2p networks,” Proceedings of Computer Networks, vol. 51, no. 6, pp. 1499–1514, Sep. 2007.
[16] I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System, ” In Workshop on Design Issues in Anonymity and Unobservability, pp. 311-320, July. 2000.
[17] Gnutella, http://www.gnutellaforums.com/
[18] Fasttrack Peer-to-Peer Technology Company, http://www.fasttrack.nu/
[19] Kazaa Media Desktop, http://www.kazaa.com/, 2001.
[20] Bittorrent, http://bitconjurer.org/BitTorrent/, 2003.
[21] The Overnet File-sharing Network, http://www.overnet.com/, 2002.
[22] Overnet/edonkey2000, http://www. edonkey2000.com/, 2000
[23] Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S, “A Scalable Content Addressable Network,” Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 161–72, Aug. 2001.
[24] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishna, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” In Proceedings of the ACM SIGCOMM, vol. 11, no. 1, pp. 17–32, Aug. 2001.
[25] B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowic, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, pp. 41-53, Jan. 2004.
[26] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems,” In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, pp. 329-350, Nov. 2001.
[27] PeerSim website, http://peersim.sourceforge.net/.
[28] M E J Newman, “Power laws, Pareto distributions and Zipf's law,” Proc. of the Contemporary Physics, vol. 46, no. 5, pp. 323-351, May. 2006.
[29] Guilherme Sperb Machado, David Hausheer, Burkhard Stiller, “Considerations on the Interoperability of and between Cloud Computing Standards,” Proc. of 27th Open Grid Forum (OGF27), G2C-Net Workshop: From Grid to Cloud Networks, Oct. 2007
[30] Open Stack, http://www.openstack.org/
[31] Open Data Center Alliance, http://www.opendatacenteralliance.org/
[32] Open Cloud Computing Interface, http://occi-wg.org/
[33] Nikolaos Loutas, Vassilios Peristeras, Thanassis Bouras, Eleni Kamateri, Dimitrios Zeginis, Konstantinos A. Tarabanis, “Towards a Reference Architecture for Semantically Interoperable Clouds,” In Proceedings of CloudCom'2010, pp. 143-150, Dec. 2010.
[34] Simple Object Access Protocol, http://en.wikipedia.org/wiki/SOAP
[35] Representational State Transfer, http://zh.wikipedia.org/wiki/REST
[36] Fangfang Liu, Xiangfeng Luo, Jie Yu, Guoning Liang, “Semantic Cloud based on SLN and ALN,” Proc. of the 2009 Fifth International Conference on Semantics, Knowledge and Grid, pp. 314-317, Oct. 2009.
[37] Zhijia Chen, Yang Zhao, Xin Miao, Ying Chenc, Qingbo Wang, “Rapid Provisioning of Cloud Infrastructure Leveraging Peer-to-Peer Networks,” Distributed Computing Systems Workshops, 2009. ICDCS Workshops '09. 29th IEEE International Conference, pp. 324-329, June. 2009.
[38] Bernstein D, Vij D, “Inter-cloud Directory and Exchange Protocol Detail using XMPP and RDF,” Services (SERVICES-1), 2010 6th World Congress, pp. 431-438, July.2010.
[39] Taylor, N.E, Ives, Z.G, “Reliable Storage and Querying for Collaborative Data Sharing Systems,” Data Engineering (ICDE), 2010 IEEE 26th International Conference, pp. 40-51, March. 2010.
[40] Zehua Zhang, Xuejie Zhang, “Realization of Open Cloud Computing Federation Based on Mobile Agent,” Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference, pp. 642-646, Nov. 2009.
[41] Internet control message protocol, RFC 792, Sep. 1981.
[42] TR-069, http://en.wikipedia.org/wiki/TR-069
[43] Simple Network Management Protocol (SNMP), http://en.wikipedia.org/wiki/Simple_Network_Management_Protocol
[44] Internet Assigned Numbers Authority (IANA), http://www.iana.org/
[45] A. Fabrikant, E. Koutsoupias and C.H. Papadimitriou, “Heuristically optimized trade-os: a new paradigm for power laws in the internet,” ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming, pp. 110-122, 2002.
[46] N. Berger, B. Bollobas, C. Borgs, J.T. Chayes, and O. Riordan, “Degree Distribution of the FKP Network Model,” Proceedings of. ICALP 2003 International Colloquium on Automata, Languages and Programming, pp. 725-738, July. 2003.
[47] Freescale MPC8323E, http://www.freescale.com/webapp/sps/site/prod_summary.jsp? code=MPC8323E
[48] GNU Top, http://wiki.ubuntu-tw.org/index.php?title=GNU

指導教授

周立德(Li-Der Chou)

審核日期

2011-8-4

推文