Generalized interest management in virtual environments

Masa, Michal; Žára, Jiřı́

doi:10.1145/571900.571904

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quazal's Duplication Spaces allows relatively arbitrary functionality to be used for regulating multiple, co-existing information domains [17]. e-Agora also uses a system of multiple, independent domains; e.g., both chat and navigation data [13].…”

Section: Interest Managementmentioning

confidence: 99%

Comparing interest management algorithms for massively multiplayer games

Boulanger

Kienzle

Verbrugge

2006

Proceedings of 5th ACM SIGCOMM Workshop on Network and System Support for Games - NetGames '06

View full text Add to dashboard Cite

Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer games have to employ sophisticated interest management techniques that only send relevant state changes to each player. This paper compares the performance of different interest management algorithms based on measurements obtained in a real massively multiplayer game using human and computer-generated player actions. We show that interest management algorithms that take into account obstacles in the world reduce the number of update messages between players by up to a factor of 6, and that some computationally inexpensive tile-based interest management algorithms can approximate ideal visibility-based interest management at very low cost. The experiments also show that measurements obtained with computer-controlled players performing random actions can approximate measurements of games played by real humans, provided that the starting positions of the random players are chosen adequately. As the size of the world and the number of players of massively multiplayer games increases, adaptive interest management techniques such as the ones studied in this paper will become increasingly important.

show abstract

Section: Interest Managementmentioning

confidence: 99%

Comparing interest management algorithms for massively multiplayer games

Boulanger

Kienzle

Verbrugge

2006

Proceedings of 5th ACM SIGCOMM Workshop on Network and System Support for Games - NetGames '06

View full text Add to dashboard Cite

show abstract

“…In its simplest model, both the focus and nimbus can be represented by fixed-size spheres around the objects. An object x is then aware of another object y when the focus of x intersects the nimbus of y [1].…”

Section: Introductionmentioning

confidence: 99%

A distributed interest management scheme for massively multi-user virtual environments

Hariri

Shirmohammadi

Pakravan

2008

2008 IEEE Conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems

View full text Add to dashboard Cite

Massively multi user virtual environment (MMVE) applications must deal with the challenge of update message exchange among a large set of nodes distributed over the Internet. Therefore design of scalable network protocols is a major concern in such large scale distributed architectures. Several approaches have been proposed to aid update exchange in MMVEs. Message localization has always been a key point in the design of such distributed network protocols. Area of Interest Management (AoIM) mainly deals with the issues related to the update message localization with respect to the user's interest. As the number of users in the virtual environment increases, update message localization becomes more important in order to prevent the transmission of a huge bulk of unnecessary updates to uninterested users. Therefore, scalable and efficient area of interest management is a crucial point in MMVE design. This paper introduces a new zone selection and distributed regional message filtering architecture for MMVE applications. We propose Delaunay tetrahedrization as a good way of virtual world partitioning due to several promising features. Moreover we propose the partitioning to be done with respect to barriers in order to reach a better performance through the filtering the updates that need not be propagated over the barriers. We will also introduce a distributed interest management protocol based on the previous partitioning technique. Our proposed distributed message dissemination approach is capable of providing the interested users with variable updates rate according to their required Level of Detail.

show abstract

Generalized interest management in virtual environments

Cited by 2 publications

References 0 publications

Comparing interest management algorithms for massively multiplayer games

Comparing interest management algorithms for massively multiplayer games

A distributed interest management scheme for massively multi-user virtual environments

Contact Info

Product

Resources

About