跳到主要內容

簡易檢索 / 詳目顯示

回結果列表
研究生： 邱俊翔
Jiun-Shiang Chiou
論文名稱： 以范諾圖為基礎的對等式網路虛擬環境相鄰節點一致性研究
On Neighbor Consistency for Voronoi-Diagram-Based P2P Networked Virtual Environments
指導教授： 江振瑞
Jehn-Ruey Jiang
口試委員:
學位類別： 碩士
Master
系所名稱： 資訊電機學院 - 資訊工程學系
Department of Computer Science & Information Engineering
畢業學年度： 94
語文別： 英文
論文頁數： 39
中文關鍵詞： 網路虛擬環境 、多人線上遊戲 、對等式 、規模可變性 、相鄰節點一致性 、以范諾圖為基礎的覆疊網路 、可視範圍
外文關鍵詞： 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)
相關次數： 點閱：18  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 網路虛擬環境(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.

    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.

    QR CODE
    :::