博碩士論文 955202070 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:31 、訪客IP:3.17.75.227
姓名 陳彥儒(Yan-Ru Chen)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 位置與興趣分群網路系統之廣播搜尋效益提升
(Improvement of Broadcasting Search Efficiency in Locality-Aware and Interest-Based P2P System)
相關論文
★ 整合多樣配置組態下的藍芽射頻驗證系統★ 具檔案敘述相關語查詢之智慧型檔案搜尋系統
★ 具遲到者支援功能之網際網路簡報系統★ 以快速廣播法建構熱門視訊隨選服務伺服器
★ 具事件同步再現特性之遠程電傳展示伺服器★ 無線網路環境下之廣播資訊快速下載
★ 中文網站繁簡互訪協助系統★ 支援時光平移播放之調適性現場直播演算法
★ 用於互動式廣播之段落對齊法★ 熱門影片廣播法之影片區段復原機制
★ 配合熱門影片廣播的本地伺服器高效快取法★ 一個增進SIP在防火牆環境中應用的協同模組
★ 考量網頁熱門度之一致性雜湊法解決 網頁代理伺服器之負載平衡★ 以網域名稱伺服器為基礎之色情網站過濾系統
★ 使用熱門廣播法及支援點對點傳輸之影音內容傳遞網路★ 變動頻寬平滑化之熱門廣播演算法
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 超立方體(Hypercube)結構近年來已被廣泛的應用在許多網路系統當中,其中應用在具有位置知覺(Locality-Aware)及興趣分群(Interest-Based)系統的同儕網路(Peer-to-Peer ; P2P)架構下,超級結點(super node)為底層結點與外界間之通訊、傳輸等橋梁。因此如何有效率的與底層結點作溝通聯繫,將攸關著此網路系統之效率。本篇將提出利用改良式最小成本生成樹演算法,來達成超級結點與其底層結點間之搜尋時間更為快速之目的。
摘要(英) Hypercube structures have been used in many networks in the past few years. One of these systems is locality-aware hybrid system with interest grouping. In this system, super nodes have more resources and bandwidth. Intra-peers and inter-peers are separated by super node. When intra-peers need to communicate with inter-peers, they will send messages by way of the super node. It is important to minimize the transmission time between intra-peers and the super node. In this paper, we proposed an algorithm based on the minimum cost spanning tree. Our purpose is to shorten the transmission time from the super node to intra-peers.
關鍵字(中) ★ 最小成本生成樹
★ 超級節點
★ P2P
★ 興趣分群
★ 位置知覺
★ 超立方體
關鍵字(英) ★ minimum cost spanning tree
★ super node
★ interest-based
★ hypercube
★ locality-aware
論文目次 摘要i
英文摘要(Abstract)ii
誌謝iii
目錄iv
圖目錄v
表目錄vi
第一章 緒論1
第二章 相關研究3
2.1 超立方體架構3
2.2 位置知覺及興趣群5
第三章 系統設計8
3.1 動機與目的8
3.2 系統組成11
3.2.1 超級節點與底層節點間之傳輸時間11
3.2.2 最小生成樹演算法13
3.3 系統運作流程15
3.3.1 改良式最小成本生成樹之演算法15
3.3.2 求n個點之最多段路徑L值之演算法18
3.3.3 以節點數等於8 為例,建立ATMCoST 20
第四章 效能評估23
4.1 實驗環境23
4.2 實驗結果與分析23
4.2.1 平均傳輸時間24
4.2.2 最長路徑與最短路徑傳輸時間差25
4.2.3 傳輸路徑之抖動率26
4.3 效能評比28
第五章 結論31
參考文獻32
參考文獻 [1] http://free.napster.com/
[2] S. H. Kwok and K. Y. Chan,” An Enhanced Gnutella P2P Protocol: A Search Perspective”, Proceedings of the 18th International Conference on Advanced Information Networking and Application, 2004 IEEE
[3] http://freenetproject.org/
[4] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, and Hari Balakrishnan,” Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications”, IEEE/ACM Transactions on Networking, VOL. 11, NO. 1, February 2003.
[5] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker2, ” A Scalable Content-Addressable Network”, ACM SIGCOMM, 161-172, San Diego, California, USA, August 2001.
[6] Antony Rowstron, Peter Druschel, “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems”, Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001). Heidelberg, Germany, November 2001.
[7] KaZaA Homepage, http://www.kazaa.com
[8] Li-Ming Tseng, Chun-Cheng Hu, ”A Locality Awared Hybrid P2P System with Interest Grouping”, Taiwan Academic Network Conference, Taipei, Taiwan, October 2007.
[9] Jörg Eberspächer, Rüdiger Schollmeier, Stefan Zöls, Gerald Kunzmann, Lehrstuhl für Kommunikationsnetze, Technische Universität Münche, “Structured P2P Networks in
Mobile and Fixed Environments”.
[10] Gang Chen, Chor Ping Low, Zhonghua Yang, “Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest”, IEEE Transactions on Parallel and Distributed Systems, VOL. 19, NO. 6, June 2008.
[11] Wen-Tsuen Chen, Chi-Hong Chao, and Jeng-Long Chiang, “An Interested-based Architecture for Peer-to-Peer Network Systems”, Proceedings of the 20th International
Conference on Advanced Information Networking and Applications, April 2006.
[12] Xiaole Bai, Shuping Liu, Peng Zhang, Raimo Kantola, “ICN: Interest-based Clustering Network”, Proceedings of the Fourth International Conference on Peer-to-Peer
Computing, 2004 IEEE.
[13] Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, “Enhancing Locality in Structured Peer-to-Peer Networks”, Proceedings of the Tenth International Conference on Parallel and Distributed Systems, pp.25-34, July 2004
[14] Hiroaki Kobayashi, Hiroyuki Takizawa, Tsutomu Inaba, Yasuaki Takizawa, “A Self-Organizing Overlay Network to Exploit the Locality of Interests for Effective
Resource Discovery in P2P Systems,” IEEE Symposium on applications and the Internet, pp. 246-255, Feb. 2005
[15] S.LENNART JOHNSSON, CHING-TIEN HO, “Optimum Broadcasting and Personalized Communication in Hypercubes”, IEEE Transactions on Computers, VOL. 38, NO. 9, SEPTEMBER 1989.
[16] Xin-Mao Huang, Cheng-Yue Chang, and Ming-Syan Chen, “PeerCluster: A Cluster-Based Peer-to-Peer System”, IEEE Transactions on Parallel and Distributed Systems, VOL. 17, NO. 10, October 2006.
[17 ] Ellis Horowitz , Sartaj Sahni, Susan Anderson-Freed,
Fundamentals of Data Structures in C, Computer Science Press, New York, 2002.
指導教授 曾黎明(Li-Ming Tseng) 審核日期 2008-10-22
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明