簡易檢索 / 詳目顯示

研究生: 郭哲佑
Guo, Zhe-Yao
論文名稱: 在點對點架構下提供以支援率為基準的串流伺服器選擇演算法
Offered Rate Based Streaming Server Selection Algorithm in P2P Architecture
指導教授: 鄭憲宗
Cheng, Sheng-Tzong
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2007
畢業學年度: 95
語文別: 中文
論文頁數: 50
中文關鍵詞: 串流串流伺服器點對點
外文關鍵詞: p2p, media streaming, peer to peer, mobile tv, streaming
相關次數: 點閱:124下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 本文提出了以支援率為基準的串流伺服器選擇演算法,支援率的定義是伺服器端可以提供的上傳頻寬。除此之外,本文也同時比較了此演算法與隨機選擇演算法以及單循環(Round-Robin)排程演算法間的阻塞機率,伺服器負載量,滿載伺服器的個數。由比較的圖表中可以發現,以支援率為基準的串流伺服器選擇演算法的確擁有較低的阻塞機率。有限於一般客戶端的網路流量,當有很多客戶端要收看串流節目時,這時推薦能力比較強的伺服器就變的非常的重要。若是沒有推薦較優良的伺服器,就有可能會造成某些伺服器的負擔大,有些負擔小,造成負載不平衡。客戶端的串流品質也受到影響。

    The paper proposed Offered Rate Based Streaming Server Selection Algorithm. The definition of Offered Rate based on the bandwidth which server peer is willing to supply. In the lecture, we show the difference between Offered Rate Based algorithm, Random Selection, and Round-Robin algorithm on blocking probability, server loading, blocking node number. Finally, we show that our algorithm have better performance exactly. According to the capability of client, when there are huge amount of crow want to watch program, server selection become very important. If you don’t implement load balance strategy, the watching quality will be low.

    內容 第一章 簡介 1 1.1 問題描述以及背景 1 1.2 靈感和解決方法 1 第二章 相關工作 5 2.1 各種不同點對點架構的調查 6 2.1.1 第一代點對點網路架構 8 2.1.2 第二代點對點網路架構 9 2.1.3 第三代點對點網路架構 11 2.1.4 連線能力問題 14 第三章 以支援率為基準的串流伺服器選擇演算法 22 3.1 以支援率為基準的串流伺服器選擇演算法 24 3.2 隨機選擇串流伺服器演算法 29 3.3 單循環排程(Round-Robin Scheduling)伺服器選擇演算法 32 第四章 動態調整串流暫存區大小 35 第五章 模擬結果 39 實驗一:比較以支援率為基礎之演算法與其他機制的差別 39 實驗二:比較動態暫存大小,與靜態暫存大小的差別 43 第六章 結論 47

    [1] BT, http://www.bitcomet.com/
    [2] emule, http://www.emule-project.net/
    [3] Foxy, http://www.gofoxy.net/home/index.shtml
    [4] PPStream, http://www.ppstream.com/
    [5] Tvants, http://cache.tvants.com/
    [6] Napster, http://free.napster.com/
    [7] Gnutella, The Gnutella protocol specification 0.6, http://rfcgnutella.
    sourceforge.net.
    [8] Chord: a scalable peer-to-peer lookup protocol for Internet applications
    Stoica, I.; Morris, R.; Liben-Nowell, D.; Karger, D.R.; Kaashoek, M.F.; Dabek, F.; Balakrishnan, H.;Networking, IEEE/ACM Transactions on,Volume 11, Issue 1, Feb. 2003 Page(s):17 – 32
    [9] CAN:A Scalable Content-Addressable Network
    S Ratsanamy, P Francis, M Handley, R Karp - ACM SIGCOMM Conference, 2001
    [10] Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    P Druschel, A Rowstron - Submission to ACM SIGCOMM, 2001
    [11] Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
    BY Zhao, JD Kubiatowicz, AD Joseph - 2001 - portal.acm.org
    [12] StreamCast: 基于对等网的流媒体分发系统
    G Zhang, LF Liu, CG Liu - 微處理機, 2005 - ceps.com.tw
    [13] Anysee: Multicast-based Peer-to-Peer Media Streaming Service System
    Chao Zhang; Hai Jin; Dafu Deng; Sirui Yang; Quan Yuan; Zuoning Yin;
    Communications, 2005 Asia-Pacific Conference on
    03-05 Oct. 2005 Page(s):274 - 278
    [14] Peercast, http://www.peercast.org/
    [15] PROMISE: peer-to-peer media streaming using CollectCast
    International Multimedia Conference
    Proceedings of the eleventh ACM international conference on Multimedia
    Berkeley, CA, USA
    SESSION: Multimedia streaming and services
    Pages: 45 - 54
    Year of Publication: 2003
    ISBN:1-58113-722-2
    [16] CollectCast: CollectCast: A peer-to-peer service for media streaming
    M Hefeeda, A Habib, D Xu, B Bhargava, B Botev - Multimedia Systems, 2005 - Springer
    [17] Nice: S. Banerjee, B. Bhattacharjee, C. Kommareddy, and
    G. Varghese. Scalable application layer multicast. In Proc. of
    ACM SIGCOMM’02, pages 205–220, Pittsburgh, PA, USA,
    August 2002.
    [18] CoopNet: V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai.
    Distributing streaming media content using cooperative
    networking. In Proc. of NOSSDAV’02, Miami Beach ,FL,
    USA, May 2002.
    [19] ZIGZAG: an efficient peer-to-peer scheme for media streaming
    Tran, D.A. Hua, K.A. Do, T.
    Sch. of Electr.Eng. & Comput. Sci., Central Florida Univ., Orlando, FL, USA;
    This paper appears in: INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE
    [20] Narada: Y. Chu, S. Rao, S. Seshan, and H. Zhang. A case for end
    system multicast. IEEE Journal on Selected Areas in
    Communications (JSAC), 20(8):1456–1471, October 2002.
    [21] PPLive: http://www.pplive.com
    [22] TVants: http://www.tvants.com
    [23] SIM: Scalable Island Multicast for Peer-to-Peer Media Streaming
    Xing Jin; Kan-Leung Cheng; Chan, S.-H.G.;
    Multimedia and Expo, 2006 IEEE International Conference on
    July 2006 Page(s):913 - 916
    Digital Object Identifier 10.1109/ICME.2006.262668
    [24] A peer-to-peer on-demand streaming service and its performance evaluation
    Yang Guo; Kyoungwon Suh; Kurose, J.; Towsley, D.;
    Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on Volume 2, 6-9 July 2003 Page(s):II - 649-52 vol.2
    [25] P2VoD: providing fault tolerant video-on-demand streaming in peer-to-peer environment
    Do, T.T.; Hua, K.A.; Tantaoui, M.A.;
    Communications, 2004 IEEE International Conference on Volume 3, 20-24 June 2004 Page(s):1467 - 1472 Vol.3
    [26] 對等式網路技術.
    Ming-Wei Wu, Ying Dar Lin 電腦與通訊第103期
    CCL TECHNICAL JOURNAL 3.25.2003

    無法下載圖示
    2057-07-26公開
    電子論文及紙本論文均尚未授權公開
    QR CODE