請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/29756
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 雷欽隆 | |
dc.contributor.author | Che-Jui Hsu | en |
dc.contributor.author | 許哲睿 | zh_TW |
dc.date.accessioned | 2021-06-13T01:17:36Z | - |
dc.date.available | 2007-07-23 | |
dc.date.copyright | 2007-07-23 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-07-19 | |
dc.identifier.citation | 1. J. Aikat, J. Kaur, F. D. Smith, K. Jeffay, “Variability in TCP round-trip times.” In Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, pp.279-284, October 2003, Miami Beach, FL, USA
2. Azureus : Java BitTorrent Client http://azureus.sourceforge.net/ 3. BitTorrent: a peer-to-peer file sharing (P2P) communications protocol http://www.bittorrent.org/ 4. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System.” In Proceedings of the International Workshop on Design Issues in Anonymity and Unobservability, pp.46-66, Berkeley, CA, July 2000. 5. M. Costa, M. Castro, R. Rowstron, and P. Key, “Practical Internet coordinates for distance estimation.” In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), pp.178–187, Tokyo, Japan, March 2004. 6. R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris, “Practical, distributed network coordinates.” ACM SIGCOMM Computer Communication Review, Volume 34, Issue 1, pp.113–118, 2004. 7. F. Dabek, R. Cox, F. Kaashoek, and R. Morris, “Vivaldi: A decentralized network coordinate system.” ACM SIGCOMM Computer Communication Review, Volume 34, Issue 4, pp.15–26, 2004. 8. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris, “Designing a DHT for low latency and high throughput.” In Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI ’04), pp. 85–98, San Francisco, California, March 2004. 9. R. Dingledine, N. Mathewson, and P. Syverson. “Tor: The second-generation onion router.” In Proceedings of the 13th USENIX Security Symposium, pp.303-320, San Diego, CA, August 2004. 10. FastTrack: a peer-to-peer protocol , used by Kazaa http://cvs.berlios.de/cgi-bin/viewcvs.cgi/gift-fasttrack/giFT-FastTrack/PROTOCOL?rev=HEAD 11. K. P. Gummadi, S. Saroiu, and S. D. Gribble, “King: Estimating Latency between Arbitrary Internet End Hosts.' In Proceedings of the SIGCOMM Workshop on Internet measurement (IMW), pp.5–18, Pittsburgh, November 2002. 12. M. A. Kaafar, L. Mathy, T. Turletti,and W. Dabbous, “Real attacks on virtual networks: Vivaldi out of tune.” In Proceedings of the SIGCOMM workshop on Large-scale attack defense (LSAD), pp.139–146, Pisa, Italy, September 2006. 13. M. A. Kaafar, L. Mathy, T. Turletti,and W. Dabbous, “Virtual Networks under Attack: Disrupting Internet Coordinate Systems.” In Proceedings of Second CoNext Conference, Lisbon, Portugal, 2006 (http://hal.inria.fr/docs/00/08/52/96/PDF/Co-Next-impact-Cheating-Positionning-systems9.pdf) 14. E. K. Lua, T. G. Griffin, M. Pias, H. Zheng, and J. Crowcroft, “On the accuracy of Embeddings for Internet Coordinate Systems.” In Proceedings of the Internet Measurement Conference (IMC), p.11, Berkeley, CA, October 2005. 15. P. Mayamounkov and D. Mazieres. “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric.” In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS’02), pp.53-65, Cambridge, MA, March, 2002. 16. T. S. E. Ng and H. Zhang, “Predicting Internet network distance with coordinates-based approaches.” In Proceedings of IEEE INFOCOM Twenty-First Annual Joint Conference of the Computer and Communications Societies, Volume 1, pp.170–179, New York, NY, June 2002. 17. p2psim: a simulator for peer-to-peer (P2P) protocols. http://pdos.csail.mit.edu/p2psim/index.html 18. M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti, “Lighthouses for scalable distributed location.” In Proceedings of Second International Workshop on Peer-to-Peer Systems (IPTPS '03), pp. 278–291, Berkeley, CA, February 2003. 19. S. Rewaskar and J. Kaur, “Testing the Scalability of Overlay Routing Infrastructures.” In Proceedings of the Passive Active Measurement (PAM) Workshop, pp. 33–42, Sophia Antipolis, France, April 2004. 20. A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems.” In Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms, pp. 329–350 Heidelberg, Germany, November 2001. 21. Y. Shavitt and T. Tankel, “Big-bang simulation for embedding network distances in Euclidean space.” In Proceedings of IEEE INFOCOM Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, Volume 3, pp. 1922–1932, San Francisco, CA, April 2003. 22. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.” In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp.149-160, San Diego, CA, August 2001. 23. H. Zheng, E. K. Lua, M. Pias, and T. G. Griffin, “Internet Routing Policies and Round-Trip-Times.” In Proceedings of the Passive Active Measurement (PAM), pp.236–250, Boston, March 2005. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/29756 | - |
dc.description.abstract | Vivaldi是一種網路座標系統,其成員擁有一組虛擬的座標用以表示其與其他成員的距離關係。換而言之,其成員可以利用其座標預測出與其他成員溝通時的回傳時間,並因而減少量測回傳時間時所消耗的網路頻寬。可惜的是,Vivaldi並沒有任何的安全保護機制。目前已證實其安全漏洞確實存在,且尚未被解決。在我們的研究中,我們將探討Vivaldi的安全相關議題,指出Vivaldi中與安全有關的部份,並解釋關於攻擊和防禦Vivaldi的概念。並且已此為基礎,設計出兩種可能的防防禦方法。這兩種方法將根據常出現於惡意訊息的特徵,過濾出可能的惡意訊息。最後,模擬及評估的結果將顯示其保護效果和副作用,同時,也証實了惡意訊息的特徵是必須存在的。 | zh_TW |
dc.description.abstract | Vivaldi is a network coordinate system. Each the network node in it has a virtual coordinates which illustrate the distance relationship to other nodes. That is to say, the nodes can use their coordinates to predict their round trip time to other nodes, and thus reduce the traffic consumed by round trip time measurements. Unfortunately, Vivaldi does not consist of any security protection scheme. Currently, the existence of vulnerability of Vivaldi has been proven and yet been solved. In our works, we are going to discuss the security issues of Vivaldi. The security-related part of Vivaldi will be pointed out, and offending and defending concepts will be explained. Furthermore, Base on the concepts we provide, we design two possible defending methods. These two defenses are designed to filter out the information which has some characteristics usually found on malicious one. The simulation and evaluation results show the protection abilities and the side effect of these two defenses. At the same time, the requirements of the characteristics found on malicious nodes are also examined. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T01:17:36Z (GMT). No. of bitstreams: 1 ntu-96-R94944023-1.pdf: 838760 bytes, checksum: bef7825888aac8d5145b121216a552b0 (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | 致謝 i
摘要 ii Abstract iii Content iv List of Figures vi Chapter 1 Introduction 1 Chapter 2 Related Works 4 2.1 Network Coordinate System 4 2.2 Vivaldi: A Fully Distributed Coordinate System 6 2.3 Attacking Vivaldi 8 Chapter 3 Offending Vivaldi 9 3.1 Vulnerabilities of Vivaldi 9 3.2 Round Trip Time 10 3.3 Coordinates 10 3.4 Error Value 12 3.5 Summary 12 Chapter 4 Defending Vivaldi 14 4.1 Defense Policies 14 4.2 Near Defense 16 4.3 Error Defense 17 Chapter 5 Simulation and Evaluation 20 5.1 Simulation 20 5.1.1 Simulation Setup 20 5.1.2 Original Vivaldi System 21 5.1.3 Attacks Against Vivaldi 22 5.1.4 Defenses against the Attack 25 5.1.5 Defenses in Normal Condition 27 5.2 Evaluations 29 5.2.1 Criterion 29 5.2.2 System Accuracies 30 5.2.3 Attacks Facing Error Defense 31 Chapter 6 Discussion 34 6.1 The Failure of Near Defense 34 6.2 An Effective Error Value 36 6.3 Adaptive Error Value Threshold 36 Chapter 7 Conclusion and Future Works 38 7.1 Conclusion 38 7.2 Future Works 39 References 40 | |
dc.language.iso | en | |
dc.title | Vivaldi 網路座標系統安全機制之改進 | zh_TW |
dc.title | The Enhancement of Security Mechanism for Vivaldi Network Coordinate System | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 黃秋煌,劉立,莊文勝 | |
dc.subject.keyword | Vivalds,網路座標系統,封包來回時間預測,同儕網路,網際網路拓樸學, | zh_TW |
dc.subject.keyword | Vivaldi,network coordinate system,round trip time prediction,peer-to-peer,Internet topology, | en |
dc.relation.page | 43 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-07-19 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊網路與多媒體研究所 | zh_TW |
顯示於系所單位: | 資訊網路與多媒體研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 819.1 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。