政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/133458

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/133458

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113318/144297 (79%)
造訪人次 : 51007858 線上人數 : 889

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系碩士在職專班 > 學位論文 > Item 140.119/133458

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/133458

題名:	穿透NAT的同儕網路資料發佈與檢索平台之研究 Study on a Cross-NAT P2P network platform for data publishing and searching
作者:	謝育霖 Hsieh, Yu-Lin
貢獻者:	蔡子傑 Tsai, Tzu-Chieh 謝育霖 Hsieh, Yu-Lin
關鍵詞:	大數據點對點同儕網路資料發佈與檢索平台人工智慧機密性跨網域協同網路 Big Data P2P Data Publishing and Retrieval AI Confidentiality NAT Cross Domain Federated Domain Kademlia
日期:	2020
上傳時間:	2021-01-04 11:31:20 (UTC+8)
摘要:	大數據（Big Data）是近年的熱門議題，能為公眾創造更大的價值。然而不管是資料的發佈或是檢索，對目前現有的資料系統都有某些限制與不足。我們提出一個創新的P2P點對點同儕網路資料管理平台，並試圖以一個外溢保單的情境以說明我們系統的設計。我們預期此平台，將能讓參與者上傳資料與確保資料機密性，並可讓大數據與人工智慧演算法運用於平台進行運算，讓資料提供者的資料能大幅提升其實用性與影響力。由於NAT網路環境對於P2P的侷限，我們也提出新的NAT-RelayProtocol的網路架構，以利於跨網域（Cross-Domain）下的節點可以彼此儲存、獲取與搜尋資料，進而發展成平台的協同網域（Federated Domain）。此外，對於平台上的資料進行加密與解密的防護，用以增加存放於平台資料的安全性，同時也保障資料上傳者的所有權。我們改善Kademlia演算法，提出資料過濾方法，讓搜尋資料在運作上更全面且有效率。在這個平台也納入公平定價商業模式機制，使平台能更具永續性並擴大其應用的範圍。此平台的雛型驗證了我們的設計，期待有朝一日能落實。 Big Data is a hot topic in recent years, which can create greater value for the public. However, for either data publishing or retrieval, the existing data managementsystems still encounter many limitations and insufficiencies. We propose an innovative P2P data management platform and illustrate our design in an example for the health insurance spillover policy. We expect that the platform will allow participants to upload data with ensuring the data confidentiality, and allow big data and artificial intelligence algorithms to be associated with the platform, so that data can be fullyutilized to its greatest effectivenessand influence. Due to the barrier characteristics of NAT for P2P application, we also develop a new NAT-Relay Protocol network architecture, so that nodes under the cross-domain (Cross-Domain) can store, obtain and search data with each other, and thus form the Federated Domain of the platform. In addition, data encryption is used to increase the security of the data stored on the platform and also protect the ownerships of the data uploaders. We adopt the Kademlia algorithm, and modify it by adding a data filter method integrated with computingto make data operation more holistically and efficiently.A pricing business model mechanism can be also included to let the platform more sustainable and expand its scope of applications. This prototyping of the platform validates our design.It is expected to be in practice in the near future.
參考文獻:	[1] 李振武，白英彩，“影響 Internet 未來的對等網路”，上海交通大學金橋網路工程中心，技術報告，2003。 [2] Sylvia Paul Ratnasamy：“A Scalable Content-Addressable Network,” PhD Dissertation of U.C.Berkeley, 2002 [3] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan：“Chord：A Scalable Peer-to-peer Lookup Service for Internet Applications,” SIGCOMM’01, August 27-31, 2001，CA, USA. [4] A. Rowstron and P. Druschel：“Pastry：Scalable, distributed object location and routing for large – scale peer-to-peer systems.” In Proc. IFIP/ACM Middleware 2001, Heidelberg, Germany, Nov. 2001. https：//udn.com/news/story/7239/3586060 [5] Keith W. Ross, Dan Rubenstein, “P2P Systems”. [6] J Benet, IPFS - Content Addressed, Versioned, P2P File System., arXiv preprint arXiv：1407.3561, 2014 [7] Y Zhao, K Kim, N Venkatasubramanian, DYNATOPS：a dynamic topic-based publish/subscribe architecture, DEBS `13：Proceedings of the 7th ACM international conference on Distributed event-based systemsJune 2013 Pages 75–86 [8] D. Zhang, C. Zheng, H. Zhang, et al. Identiﬁcation and analysis of Skype peer-to-peer traffic, in：Proceedings of the Fifth International Conference on Internet and Web Applications and Services, 2010, pp. 200-206. [9] M. Mauch, S. Dixon, Simultaneous estimation of Chords and musical context from audio, IEEE Transactions on Audio, Speech, and Language Processing, 2010, 18（6）, pp. 1280-1289. [10] MIT, P2PSim：a simulator for Peer-to-Peer protocol, http：//pdos.csail.mit.edu/P2Psim/ [EB/OL], 2010 [11] Adán G. Medrano-Chávez, Elizabeth Pérez-Cortés, Miguel Lopez-Guerrero, A performance comparison of Chord andKademliaDHTs in high churn scenarios., 2015 – Springer. [12] Petar Maymounkov and David Mazi"eres, Kademlia：A Peer-to-Peer Information System Based on the XOR Metric,New York University, 2002. [13] Tonglin Li, RamanVerma, Xi Duan, Hui Jin, Ioan Raicu, Exploring distributed hash tables in High End computing., ACM SIGMETRICS Performance Evaluation Review, December, 2011. [14] An Overview of Cryptography, Available：https：//www.garykessler.net/library/crypto.html [15] Traversal Using Relays around NAT（TURN）：Relay Extensions to Session Traversal Utilities for NAT（STUN）, RFC 5766, 2010. [16] S. Guha, Y. Takeda and P. Francis, “NUTSS：A SIP-based approach to UDP and TCP network connectivity,“ in Proceedings of ACM SIGCOMM Workshops, pp. 43-48, 2004. [17] Interactive Connectivity Establishment（ICE）：A Protocol for Network Address Translator（NAT） Traversal for Offer/Answer Protocols, RFC 5245, 2010. [18] Rone-Yan Huang, Department of Computer Science National Chengchi University, MCLAB, Design and Implementation of a Data Publishing, Subscription and Computing Platform on the P2P Network, 2021. [19] Traversal Using Relays around NAT（TURN）：Relay Extensions to Session Traversal Utilities for NAT（STUN）, RFC 5766, 2010. [20] S. Guha, Y. Takeda and P. Francis, “NUTSS：A SIP-based approach to UDP and TCP network connectivity,“ in Proceedings of ACM SIGCOMM Workshops, pp. 43-48, 2004. [21] Interactive Connectivity Establishment（ICE）：A Protocol for Network Address Translator（NAT） Traversal for Offer/Answer Protocols, RFC 5245, 2010. [22] Weixiong Rao, Roman Vitenberg, Lei Chen, Sasu Tarkoma, MTAF：An Adaptive Design for Keyword-Based Content Dissemination on DHT Networks, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 26, NO. 4, APRIL 2015. [23] Bassirou Ngom, Mesaac Makpangou, Summary Prefix Tree：An over DHT Indexing Data Structure for Efficient Superset Search, 2017 IEEE 16th International Symposium on Network Computing and Applications（NCA）. [24] Jeffrey DeanandSanjay Ghemawat, MapReduce：Simplified Data Processing on Large Clusters, googleusercontent.com,2004. [25] Praveen Khethavath, Johnson Thomas, Eric Chan-Tin, Hong Liu,Introducing a Distributed Cloud Architecture with Efficient Resource Discovery and Optimal Resource Allocation, IEEE Ninth World Congress on Services, 2013.
描述:	碩士國立政治大學資訊科學系碩士在職專班 107971021
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0107971021
資料類型:	thesis
DOI:	10.6814/NCCU202001817
顯示於類別:	[資訊科學系碩士在職專班] 學位論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
102101.pdf		5496Kb	Adobe PDF2	0	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋