簡易檢索 / 詳目顯示

研究生: 岳孝權
Hsiao-Chuan Yueh
論文名稱: 基於網路編碼的非結構化點對點檔案分享之模擬研究
Simulation Study on Network Coding Based File Sharing over Unstructured P2P network
指導教授: 呂政修
Jenq-Shiou Leu
口試委員: 石維寬
Wei-Kuan Shih
孫敏德
Min-Te Sun
陳省隆
Hsing-Lung Chen
鄭瑞光
Ray-Guang Cheng
學位類別: 碩士
Master
系所名稱: 電資學院 - 電子工程系
Department of Electronic and Computer Engineering
論文出版年: 2011
畢業學年度: 99
語文別: 中文
論文頁數: 62
中文關鍵詞: 網路編碼點對點網路檔案分享非結構化重
外文關鍵詞: Network Coding, Peer-to-Peer Network, File Sharing, Unstructured Overlay Network
相關次數: 點閱:171下載:2
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 網路編碼在近幾年被提出來應用在點對點網路檔案分享系統中,其中利用檔案片段的相互隨機編碼組合,來增加網路的檔案分享傳輸效率。在傳統的點對點檔案分享系統中,多半是以隨機或稀有片段優先的方式選擇下載片段,主要想法是為了避免節點之間重複片段或產生稀有片段的問題。因此,對於片段使用隨機網路編碼組合的方式,將能有效的避免此類問題。然而,某些研究中顯示,使用網路編碼機制將會帶來一些額外花費,其包含編碼及解碼所產生的運算花費與延遲問題,以及傳輸片段係數資訊所產生的額外傳輸訊息花費。在考慮這些花費的前提之下,將會降低使用網路編碼機制的整體傳輸效能表現。因此,本篇將提出一個基於網路編碼的非結構化點對點檔案分享系統,並且在考量網路編碼所帶來的花費的前提之下,與其它未使用網路編碼的傳輸機制進行分析與比較。我們的模擬結果顯示,基於網路編碼的檔案分享系統,在使用正確的傳輸協定以及謹慎選擇檔案的切割片段大小及數量前提下,儘管網路編碼在受限制的編碼及解碼運算下執行,仍將優於其它未使用網路編碼機制的檔案分享系統的效能。


    Network coding based P2P file sharing system has been proposed in recent years. It uses the random combination of encoded pieces to make the file sharing more effective. Most of the conventional P2P file sharing systems adopts a random or rarest piece first transmission policy to avoid too many duplicated pieces and rare pieces occurring in the network. Network coding can simply solve this problem. However, some of the studies show that network coding brings the overhead of coding/decoding delay and message overhead ,after all the performance of network coding is not better than other schemes that without network coding. Therefore, we propose a network coding based file sharing system over unstructured P2P networks considering the overhead from the network coding. We make comparisons with other schemes without network coding. Our simulation results show that the proposed network coding based file sharing system is better than others, when the network coding scheme can adopt an appropriate transmission protocol design even though network coding is executed under a limited computation resource.

    目錄 第1章 介紹 1 1.1 背景簡介 1 1.2 重疊網路 4 1.3 網路編碼 6 1.4 模擬工具 10 1.5 研究目的及動機 15 第2章 模擬系統架構 16 2.1 系統架構 19 2.2 檔案傳輸流程及架構 21 2.3 搜尋及分享檔案 22 2.4 檔案下載要求協定 23 2.5 檔案下載決定機制 26 第3章 網路編碼演算法 28 3.1 隨機網路編碼 29 3.2 片段編碼演算法 32 3.3 解碼演算法 35 3.4 提早解碼 37 第4章 模擬結果與分析探討 38 4.1 編碼延遲分析 38 4.2 編碼/解碼運算子執行速率測量 40 4.3 訊息花費 46 4.4 參數設定 49 4.5 模擬結果 55 第5章 結論 62

    [1] P. Rodriguez and E. W. Biersack, "Dynamic parallel access to replicated content in the Internet," Networking, IEEE/ACM Transactions on, vol. 10, pp. 455-465, 2002.
    [2] Napster. Available: http://www.napster.com/
    [3] Gnutella. Available: http://www.gnutella.com/
    [4] eMule. Available: http://www.emule-project.net/
    [5] Kazaa. Available: http://www.kazaa.com/
    [6] BitTorrent. Available: http://www.bittorrent.com/
    [7] The BitTorrent Protocol Specification. Available: http://wiki.theory.org/index.php/BitTorrentSpecification
    [8] A. Legout, G. Urvoy-Keller, and P. Michiardi, "Rarest first and choke algorithms are enough," presented at the Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, Rio de Janeriro, Brazil, 2006.
    [9] Y. Tian, D. Wu, and K. W. Ng, "Modeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks," in INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, 2006, pp. 1-11.
    [10] Availability. Available: http://wiki.theory.org/Availability
    [11] C. Jia, Z. Hongxiao, and Y. Jinsheng, "Randomness Betters Nearest-Rarest in the P2P Clustering Networks," in Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on, 2009, pp. 1-4.
    [12] C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks," in INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, 2004, p. 130.
    [13] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making gnutella-like P2P systems scalable," presented at the ACM SIGCOMM Conference, 2003.
    [14] R. Ahlswede, C. Ning, S. Y. R. Li, and R. W. Yeung, "Network information flow," Information Theory, IEEE Transactions on, vol. 46, pp. 1204-1216, 2000.
    [15] P. A. Chou and W. Yunnan, "Network Coding for the Internet and Wireless Networks," Signal Processing Magazine, IEEE, vol. 24, pp. 77-85, 2007.
    [16] D. Katabi, S. Katti, H. Wenjun, H. Rahul, and M. Medard, "On Practical Network Coding for Wireless Environments," in Communications, 2006 International Zurich Seminar on, 2006, pp. 84-85.
    [17] C. Fragouli, D. Katabi, A. Markopoulou, M. Medard, and H. Rahul, "Wireless Network Coding: Opportunities & Challenges," in Military Communications Conference, 2007. MILCOM 2007. IEEE, 2007, pp. 1-8.
    [18] S. Katti, D. Katabi, H. Balakrishnan, and M. Medard, "Symbol-level network coding for wireless mesh networks," presented at the Proceedings of the ACM SIGCOMM 2008 conference on Data communication, Seattle, WA, USA, 2008.
    [19] L. Jilin, J. C. S. Lui, and C. Dah-Ming, "On the Performance Bounds of Practical Wireless Network Coding," Mobile Computing, IEEE Transactions on, vol. 9, pp. 1134-1146, 2010.
    [20] G. Ma, Y. Xu, M. Lin, and Y. Xuan. A Content Distribution System based on Sparse Linear Network Coding.
    [21] C. Gkantsidis and P. R. Rodriguez, "Network coding for large scale content distribution," in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, 2005, pp. 2235-2245 vol. 4.
    [22] C. Gkantsidis, J. Miller, and P. Rodriguez, "Comprehensive view of a live network coding P2P system," presented at the Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, Rio de Janeriro, Brazil, 2006.
    [23] C. Gkantsidis, J. Miller, and P. Rodriguez, "Anatomy of a P2P Content Distribution system with Network Coding," ReCALL, vol. IPTPS, 2006.
    [24] C. Gkantsidis and P. Rodriguez Rodriguez, "Cooperative Security for Network Coding File Distribution," in INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, 2006, pp. 1-13.
    [25] W. Nan and N. Ansari, "Downloader-Initiated Random Linear Network Coding for Peer-to-Peer File Sharing," Systems Journal, IEEE, vol. 5, pp. 61-69, 2011.
    [26] K. Nguyen, N. Thinh, and C. Sen-ching, "Peer-to-Peer Streaming with Hierarchical Network Coding," in Multimedia and Expo, 2007 IEEE International Conference on, 2007, pp. 396-399.
    [27] Y. Lingjie, G. Linxiang, Z. Jin, and W. Xin, "SonicVoD: A VCR-supported P2P-VoD system with network coding," Consumer Electronics, IEEE Transactions on, vol. 55, pp. 576-582, 2009.
    [28] D. Boneh, D. Freeman, J. Katz, and B. Waters, "Signing a Linear Subspace: Signature Schemes for Network Coding," in Public Key Cryptography – PKC 2009. vol. 5443, S. Jarecki and G. Tsudik, Eds., ed: Springer Berlin / Heidelberg, 2009, pp. 68-87.
    [29] D. Silva and F. R. Kschischang, "Universal weakly secure network coding," in Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on, 2009, pp. 281-285.
    [30] P. A. Chou, Y. Wu, and K. Jain, "Practical Network Coding," In Allerton, 2003.
    [31] A. Montresor and M. Jelasity, "PeerSim: A scalable P2P simulator," in Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International Conference on, 2009, pp. 99-100.
    [32] J. Pujol-Ahullo and P. Garcia-Lopez, "PlanetSim: An extensible simulation tool for peer-to-peer networks and services," in Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International Conference on, 2009, pp. 85-86.
    [33] Overlay Weaver. Available: http://overlayweaver.sourceforge.net/
    [34] OverSim. Available: http://www.oversim.org/
    [35] I. Baumgart, B. Heep, and S. Krause, "OverSim: A Flexible Overlay Network Simulation Framework," in Proceedings of 10th IEEE Global Internet Symposium (GI '07) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA, 2007, pp. 79-84.
    [36] J. P. Munoz-Gea, J. Malgosa-Sanahuja, P. Manzanares-Lopez, J. C. Sanchez-Aarnoutse, and A. M. Martinez-Rojo, "Simulation of a P2P Application Using OverSim," in Advances in Future Internet, 2009 First International Conference on, 2009, pp. 53-60.
    [37] BISON: Biology-Inspired Techniques for Self-Organization in Dynamic Networks. Available: http://www.cs.unibo.it/bison/
    [38] PlanetSim. Available: http://ants.etse.urv.es/planet/planetsim/
    [39] OMNET++. Available: http://www.omnetpp.org/
    [40] K. Katsaros, V. P. Kemerlis, C. Stais, and G. Xylomenos, "A BitTorrent module for the OMNeT++ simulator," in Modeling, Analysis & Simulation of Computer and Telecommunication Systems, 2009. MASCOTS '09. IEEE International Symposium on, 2009, pp. 1-10.
    [41] Eclipse. Available: http://www.eclipse.org/
    [42] Y. Zhongmei, D. Leonard, W. Xiaoming, and D. Loguinov, "Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks," in Network Protocols, 2006. ICNP '06. Proceedings of the 2006 14th IEEE International Conference on, 2006, pp. 32-41.
    [43] C. Dah Ming, R. W. Yeung, H. Jiaqing, and F. Bin, "Can Network Coding Help in P2P Networks?," in Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006 4th International Symposium on, 2006, pp. 1-5.
    [44] M. Wang and L. Baochun, "How Practical is Network Coding?," in Quality of Service, 2006. IWQoS 2006. 14th IEEE International Workshop on, 2006, pp. 274-278.

    QR CODE