English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70588/70588 (100%)
Visitors : 23034572      Online Users : 1084
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9327

    Title: 以范諾圖為基礎的對等式網路虛擬環境相鄰節點一致性研究;On Neighbor Consistency for Voronoi-Diagram-Based P2P Networked Virtual Environments
    Authors: 邱俊翔;Jiun-Shiang Chiou
    Contributors: 資訊工程研究所
    Keywords: 網路虛擬環境;多人線上遊戲;對等式;規模可變性;相鄰節點一致性;以范諾圖為基礎的覆疊網路;可視範圍;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)
    Date: 2006-07-05
    Issue Date: 2009-09-22 11:45:30 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 網路虛擬環境(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.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明