請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/24913
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 黃寶儀(Polly Huang) | |
dc.contributor.author | Cheng-Ying Ou | en |
dc.contributor.author | 歐政穎 | zh_TW |
dc.date.accessioned | 2021-06-08T05:58:16Z | - |
dc.date.copyright | 2007-09-03 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-08-24 | |
dc.identifier.citation | [1] X. Zhang, J. Liu, B. Li, and T.-S. P. Yum,“Coolstreaming/donet: A data-drive overlay network for peer-to-peer live media streaming,” in Proceedings of IEEE IN-FOCOM, March 2005.
[2] J. L. Frank, “F2f: reliable storage open networks,” in Proceedings of IPTPS, 2006. [3] Skype. [Online]. Available: http://www.skype.com [4] Y. Jiang, G. Xue, and J. You, “Toward fault-tolerant atomic data access mutable distributed hash tables,” in Proceedings of the First International Multi-Symposiums on computer and Computational Sciences, 2006. [5] B. Temkow, A.-M. Bosneag, X. Li, and M. Brockmeyer, “Paxondht:achieving consensus distributed hash tables,” in Proceedings of the Symposium on Applications and the Internet (SAINT), 2006. [6] A. Muthitacharoen, S. Gilbert, and R. Morris, “Etna: a fault-tolerant algorithm for atomic mutable dht data,” in MIT Technical Report, June 2005. [7] L. Lamport, “The part-time parliament,” ACM Transactions on Computer Systems, May 1998, pp.16(2):133–169 [8] S.-D. L. Q. Lian, M. Chen, and Z. Zhang, “A practical distributed mutual exclusion protocol dynamic peer-to-peer systems,” in 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004. [9] J.-R. Jiang, C.-T. King, and chi Hsiang Liao, “Murex: A mutable replica control scheme for structured peer-to-peer storage systems,” in GPC, 2006, pp. 93–102 [10] J.-R. Jiang, “The column protocol: A high availability and low message cost solution for managing replicated data,” i Information System, 1995, pp. Vol. 20, No. 8, pp. 687–696 [11] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: scalable Peer-To-Peer lookup service for internet applications,” in Proceedings of the ACM SIGCOMM Conference, 2001, pp. 149–160 [12] The network simulator: ns-2. [Online]. Available: http://www.isi.edu/nsnam/ns [13] P. Maymounkov and D. Mazieres, “Kademlia: A peer-to-peer information system based on the xor metric,” in Proceedings of IPTPS, March 2002. [14] N. Spring, R. Mahajan, and D. Wetherall, “Measuring isp topologies with rocketfuel,” in Proceedings of ACM SIGCOMM, Auguest 2002. [15] Y. Zhu, C. Dovrolis, and M. Ammar, “Dynamic overlay routing based on available bandwidth estimation: a simulation study,” in Comput. Networks, vol. 50, no. 6, pp. 742–762, 2006 [16] M. Steiner, E. W. Biersack, and T. Ennajjary, “Actively monitoring peers kad,” in Proceedings of IPTPS, 2006. [17] S. Guha, N. Daswani, and R. Jain, “An experimental study of the skype peer-to-peer voip system,” in Proceedings of IPTPS, 2006. [18] J. Tian and Y. Dai, “Understanding the dynamic of peer-to-peer systems,” in Proceedings of IPTPS, 2007. [19] J. Li, J. Stribling, T. Gil, R. Morris, and F. Kaashoek, “Comparing the performance of distributed hash tables under churn,” in Proceedings of IPTPS, 2004. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/24913 | - |
dc.description.abstract | 現今已有很多增進同儕網路搜尋檢索的方法被提出,大部分被提出的搜尋檢索方法像是Chord、Pastry、或是Kademlia都是基於分散式雜湊表(DHT)。這些使用不同分散式雜湊表演算法的系統都擁有著不錯的檢索效能。由於同儕網路不安定的特性,這些系統為了要保護資料不軼失都會保存多筆相同的複製資料。然而,這些資料在被頻繁的修改動作下,有可能產生了數筆應是相同的資料卻有不同值的問題。為了避免這個資料不一致的問題,已經有許多達到資料同步的演算法被提出。此篇論文的目的就是去深入了解這些增進資料一治性的演算法。為此,我們實作了一個資料一致性演算法於Chord這個知名的同儕網路檢索搜尋系統上。藉由數個系統化的模擬實驗,我們發現了:(1)就算是在亂度很高的網路狀態下,不管有無加入資料一致性演算法,資料的可獲得程度幾乎都相同;(2)資料的不一致性程度也有類似的結果,就算亂度相當高,兩者之結果也幾乎相同。從實驗結果我們可得知,實作資料一致性演算法於同儕網路檢索搜尋系統上似乎是不必要的。此篇論文結果的發現,對資料一致性於同儕網路檢索搜尋系統上提供了一些實作上的參考建議。 | zh_TW |
dc.description.abstract | There has been a great body of work that proposes mechanisms to enhance the search efficiency of P2P file sharing systems.
Prominent systems such as Chord, Pastry, and Kademlia utilize the concept of distributed hash tables (DHT). These systems, using one of DHT or another, are shown to be efficient at looking up arbitrary files in large-scale P2P networks. To handle churns commonly seen in P2P systems today, most of these systems replicate files and maintain the replicas in accordance to the DHT in use. When the files, or more generally the data, are frequently updated, the data consistency in between replicas becomes a rising problem. To overcome this problem, a number of proposed mechanisms are proposed which aim at keeping the data replicas consistent. To obtain a better understanding of how these kinds of enhancements help improve data consistency, we implement a replica consistency enhancement on a prominent DHT-based peer-to-peer system. Through a set of systematic simulations, we find that: (1) the availability of data of Chord with the replica consistency enhancement is the same as Chord without the enhancement, even when the churn rate is high; and (2) Chord without the enhancement and Chord with the replica consistency enhancement have no inconsistent data, even when the churn rate is high. As the result, the replica consistency enhancement appears to be overkill given its implementation complexity. Our findings in this work provide insights into the making of cost-effective design decisions for P2P mutable file sharing systems. | en |
dc.description.provenance | Made available in DSpace on 2021-06-08T05:58:16Z (GMT). No. of bitstreams: 1 ntu-96-R94921046-1.pdf: 238042 bytes, checksum: ab1a05ca61d3d06761b0cdc7a15116c0 (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | 1 Introduction 1
2 RelatedWork 3 2.1 Paxos Based System ............................. 3 2.2 Locking Based System ............................ 5 3 Implementation of Chord 6 3.1 Chord ..................................... 6 3.2 Implementations ............................... 8 3.2.1 Search ................................. 8 3.2.2 Join .................................. 9 3.2.3 Leave ................................. 11 3.2.4 Publish ................................ 11 3.2.5 Stabilize................................ 11 3.2.6 Fix................................... 12 4 ImplementationofReplicaManagementSystem 13 4.1 Structure................................... 13 4.2 Mechanism.................................. 14 4.2.1 BasicIdea............................... 14 4.2.2 Functionalities Provided by Implementations ............ 15 5 Consistency enhancements 18 5.1 Replica Consistency Enhancement ...................... 18 6 Evaluation20 6.1 Experimental Setup .............................. 20 6.2 The Metrics of the Performance ....................... 22 6.2.1 Experimental Scenario and Parameters ............... 23 6.3 ExperimentResult.............................. 24 6.3.1 Availability of Data.......................... 24 6.3.2 Inconsistency of Objects....................... 26 7 Conclusion 27 Bibliography 28 | |
dc.language.iso | en | |
dc.title | 資料於P2P網路上之一致性 | zh_TW |
dc.title | Data Consistency in the Structured Peer-to-Peer Network | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 陳伶志,朱浩華 | |
dc.subject.keyword | 分散式雜湊表,同儕網路檢索系統,同儕網路,資料一致性, | zh_TW |
dc.subject.keyword | peer to peer,P2P,distributed hash table,DHT,data consistency, | en |
dc.relation.page | 30 | |
dc.rights.note | 未授權 | |
dc.date.accepted | 2007-08-24 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 232.46 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。