博碩士論文 93522085 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:15 、訪客IP:3.235.29.190
姓名 邱俊翔(Jiun-Shiang Chiou)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 以范諾圖為基礎的對等式網路虛擬環境相鄰節點一致性研究
(On Neighbor Consistency for Voronoi-Diagram-Based P2P Networked Virtual Environments)
相關論文
★ 以IEEE 802.11為基礎行動隨意無線網路之混合式省電通訊協定★ 行動隨意網路可調適及可延展之位置服務協定
★ 同儕式網路虛擬環境高效率互動範圍群播★ 巨量多人線上遊戲之同儕網路互動範圍語音交談
★ 基於范諾圖之同儕式網路虛擬環境狀態管理★ 利用多變量分析 之多人線上遊戲信任使用者選擇
★ 無位置資訊無線感測網路之覆蓋及連通維持★ 同儕網路虛擬環境3D串流同儕選擇策略
★ 一個使用802.11與RFID技術的無所不在導覽系統U-Guide之設計與實作★ 同儕式三維資料串流
★ IM Finder: 透過即時通訊網路線上使用者找尋解答★ 無位置資訊無線感測網路自走車有向天線導航與協調演算法
★ 多匯點無線感測網路省能及流量分散事件輪廓追蹤★ 頻寬感知同儕式3D串流
★ 無線感測網路旋轉指向天線定位法★ 網路虛擬環境多重伺服器動態負載平衡
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 網路虛擬環境(Networked Virtual Environments, NVEs)近來變得越來越普及,例如多人線上遊戲(Massive Multiplayer Online Games, MMOGs)就是一個例子。傳統的網路虛擬環境使用主從(client/server)架構,然而因為伺服器的資源是有限的,這種架構無法容納大量的使用者。為了能在同一時間容納更多的使用者,使用對等式(peer-to-peer, P2P)架構是一種可行的解決方法。這種系統藉由分散負荷至所有的參與者可以在同一時間容納超過百萬的使用者。雖然對等式網路虛擬環境可以解決規模可變性(scalability)問題,但是其他如一致性這樣的問題也隨之產生。在這篇論文中,我們將重點放在相鄰節點一致性(neighbor consistency)的研究。相鄰節點一致性可以被視為在可視區域(area of interest, AOI)內觀察到的節點與實際上的節點的比例。我們假設底層的覆疊網路是擁有良好相鄰節點一致性的VON網路(Voronoi-based overlay network)。我們指出在此網路上影響相鄰節點一致性的三個因素,分別為封包遺失(packet loss),移動性(mobility)與節點故障(node failure)。我們並提出可調整可視範圍緩衝區(adaptive AOI buffer)與關鍵節點偵測(critical node detection)來改善上列因素對於相鄰節點一致性的影響。我們並執行模擬以顯示在採用所提方法之前與之後,上列因素所產生的影響。
摘要(英) Networked Virtual Environments (NVEs) such as Massive Multiplayer Online Games (MMOGs) are getting more and more popular in recent years. NVEs are implemented by client/server architecture traditionally but do not scale well due to the limitation of server resources. To increase the scalability, another solution, peer-to-peer (P2P) architecture, is recently proposed. P2P NVE can potentially achieve better scalability with an extremely large number of users (e.g. over one million) by distributing the server load to all participants. Although P2P NVE can potentially solve the scalability issues, other important issues such as consistency remain unexplored. In this thesis, we focus on neighbor consistency, which is the ratio between the number of known nodes and the number of actual nodes within a node’’s area of interest (AOI). We assume the underlying overlay is Voronoi-based Overlay Network (VON), which can achieve good neighbor consistency. We address three factors that affect neighbor consistency for such a network, namely, packet loss, mobility and node failure. We propose the adaptive AOI buffer and the critical node detection mechanisms to reduce the negative impacts of those factors on neighbor consistency. We also perform simulation to demonstrate the effects of those factors before and after adopting the proposed mechanisms.
關鍵字(中) ★ 網路虛擬環境
★ 多人線上遊戲
★ 對等式
★ 規模可變性
★ 相鄰節點一致性
★ 以范諾圖為基礎的覆疊網路
★ 可視範圍
關鍵字(英) ★ Networked virtual environment (NVE)
★ Voronoi-based overlay network (VON)
★ massive multiplayer online game (MMOG)
★ peer-to-peer (P2P)
★ scalability
★ neighbor consistency
★ area of interest (AOI)
論文目次 Table of Contents
中文摘要 I
Abstract II
誌謝 III
Table of Contents IV
List of Figures VI
List of Tables VIII
1 Introduction 1
2 Preliminaries 4
2.1 P2P Networked Virtual Environments 4
2.1.1 Networked Virtual Environments 4
2.1.2 Peer-to-Peer System 4
2.1.3 P2P NVEs 5
2.2 Voronoi-Based Overlay Networks 6
2.2.1 Voronoi Diagram 6
2.2.2 Design of VON 8
2.3 Neighbor Consistency 11
2.4 Overlay Partition 12
3 Factors Affecting Neighbor Consistency 15
3.1 Packet Loss 15
3.2 Mobility 16
3.3 Node Failure 18
4 Proposed Solutions 19
4.1 Conquering Packet Loss 19
4.2 Conquering Mobility 20
4.3 Conquering Node Failure 21
5 Simulation Results 24
5.1 Packet Loss 25
5.2 Mobility 26
5.3 Node Failure 28
6 Conclusion and Future Work 36
References 38
參考文獻 [A91] F. Aurenhammer, “Voronoi diagrams—a survey of a fundamental geometric data structure,” ACM Computing Surveys (CSUR), vol. 23, no. 3, pp. 345-405, 1991.
[DG99] C. Diot and L. Gautier, “A distributed architecture for multiplayer interactive applications on the Internet,” IEEE Network, vol. 13, no. 4, pp. 6-15, 1999.
[HCC06] Shun-Yun Hu, Jui-Fa Chen and Tsu-Han Chen, "VON: A scalable peer-to-peer network for virtual environments," IEEE Network (accepted pending minor revision), 2006.
[KAM04] Y. Kawahara, T. Aoyama, and H. Morikawa, “A peer-to-peer message exchange scheme for large-scale networked virtual environments,” Telecomm. Sys., vol. 25, no. 3-4, pp. 353–370, 2004.
[KM02] T. Klingberg and R. Manfred, “The Gnutella 0.6 Protocol Draft,” http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html, June 2002.
[KS03] J. Keller and G. Simon, “Solipsis: A massively multi-participant virtual world,” in Proc. Int. Conf. Parallel and Dist. Tech. and App. (PDPTA 03), 2003, pp. 262-268.
[LNS02] J. Liebeherr, M. Nahas and W. Si, "Application-layer Multicasting with Delaunay Triangulation Overlays," IEEE JSAC, vol. 20, no. 8, pp. 1472-1488, 2002.
[MKMA04] N. Matsumoto, Y. Kawahara, H. Morikawa, and T. Aoyama, "A Scalable and Low Delay Communication Scheme for Networked Virtual Environments," in Proceedings of 1st IEEE International Workshop on Networking Issuess in Multimedia Entertainment (NIME2004), Dallas, TX, U.S.A, November 2004.
[MT95] D. C. Miller and J. A. Thorpe, “SIMNET: The Advent of Simulator Networking,” in Proc. IEEE, vol. 83, no 8, pp. 1114-1123, Aug. 1995.
[N03] Napster, Napster Website, http://www.napster.com, 2003.
[SKH01] J. Smed, T. Kaukoranta, and H. Hakonen, "Aspects of Networking in Multiplayer Computer Games," in Proc. of Int. Conf. on Application and Development of Computer Games (ADCOG). Nov. 2001, pp. 74-81.
[SMKKB01] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in Proceedings of SIGCOMM2001, Aug. 2001, pp. 149–160.
[SZ99] S. Singhal and M. Zyda, Networked Virtual Environments: Design and Implementation, ACM Press, New York, 1999.
指導教授 江振瑞(Jehn-Ruey Jiang) 審核日期 2006-7-6
推文 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聯絡  - 隱私權政策聲明