Geometric Message-Filtering Protocols for Distributed Multiagent Environments

Goldin, Alexander; Gotsman, Craig

doi:10.1162/1054746041422352

Cited by 10 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First approaches tried to optimize fully connected meshes by reducing the amount of sent messages with message filtering [6]. As a fully connected mesh inherently imposes communication costs of O(n 2 ), a proper scalability cannot be achieved.…”

Section: Related Workmentioning

confidence: 99%

A scalable Peer-to-Peer-overlay for real-time massively multiplayer online games

Mildner¹,

Triebel²,

Kopf³

et al. 2011

Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques

View full text Add to dashboard Cite

We propose a design for massively multiplayer games with focus on fast-paced action. To reflect the high demands on responsiveness and scalability, we use a fully distributed peer-to-peer network with a dynamic connection scheme. While the capacity of current client/server systems limits the number of players in a game, our system supports a huge number of users by exploiting local interests in the virtual world. By using a publish/subscribe system for message dissemination user interests can be handled efficiently. A Geocast algorithm allows information distribution to arbitrary regions of the virtual world. Simulations show that our design scales well by limiting the number of connections per user even in crowded regions. Moreover, different movement strategies are evaluated for their impact on network load and connection dynamics.

show abstract

Section: Related Workmentioning

confidence: 99%

A scalable Peer-to-Peer-overlay for real-time massively multiplayer online games

Mildner¹,

Triebel²,

Kopf³

et al. 2011

Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques

View full text Add to dashboard Cite

show abstract

“…Closest in spirit to our frontiers approach is that of update-free regions (UFRs) (Makbili, Gotsman & Bar-Yehuda, 1999) (Goldin & Gotsman, 2004). A UFR is a region of the 2D plane in which one of a pairs of users can move without its counterpart being visible as long as they remain within their own UFR.…”

Section: Visibility Partitioningmentioning

confidence: 99%

Enabling Scalability by Partitioning Virtual Environments Using Frontier Sets

Steed

Angus

2006

Presence: Teleoperators & Virtual Environments

View full text Add to dashboard Cite

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) (Airey, Rohlf & Brooks, 1990) (Teller & Sequin, 1991). In a PVS, a world is sub-divided 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), F AB and F BA . By definition, from no cell in F AB is any cell in F BA 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 t 0 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 computer frontiers only as necessary at run-time. The first is distance-based frontiers. This strategy requires pre-computation of an enhanced potentially visible set. The second is greedy frontiers. This strategy is computationally more expensive to compute at run-time, however 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.

show abstract