跳到主要內容

臺灣博碩士論文加值系統

(3.236.124.56) 您好!臺灣時間:2021/08/02 07:21
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:謝民一
研究生(外文):Min-Yi Hsieh
論文名稱:複製可追查型CDN-P2P遞送網路下之近端伺服器選擇
論文名稱(外文):Finding Nearest Neighbors in Replication-Aware CDN-P2P Architecture
指導教授:曾黎明曾黎明引用關係
指導教授(外文):Li-Ming Tseng
學位類別:碩士
校院名稱:國立中央大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:中文
論文頁數:64
中文關鍵詞:內容遞送網路點對點傳輸網路內容快取伺服器使用者快取伺服器選擇複製可追查型CDN-P2P地標點
外文關鍵詞:content delivery networkpeer-to-peer networkcontent replica serverpeer cacheserver selectionreplication aware CDN-P2Plandmark
相關次數:
  • 被引用被引用:5
  • 點閱點閱:201
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
內容遞送網路(CDN)提供了經由內容提供者合法授權的終端使用者就近取得內容服務。內容提供者不需要額外花費硬體設備與網路頻寬的建置,將內容遞送的工作委託給內容遞送網路服務業者,大幅降低了設備成本與網路頻寬的浪費。但是對於內容遞送網路服務業者而言,大量的儲存設備建置以及多媒體需求,帶來更多的網路頻寬的租用,造成龐大的資本支出。
另一方面,在點對點傳輸網路下,任何終端使用者都能將本身所擁有的內容分享給網際網路上的任何使用者,而不受到任何約束。因此點對點傳輸網路下,並不在意內容是否經過合法授權傳遞。換言之,內容提供者無法掌握內容傳遞狀態以及其他合法使用者權益的保障。再者,點對點傳輸中,必須至少有一份完整的內容種子(seed)存在,才能確保內容得以完整取得。
本論文將針對內容提供者權益的保障,也就是不論經由內容快取伺服器或使用者快取下載,都必須先向原始內容提供者報到,提出在複製可追查型CDN-P2P架構下的近端快取伺服器選擇法。在此架構下,所有遞送服務都必須先向內容提供者報到,才能行使遞送服務。並假設內容遞送網路服務業者可以透過一套獎勵回饋機制,吸引使用者加入使用者快取的遞送服務。我們使用地標點為基礎的兩階段伺服器選擇方式:第一階段,終端使用者透過前端內容遞送網路找到近端內容快取伺服器;第二階段則是由內容快取伺服器查詢提供近端使用者快取服務。在此架構下,由於終端使用者必須經由內容提供者指派內容遞送網路才可得到內容下載服務,不管是經由內容快取伺服器或是使用者快取;因此內容提供者權益得以保障。最後,在兩階段的近端伺服器選擇法中,能夠找到最靠近使用者端的伺服器提供服務。
Content Delivery Networks (CDNs) services by distributing content to replica servers located close to users. The content provider entrusts the delivery of CDN service provider to avoid the extra cost for network equipment setup and reduce the need of the bandwidth. However, CDN service provider has to spend huge capital expenditure to deploy and maintain hardware device.
On the other hand, under Peer-to-peer (P2P) Network, anyone could share his content to other users without restriction. Therefore, P2P Network does not care whether the content is authorized legally to transmit or not. In another words, the content provider in P2P system is unable to understand the delivery status and the right using of replication. Moreover, a P2P system requires sufficient number of the seed to guarantee that the content can be transmitted intactly.
In this paper, we proposed a selection procedure to find the nearest server in the replication-aware CDN-P2P system, and to protect the content provider’s rights. In the meantime, we suggested that CDN service provider could provide an approach for end users to join the delivery service through the positive feedback rewarding, and the P2P program must get authorized replication right to enable delivery service. We chose two-step selection approach on landmark-based selection algorithm: (1) the end user finds the nearest content replica server through the content delivery network, (2) the end user gets the nearest peer cache by the content replica server. Under this proposed architecture, everyone must be authorized to download content via the content provider, no matter the content is from replica server or peer cache. Therefore we could guarantee the copyrights of contents and the two-step server selection approach could offer the nearest replica /cache server to the end users.
摘要 I
ABSTRACT II
目錄 IV
圖目錄 VI
表目錄 VIII
第一章 緒論 1
第二章 相關研究 4
2.1 內容遞送網路(CDN) 4
2.2 點對點傳輸網路 (P2P NETWORK) 8
2.3 CDN-P2P混合架構 10
2.4 伺服器選擇 (SERVER SELECTION) 11
第三章 系統設計 19
3.1 複製可追查型CDN-P2P 19
3.1.1系統需求 19
3.1.2 系統環境配置 21
3.1.3 系統運作流程 22
3.2 近端伺服器選擇法 24
3.2.1 地標點建立 26
3.2.2 近端內容快取伺服器選擇 26
3.2.3 近端使用者快取選擇法 31
第四章 效能模擬分析 38
4.1 模擬環境 38
4.2 效能量測 39
第五章 系統實作 44
5-1 功能模組 44
5.2實作方法 45
5.3 近端伺服器選擇流程 47
第六章 結論 51
參考文獻 53
[1]Peng, G., "CDN: Content Distribution Network", Technical Report TR-125, Experimental Computer Systems Lab, Department of Computer Science, State University of New York, Stony Brook, NY 2003.
[2]田慶明、林柏青、林盈達,"內容遞送網路之演進與評估",網路通訊雜誌,第127期,2002年2月。
[3]A. Vakali and G. Pallis, "Content delivery networks: Status and trends", IEEE Internet Computing, Volume: 7, Issue: 6, pp: 68 – 74, Nov.-Dec. 2003.
[4]http://www.akamai.com/
[5]G. Agarwal, R. C. Shah and J. Walrand, "Content Distribution Architecture using Network Layer Anycast", IEEE Workshop on Internet Applications (WIAPP) 2001.
[6]Akamai, "Fast Internet Content Delivery with FreeFlow", Akamai white paper, April 2000.
[7]楊長上,"內容分發/遞送網路服務商在台灣企業資訊市場之研究",國立臺灣大學資訊管理研究所碩士論文,民國90年。
[8]D. Xu, H-K. Chai, C. Rosenberg, and S. Kulkarni; " Analysis of a Hybrid Architecture for Cost-Effective Streaming Media Distribution", SPIE Conference on Multimedia Computing and Networking (MMCN 03), Santa-Clara, CA, Jan. 2003.
[9]M.Kelaskar, V. Matossian, P.Mehra, D.Paul and M.Prashar, "A Study of Discovery Mechanisms for Peer-to-Peer Applications", Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid(CCGRID’02) PP 1, 2002.
[10]Napster. http://www.napster.com
[11]The Gnutella Protocol Specification v0.4 Revision 1.2.
[12]Karl Aberer , Magdalena Punceva , Manfred Hauswirth , Roman Schmidt, "Improving Data Access in P2P Systems", IEEE Internet Computing, v.6 n.1, p.58-67, January 2002.
[13]Ian Clarke, Theodore W. Hong, Scott G. Miller, Oskar Sandberg, and Brandon Wiley, "Protecting Free Expression Online with Freenet," IEEE Internet Computing , January/February 2002.
[14]Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. "Wide-area cooperative storage with CFS". In Proc. 18th ACM Symposium on OperatingSystems Principles (SOSP '01), Oct. 2001.
[15]Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications", ACM SIGCOMM 2001, pp. 149-160, San Deigo, CA, August 2001.
[16]A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems", in Proc. Middleware, pp. 329-350, Heidelberg, Germany, Nov. 2001.
[17]S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Schenker, "A scalable content-addressable network", in Proc. SIGCOMM, San Diego, CA, pp. 161-172, Aug. 2001.
[18]James D. Guyton and Michael F. Schwartz. "Locating nearby copies of replicated internet servers". In Proceedings of SIGCOMM '95, August 1995.
[19]Mark Crovella, Robert Carter, "Dynamic Server Selection in the Internet", Proceedings of the 3 rd . IEEE HPCS '95, 1995.
[20]K. Hanna, N. Natarajan, , and BN Levine, "Evaluation of a novel two-step server selection metric", in Proceedings of IEEE ICNP, Nov. 2001.
[21]W. Tang, F. Du, MW Mutka, LM Ni, and AH. Esfahanian, "Supporting Global Replicated Services by a Routing-Metric-Aware DNS", in The Second International Workshop on Advanced Issues of E-commerce and Web-based Information Systems, pp. 67-72, June 2000.
[22]Chi-Chung Cheung, Man-Ching Yuen, Angus CH Yip, "Dynamic DNS for Load Balancing", Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW 2003) , pp 962-965, Rhode Island, USA, April 2003.
[23]D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin und R. Panigrahy, "Consistent hashing and random trees: Distributed cashing protocols for relieving hot spots on the World Wide Web", in Proceedings of the 29th ACM Symposium on Theory of Computing (STOC), 654-663, 1997.
[24]劉之揚,"使用熱門廣播法及支援點對點傳輸之影音內容傳遞網路",國立中央大學資訊工程研究所碩士論文,民國92年。
[25]A. Shaikh, R. Tewari, and M. Agrawal, "On the Effectiveness of DNS-based Server Selection," Proc. IEEE INFOCOM 2001, April 2001.
[26]Hirokazu Miura and Miki Yamamoto. " Content Routing with Network Support Using Passive Measurement in Content Distribution Networks". In Proceedings of the IEEE International Conference on Computer Communications and Networks, Miami, FL , October 2002.
[27]Ng, TSE, and H. Zhang. "Towards Global Network Positioning." Proceedings of ACM SIGCOMM IMW 2001, pp. 25-35, San Fransisco, CA, USA, Nov. 2001.
[28]M. Costa, M. Castro, A. Rowstron, and P. Key. "PIC: Practical Internet Coordinates for Distance Estimation". In 24th IEEE International Conference on Distributed Computing Systems (ICDCS’ 04), Tokyo, Japan, March 2004.
[29]S. Ratnasamy, M. Handley, R. Karp and S. Shenker, "Topologically-aware overlay construction and server selection", in Proc. INFOCOM, pp. 1190- 1199, 2002.
[30]郭廖軒,"以網域名稱伺服器為基礎之色情網站過濾系統",國立中央大學資訊工程研究所碩士論文,民國92年。
[31]M. Gritter and DR Cheriton, "An architecture for content routing support in the Internet", in Proc. USENIX Symp. Internet Technologies and Systems, pp. 37-48, Mar. 2001.
[32]K. Calvert, J. Eagan, S. Merugu, A. Namjoshi, J. Stasko, and E. Zegura, "Extending and enhancing GT-ITM". Proceedings of Workshop on Models, Methods and Tools for Reproducible Network Research (MoMeTools), August 2003.
[33]E. W. Zegura, K. Calvert and S. Bhattacharjee, "How to model an Internetwork", in Proc. IEEE INFOCOM, pp. 594-602, San Francisco, CA, 1996.
[34]The Network Simulator. http://www.isi.edu/nsnam/ns
[35]Zhichen Xu , Chunqiang Tang , Zheng Zhang, "Building Topology-Aware Overlays Using Global Soft-State", Proceedings of the 23rd International Conference on Distributed Computing Systems, p.500, May 19-22, 2003.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top