Presentation – NetGames 2008 Performance Analysis of Game world Partitioning Methods for Multiplayer Mobile Gaming Kusno Prasetya Bond University.

Slides:



Advertisements
Similar presentations
Interference Cancellation in Two-Path Successive Relay System with Network Coding Chunbo Luo, Dr. Yu Gong & Prof. Fuchun Zheng School of Systems Engineering.
Advertisements

Dynamic Thread Assignment on Heterogeneous Multiprocessor Architectures Pree Thiengburanathum Advanced computer architecture Oct 24,
Simulated Annealing Premchand Akella. Agenda Motivation The algorithm Its applications Examples Conclusion.
A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
Urban Encounters: The game of real life Eamonn O’Neill University of Bath Department of Computer Science Vassilis Kostakos University of Madeira / Carnegie.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Effectively Indexing Uncertain Moving Objects for Predictive Queries School of Computing National University of Singapore Department of Computer Science.
Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang
Carnegie Mellon University Complex queries in distributed publish- subscribe systems Ashwin R. Bharambe, Justin Weisz and Srinivasan Seshan.
Performance Comparison of Existing Leader Election Algorithms for Dynamic Networks Mobile Ad Hoc (Dynamic) Networks: Collection of potentially mobile computing.
6/28/2015CSC82601 Radio-resource sharing for adhoc Networking with UWB. by Francesca Cuomo, Cristina Martello, Andrea Baiocchi, and Fabrizio Capriotti.
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
General Purpose 3D Cellular Automata Modeller. A Regular Lattice of Cells, each obeying the same set of rules Simple rules for individual cells can produce.
Secure Incremental Maintenance of Distributed Association Rules.
Switch-and-Navigate: Controlling Data Ferry Mobility for Delay-Bounded Messages Liang Ma*, Ting He +, Ananthram Swami §, Kang-won Lee + and Kin K. Leung*
UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf.
Introduction to Networked Graphics Part 4 of 5: Bandwidth Management & Scalability.
Real Time Motion Planning. Introduction  What is Real time Motion Planning?  What is the need for real time motion Planning?  Example scenarios in.
Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William Arbaugh (UCLA, IBM, U. Maryland) MobiHoc 2005 Toward Resilient Security in Wireless Sensor Networks.
EFFECTIVE LOAD-BALANCING VIA MIGRATION AND REPLICATION IN SPATIAL GRIDS ANIRBAN MONDAL KAZUO GODA MASARU KITSUREGAWA INSTITUTE OF INDUSTRIAL SCIENCE UNIVERSITY.
Athanasios Kinalis ∗, Sotiris Nikoletseas ∗, Dimitra Patroumpa ∗, Jose Rolim† ∗ University of Patras and Computer Technology Institute, Patras, Greece.
Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Cross Border Intraday on the North Italian Borders Introduction Forum Rome, 13 th March 2012.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
Final Presentation Avilés-Angélica, Blanco-Alberto, Fuentes-Alba, Pell-Xavier, Schenini-Juan, Talukder-Nurul.
Efficient AOI-Cast for Peer-to-Peer Networked Virtual Environments.
A Mechanism for Communication- Efficient Broadcast Encryption over Wireless Ad Hoc Networks Johns Hopkins University Department of Computer Science Reza.
User Mobility Modeling and Characterization of Mobility Patterns Mahmood M. Zonoozi and Prem Dassanayake IEEE Journal on Selected Areas in Communications.
Topics in Internet Research: Project Scope Mehreen Alam
Grid-Based Energy-Efficient Routing from Multiple Sources to Multiple Mobile Sinks in Wireless Sensor Networks Kisuk Kweon, Hojin Ghim, Jaeyoung Hong and.
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
On the Effects of Loose Causal Consistency in Mobile Multiplayer Games Angie Chandler, Joe Finney Computing Department Infolab 21, South Drive Lancaster.
Minimum spanning tree diameter estimation in random sensor networks in fractal dimension Students: Arthur Romm Daniel Kozlov Supervisor: Dr.Zvi Lotker.
A Practical Performance Analysis of Stream Reuse Techniques in Peer-to-Peer VoD Systems Leonardo B. Pinho and Claudio L. Amorim Parallel Computing Laboratory.
Forecast scheduling for mobile users Hind ZAARAOUI, Zwi ALTMAN, Eitan ALTMAN and Tania JIMENEZ Idefix, November 3rd 2015.
Dzmitry Kliazovich, Fabrizio Granelli, University of Trento, Italy
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Analysis the performance of vehicles ad hoc network simulation based
Dzmitry Kliazovich, Fabrizio Granelli, University of Trento, Italy
Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelian Xiao
Introduction to Load Balancing:
Alternatives to Mobile Agents
Stochastic Streams: Sample Complexity vs. Space Complexity
Xiaobing Wu, Guihai Chen and Sajal K. Das
Empirically Characterizing the Buffer Behaviour of Real Devices
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Dynamic Graph Partitioning Algorithm
A Framework for Object-Based Event Composition in Distributed Systems
Software Design and Architecture
Algorithms for Big Data Delivery over the Internet of Things
User Interference Effect on Routing of Cognitive Radio Ad-Hoc Networks
Proactive Management with Real Time Forecasting and Dynamic Simulation
Consistency in Distributed Systems
Mobile edge computing Report by Weiqing huang.
Cross-Layer Optimization for State Update in Mobile Gaming
Kostas M. Andreadis1, Dennis P. Lettenmaier1
A Case for Mutual Notification
WLAN-3G Interworking for Future High Data Rate Networks
CS 584.
by Xiang Mao and Qin Chen
Incorporating Constraint Checking Costs in Constraint Satisfaction Problem Suryakant Sansare.
Debt Relief Measures to deal with over-indebtedness
Power Efficiency Analysis
ICT TOOLS AND USAGE PRESENTED BY: FARIDATUNNISA.
Synchronizers Outline motivation principles and definitions
Brahim Ayari, Abdelmajid Khelil and Neeraj Suri
Presentation transcript:

Presentation – NetGames 2008 Performance Analysis of Game world Partitioning Methods for Multiplayer Mobile Gaming Kusno Prasetya Bond University

Structure Introduction Interest Management and Game world partitions Proposed solution Simulations and result Conclusions

Introduction (1) Feasibility of multiplayer mobile gaming Obstacles in implementation Resource vs battery Heterogenous resource level availability Problems in wireless network Different type of game Player behaviour

Introduction (2) Possible solutions from networking point of view: Waiting for required wireless network technologies and their applications to be available Reduce the level of network resource usage Reduce the impact of network delay Increase the tolerance to delays and temporary disconnections Keep the complexity low!!!

Interest Management Filter/choose the receiver of certain data (in game terms: state update) The filter is based on a set of rules Balance between complexity and efficiency Examples: Player distance (based on AOI) Publisher/subscriber

Game World Partitions One of Interest Management (IM) methods Principle: Send data only to other players in the same cell or section Variations: Uniform and Variable Geometric shapes Random shapes (based on game map design)

Mechanism Divide game world into sections Player's Area Of Interest Cell migration and pre-migration Number of neighbouring cells

Solution for Game world Partition Brickworks pattern + Internal Partition (BIP)

Why Brickworks? Low complexity for border and location checking Fewer number of possible neighbours → Less cell to communicate with, less information to store (relative to number of players)

Why Internal Partitions? Consecutive/repetitive cell migration and pre- migration

Simulation mechanism Simulation consists of: Scenario Generator Game world and player Simulator

Simulation result

Simulation Result - Summary Player speed has the biggest influence in cell migration and pre-migration followed with cell shape and cell size In average, Rectangle partition is the most efficient in terms of having lower value of cell migration and pre-migration BIP consume less network resource usage overall because of its internal partition No consistent result with consecutive migration and pre-migration events (current average is 7- 10% of total migration/pre-migration rate)

Conclusion Different type of games will have different network resource usage specifically because of player speed, cell size and cell shape Potential to save/reduce network resource usage in BIP is related to consecutive cell migration and pre-migration Game world size has no real impact in final result

Future and ongoing research Comprehensive framework for multiplayer mobile game simulation Variable internal partition to solve crowding problems Multi-level AOI to reduce the impact of consecutive player pre-migration and migration

Thank you ☺