以同儕架構為基礎的3D網路虛擬環境架構是一個嶄新的研究議題，使用同儕架構來取代目前的主從式架構，除了中央伺服器外，使用者同時也可從其他參與者（或稱同儕）取得所需虛擬環境資料，不僅大幅減少中央伺服器的資源消耗，提升系統的擴充性，讓系統在使用者人數不斷增加時亦可正常運作。為了減少將完整虛擬環境資料從網路下載而花費的等待時間，3D技術讓使用者僅須漸進式的下載本身所處位置週遭一定範圍內的虛擬環境場景資料，即可在虛擬環境中遊覽並與其他使用者或與虛擬環境進行即時性的互動；而在使用者瀏覽虛擬環境的時候，3D串流技術也同時在下載未來即時性互動所需要的場景資料。在虛擬環境中，使用者會因為本身所在位置的不同，能夠提供資料的來源（同儕）也因此有所差異，如此一來，如何發現新的資料來源並由最適當的資料來源下載資料（統稱同儕選擇）將是影響3D串流效能的一個重要問題。
本論文針對同儕架構網路虛擬環境的3D串流方式，提出一個新的同儕選擇策略。透過使用者間主動交換新增資料訊息，加快找尋資料提供者的速度；而利用多層次請求範圍，減少特定區域內資料提供者接收過多請求而造成的資源競爭問題，以縮短資料請求完成時間。實驗模擬結果顯示出我們所提出的同儕選擇方法，的確可以比過去的相關方法達到更高的系統擴充性及效能。

The peer-to-peer networked virtual environment (P2P-NVE) is a new research direction. Different from client-server architecture, peer-to-peer architecture allows users to acquire desired 3D virtual environment data from not only the central server but also the other network participants. In order to enable immediate interactions between the users and the virtual environments, 3D streaming techniques fragment object data into several pieces for users to receive those pieces progressively. While acquiring object pieces, users can render the objects at different level of details without a full download. However, even though the desired data can be acquired from other peers, not all peers can be the suppliers as some may be too far from the objects to possess the object pieces. Some peer selection strategies thus have been proposed; however, they have some drawbacks in terms of both latency and message overhead. In this thesis, we propose new peer selection strategies of 3D streaming for P2P-NVEs. Peers periodically exchange incremental content availability information with neighbors, which helps requestors to be aware of suppliers quickly, saving both message overhead and time. We also adopt multi-level request areas to reduce resource contention. We perform simulation experiments for the proposed strategies. Simulation results show that our selection strategies perform better than related ones in terms of system scalability, request hit ratio, latency and data fill ratio of data.

［1］ J. H. Clark, “Hierarchical Geometric Models for Visible Surface Algorithms,” Communication of the ACM, Vol. 19, pp. 547-554, Oct. 1976
［2］ H. Hoppe, “Progressive Meshes,” Proc. of the 23rd annual conference on Computer graphics and interactive techniques, pp. 99-108, Aug. 1996
［3］ J. Royan, C. Bouville and P. Gioia, “PBTree – A new progressive and hierarchical representation for Network-based navigation in urban environments,” Vision Modeling and Visualization, Nov. 2003
［4］ R. Cavagna, C. Bouville and J. Royan, “P2P Network for Very Large Virtual Environment,” Proc. of the ACM symposium on Virtual reality software and technology, pp. 269-276, 2006
［5］ S.-Y. Hu, S.-C. Chang, W.-L Sung and J.-R. Jiang, “A Case for Peer-to-Peer 3D Streaming,” ASCEND Technical Report (ASCEND-TR-002-2006A), Nov. 2006
［6］ S.-Y. Hu, J.-F. Chen and T.-H. Chen, “VON: A Scalable Peer-to-Peer Network for Virtual Environments,” IEEE Network, Vol. 20, pp. 22-31, Jul. 2006
［7］ E. Teler and D. Lischinski, “Streaming of Complex 3D Scenes for Remote Walkthroughs,” Computer Graphics Forum （Proc. Eurographics）, Vol. 20, pp. 17-15, 2001
［8］ G. Hesina and D. Schmalstieg, “A Network Architecture for Remote Rendering,” Proc. of Second International Workshop on Distributed Interactive Simulation and Real-Time Applications, pp. 88-91, Jul. 1998
［9］ S. Rusinkiewicz and M. Levoy, “Streaming QSplat: A Viewer for Networked Visualization of Large, Dense Models,” Proc. of the 2001 Symposium on Interactive 3D graphics, pp. 63-68, 2001
［10］ S. Rusinkiewicz and M. Levoy, “QSplat: A Multiresolution Point Rendering System for Large Meshes,” Proc. of the 27th annual conference on Computer graphics and interactive techniques, pp. 343-352, 2000
［11］ L. Cheng, A. Bhushan, R. Pajarola and M. E. Zarki, “Real-time 3D graphics streaming using mpeg-4,” Proc. IEEE/ACM Wksp. On Broadband Wireless Services and Appl., 2004
［12］ B. Cohen, “Incentives Build Robustness in BitTorrent,” Proc. Wksp. On Economics of Peer-to-Peer Systems, 2003
［13］ D. A. Tran, K. A. Hua and T. T. Do, “A Peer-to-Peer Architecture for Media Streaming,” IEEE Journal on Selected Areas in Communications, Vol. 22, pp. 121-133, Jan. 2004
［14］ Y. Cui, B. Li and K. Nahrstedt, “oStream: Asynchronous Streaming Multicast in Application-Layer Overlay Networks,” IEEE Journal on Selected Areas in Communications, Vol. 22, pp. 91-106, Jan. 2004
［15］ J. Keller and G. Simon, “Solipsis: A Massively Multi-Participant Virtual World,” Proc. Int. Conf. Parallel and Distributed Techniques and Applications (PDPTA 2003), Vol. 1, pp. 262-268, 2003
［16］ F. Aurenhammer, “Vonoroi Diagrams: A Survey of a Fundamental Geometric Data Structure,” ACM Computing Surveys (CSUR), Vol. 23, pp. 345-405, Set. 1991
［17］ D. C. Miller and J. A. Thorpe, “SIMNET: The Advent of Simulator Networking,” Proc. of the IEEE, Vol. 83, pp. 1114-1123, Aug. 1995
［18］ L. Zou, E. W. Zegura and M. H. Ammar, “The effect of peer selection and buffering strategies on the performance of peer-to-peer file sharing systems,” Proceedings of MASCOTS’02, pp. 63-70, 2002
［19］ M. Adler, R. Kumar, K. Ross, D. Rubenstein, T. Suel and D. D. Yao, “Optimal Peer Selection for P2P Downloading and Streaming,” Proc. of IEEE INFOCOM 2005, Vol. 3, ppl. 1538-1549, Mar. 2005
［20］ A. Habib and J. Chuang, “Service Differentiated Peer Selection: An Incentive Mechanism for Peer-to-Peer Media Streaming,” IEEE transactions on Multimedia, Vol. 8, ppl. 610-621, Jun. 2006