跳到主要內容

簡易檢索 / 詳目顯示

研究生: 黃璿豪
Xuan-Hau Huang
論文名稱: 同儕計算網路上內文散佈演算法之實作與效能評估
Implementation and Performance Evaluation of Peer-to-Peer Computing Network Content Distribution Algorithms
指導教授: 高明達
Ming-Tat Ko
何錦文
Chin-Wen Ho
吳俊興
Chun-Hsin Wu
口試委員:
學位類別: 碩士
Master
系所名稱: 資訊電機學院 - 資訊工程學系
Department of Computer Science & Information Engineering
畢業學年度: 93
語文別: 中文
論文頁數: 52
中文關鍵詞: 同儕計算內文散佈
外文關鍵詞: peer to peer computing, content distribution
相關次數: 點閱:14下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在同儕網路的應用中,將內文從來源點傳送到一群點是相當頻繁的行為,因此對於系統的效能有重大的影響。一個有效率的內文散佈演算法(Content Distribution Algorithm)可以提升同儕網路的效能。
    本文中會對Root-Serve演算法、Amplification演算法、Multicast和Amplicast演算法這四個演算法做詳細的討論,並且在PlanetLab這個同儕網路系統實驗平台上實作這些演算法並測試與分析其在實際網路上的各項效能例如等待時間(waiting time)和完成時間(finish time)等。此實驗證實Amplicast演算法卓越的效能。


    第一章 緒論 1 1.1 同儕計算的歷史與發展 1 1.1.1 同儕計算的源起 1 1.1.2 同儕計算的現況與未來 3 1.2 內文散佈 4 第二章 相關內文散佈演算法之研究 7 2.1 內文散佈問題 7 2.2 Root-Serve內文散佈演算法 10 2.3 Amplification內文散佈演算法 12 2.4 Multicast內文散佈演算法 15 2.5 Amplicast內文散佈演算法 20 第三章 系統實作 26 3.1 PlanetLab 26 3.2 系統架構 28 第四章 實驗分析 32 4.1 實驗設定 32 4.2最長等待時間 33 4.3 平均等待時間 37 4.4 完成時間 40 4.5 分支度的影響 44 4.6 負載分佈 45 第五章 結論與未來展望 48 參考文獻 49

    [1] Andersen, D., Balakrishnan, H., Kaashoek, F., and Morris, R., “Resilient Overlay Networks,” Proc. of the 18th ACM Symposium on Operating Systems Principles, pp. 131-145, 2001.
    [2] BitTorrent, http://www.bittorrent.com/
    [3] Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., and Bowman, M., “PlanetLab: An Overlay Testbed for Broad-Coverage Services,” ACM SIGCOMM Computer Communication Review, vol. 33, no. 3, pp. 3-12, 2003.
    [4] Clarke, I., Sandberg, O., Wiley, B., and Hong, T. W., “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” Proc. Of ICSI Workshop on Design Issues in Anonymity and Unobservability, 2000.
    [5] Cohen , B., “Incentives Build Robustness in BitTorrent,” 1st International Workshop on Economics of Peer-to-Peer Systems, 2003.
    [6] Druschel, P. and Rowstron, A., “Storage Management and Caching in PAST, A Large-Scale, Persistent Peer-to-Peer Storage Utility,” Proc. of 18th ACM Symposium on Operating Systems Principles, pp. 188-201, 2001.
    [7] eDonkey, http://www.edonkey2000.com/
    [8] eMule, http://www.emule-project.net/
    [9] Gnutella, http://www.gnutella.com/
    [10] Hefeeda, M. and Bhargava, B., “On-Demand Media Streaming Over the Internet,” Proc. of 9th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS’03), pp. 279-285, 2003.
    [11] Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B., “OceanStore: An Architecture for Global-Scale Persistent Storage,” Proc. of 9th International Conference on Architectural Support for Programming Languages and Operating Systems, 2000.
    [12] Li, X. and Wu, J., “Searching Technologies in Peer-to-Peer Networks,” Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks, J. Wu(ed), CRC Press, 2004.
    [13] Milojicic, D. S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., and Xu, Z., “Peer-to-Peer Computing,” HP Laboratories Palo Alto Technical Report, HPL-2002-57, 2002.
    [14] Minar, N., Hedlund, M., Shirky, C., O’Reilly, T., Bricklin, D., Anderson, D., Miller, J., Kan, G., Langley, A., Brown, A., Waldman, M., Cranor, L., Rubin, A., Dingledine, R., Freedman, M. J., Molnar, D., Dornfest, R., Brickley, D., Hong, T., Lethin, R., Udell, J., Asthagiri, N., Tuvell, W., and Wiley, B., “Peer to Peer: Harnessing the Power of Disruptive Technologies,” O’Reilly & Associates, Inc., 2001.
    [15] Napster, http://www.napster.com/
    [16] PlanetLab, http://www.planet-lab.org/
    [17] Prasad, R. S., Murray, M., Dovrolis, C., and Claffy, K., “Bandwidth Estimation: Metrics, Measurement Techniques, and Tools,” IEEE Network, vol. 17, no. 6, pp. 27-35, 2003.
    [18] 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-172, 2001.
    [19] Rowstron, A. and Druschel, P., “Pastry: Scalable, Decentralized Object Location and Routing for large-Scale Peer-to-Peer Systems,” Proc. of 18th IFIP/ACM International Conference on Distributed Systems Platforms, pp. 329-350, 2001.
    [20] Skype, http://www.skype.com/
    [21] Srisuresh, P. and Egevang, K., “Traditional IP Network Address Translator (Traditional NAT),” RFC 3022, 2001.
    [22] Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., and Balakrishnan, H., “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17-32, 2003.
    [23] Wu, C. H. and Chiang, W. H., “Amplicast: Path-aware Amplifiable Multicasting for Cooperative Content Distribution,” on publish, 2004.
    [24] Xu, D., Defeeda, M., Hambrusch, S., and Bhargava, B., “On Peer-to-Peer Media Streaming,” Proc. of 22nd International Conference on Distributed Computing Systems (ICDCS’02), pp. 363-372, 2002.

    QR CODE
    :::