A3: A Novel Interest Management Algorithm for Distributed Simulations of MMOGs

Bezerra, Carlos Eduardo; Cecin, F.R.; Geyer, Cláudio F. R.

doi:10.1109/ds-rt.2008.11

Cited by 18 publications

(17 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They range from using Frontier Sets [21], constant mutual notifications [22], recursive map-partitioning [23], Delaunay Triangulation clustering [24], [25] and area of interest management techniques of [20], [26]. The defining characteristic of these works has been the need to effectively group peers so as to minimise P2P bandwidth requirements.…”

Section: Related Workmentioning

confidence: 99%

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

Almashor

Khalil

Tari

et al. 2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

The very notion of a fully Peer-to-Peer (P2P) Virtual Environment (VE) places exacting demands on its underlying network. Subset applications such as online games are notorious for their sensitivity to latency and high bandwidth demands. By omitting the centralised mechanisms that underpin current commercial implementations, the task of managing a disparate and dynamic peer population is made ever more daunting.For any VE, arbitrating the interactions between players is an inescapable need. Online games are equal parts collaboration and competition, requiring robust conflict resolution mechanisms to govern game-play. With centralised systems, arbitration duties are simply assigned to a provisioned server infrastructure. In a P2P system however, the issue looms large. As such, managing arbitration loads across the peer population is the focus here. Being a game-play arbitrator entails added bandwidth and processing demands. Thus, great care is needed to avoid overloading peers whilst providing a responsive and uninterrupted experience.The work here exploits 3D Voronoi Diagrams (3D-VD) as a scalable, flexible and fault-tolerant P2P overlay that is able to automatically balance arbitration loads amongst peers. Simulation results indicate how 3D-VD, with the right arbitrator-selection policy, can appropriately distribute loads and reduce load fluctuations by up to 90%. This is then augmented with algorithms based on classical Newtonian gravity laws. Doing so provides an autonomous method to detect and respond to high-demand areas within the VE. Further experimentation demonstrates an ability to reduce the instances of failed arbitration attempts by 50%.Index Terms-Peer-to-peer overlays, distributed virtual environments, load management.

show abstract

Section: Related Workmentioning

confidence: 99%

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

Almashor

Khalil

Tari

et al. 2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…They range from using Frontier Sets [14], constant mutual notifications [15], recursive map-partitioning [16], Delaunay Triangulation clustering [17], [18] and area of interest management techniques of [6], [19]. The defining characteristic of these prior approaches has been the need to effectively group and categorise peers.…”

Section: B Related Workmentioning

confidence: 99%

Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-Peer Virtual Environments

Almashor

Khalil

2010

2010 IEEE 16th International Conference on Parallel and Distributed Systems

View full text Add to dashboard Cite

Balancing communication workloads is a perennial performance issue in the area of Distributed Virtual Environments (DVE). The stringent time constraints of Multiplayer Online Games (MOG) complicate efforts to effectively distribute the networking load amongst servers. This issue becomes ever more exacting, when we move towards a fully Peer-to-peer virtual world (P2P-VE). We are consequently forced to factor in the limited capabilities of ordinary peers in the network. Traditional MOGs have been built on the client-server (CS) paradigm and the industry brute-force approach of over-provisioning resources is both inelegant and non-resilient in the face of failures. Moving such systems onto P2P architectures mitigates these drawbacks significantly. Our recent application of three-dimensional Voronoi Diagrams (3D-VD) onto P2P-VEs has further introduced desirable load-balancing properties in such systems. This is due to the novel use network capacity as the metric for the 3rd dimension and the subsequent use of the 3D-VD to intelligently appoint dynamic game-play arbitrators from amongst the peer population. This short paper is a preliminary report on the load-balancing properties seen in our extensive simulations. It is shown how this approach is able to appropriately distribute load in a variety of network configurations and peer populations. Thus, the performance of the collaborating peers is enhanced, ultimately leading to better game-play experience.

show abstract

“…Our solution is also related with the area of interest awareness in multiplayer games [36,37] and cooperative work [38,39]. Interest awareness systems manage the consistency of each user's view of the objects of a distributed application according to their distance to some special object(s).…”

Section: Related Workmentioning

confidence: 99%

An adaptive semantics-aware replacement algorithm for web caching

Negrão

Roque

Ferreira

et al. 2015

J Internet Serv Appl

View full text Add to dashboard Cite

As the web expands its overwhelming presence in our daily lives, the pressure to improve the performance of web servers increases. An essential optimization technique that enables Internet-scale web servers to service clients more efficiently and with lower resource demands consists in caching requested web objects on intermediate cache servers. At the core of the cache server operation is the replacement algorithm, which is in charge of selecting, according to a cache replacement policy, the cached pages that should be removed in order to make space for new pages. Traditional replacement policies used in practice take advantage of temporal reference locality by removing the least recently/frequently requested pages from the cache. In this paper we propose a new solution that adds a spatial dimension to the cache replacement process. Our solution is motivated by the observation that users typically browse the Web by successively following the links on the web pages they visit. Our system, called SACS, measures the distance between objects in terms of the number of links necessary to navigate from one object to another. Then, when replacement takes place, objects that are distant from the most recently accessed pages are candidates for removal; the closest an object is to a recently accessed page, the less likely it is to be evicted. We have implemented a cache server using SACS and evaluated our solution against other cache replacement strategies. In this paper we present the details of the design and implementation of SACS and discuss the evaluation results obtained.

show abstract

A3: A Novel Interest Management Algorithm for Distributed Simulations of MMOGs

Cited by 18 publications

References 15 publications

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-Peer Virtual Environments

An adaptive semantics-aware replacement algorithm for web caching

Contact Info

Product

Resources

About