Enabling Scalability by Partitioning Virtual Environments Using Frontier Sets

We present a class of partitioning scheme that we have called frontier sets. Frontier sets build on the notion of a potentially visible set (PVS). In a PVS, a world is subdivided into cells and for each cell all the other cells that can be seen are computed. In contrast, a frontier set considers pairs of cells, A and B. For each pair, it lists two sets of cells (two frontiers), FAB and FBA. By definition, from no cell in FAB is any cell in FBA visible and vice versa. Our initial use of frontier sets has been to enable scalability in distributed networking. This is possible because, for example, if at time t0 Player1 is in cell A and Player2 is in cell B, as long as they stay in their respective frontiers, they do not need to send update information to each other. In this paper we describe two strategies for building frontier sets. Both strategies are dynamic and compute frontiers only as necessary at runtime. The first is distance-based frontiers. This strategy requires precomputation of an enhanced potentially visible set. The second is greedy frontiers. This strategy is more expensive to compute at runtime, however it leads to larger and thus more efficient frontiers. Network simulations using code based on the Quake II engine show that frontiers have significant promise and may allow a new class of scalable peer-to-peer game infrastructures to emerge.

[1]  Thomas A. Funkhouser,et al.  Real-time acoustic modeling for distributed virtual environments , 1999, SIGGRAPH.

[2]  Michael Zyda,et al.  NPSNET:A Network Software Architecture for LargeScale Virtual Environments , 1994, Presence: Teleoperators & Virtual Environments.

[3]  Daniel Zappala,et al.  Low latency and cheat-proof event ordering for peer-to-peer games , 2004, NOSSDAV '04.

[4]  Tristan Henderson,et al.  Latency and User Behaviour on a Multiplayer Game Server , 2001, Networked Group Communication.

[5]  Michael Zyda,et al.  Networked virtual environments - desgin and implementation , 1999 .

[6]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[7]  Thomas A. Funkhouser,et al.  Network topologies for scalable multi-user virtual environments , 1996, Proceedings of the IEEE 1996 Virtual Reality Annual International Symposium.

[8]  Paolo Scotton,et al.  Network infrastructure for massively distributed games , 2002, NetGames '02.

[9]  Reuven Bar-Yehuda,et al.  Geometric algorithms for message filtering in decentralized virtual environments , 1999, SI3D.

[10]  Michael B. Dillencourt,et al.  Interest Management in Large-Scale Virtual Environments , 2000, Presence: Teleoperators & Virtual Environments.

[11]  D. C. Miller,et al.  SIMNET: the advent of simulator networking , 1995, Proc. IEEE.

[12]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[13]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[14]  David C. Brogan,et al.  Diamond Park and Spline:Social Virtual Reality with 3D Animation, Spoken Interaction, and Runtime Extendability , 1997, Presence: Teleoperators & Virtual Environments.

[15]  Paul Bettner,et al.  1500 Archers on a 28.8: Network Programming in Age of Empires and Beyond , 2004 .

[16]  A. James Stewart,et al.  Effective Compression Techniques for Precomputed Visibility , 1999, Rendering Techniques.

[17]  Anthony Steed,et al.  Supporting scalable peer to peer virtual environments using frontier sets , 2005, IEEE Proceedings. VR 2005. Virtual Reality, 2005..

[18]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.

[19]  Craig Gotsman,et al.  Geometric Message-Filtering Protocols for Distributed Multiagent Environments , 2004, Presence: Teleoperators & Virtual Environments.

[20]  Thomas A. Funkhouser,et al.  RING: a client-server system for multi-user virtual environments , 1995, I3D '95.

[21]  Anthony Steed,et al.  Frontier Sets: A Partitioning Scheme to Enable Scalable Virtual Environments , 2004, Eurographics.

[22]  Christophe Diot,et al.  A distributed architecture for multiplayer interactive applications on the Internet , 1999, IEEE Netw..