Locality Aware Dynamic Load Management for Massively Multiplayer Games Jin Chen, Baohua Wu, Margaret Delap, Bjorn Knutsson, Margaret Delap, Bjorn Knutsson,

Slides:

Advertisements

Similar presentations

Scheduling in Distributed Systems Gurmeet Singh CS 599 Lecture.

Advertisements

Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.

Universe, By Morten Zohnesen & Per Lohmann Poulsen A dynamic multi-server architecture for massively multiplayer games.

Towards Autonomic Adaptive Scaling of General Purpose Virtual Worlds Deploying a large-scale OpenSim grid using OpenStack cloud infrastructure and Chef.

Locality Aware Dynamic Load Management for Massively Multiplayer Games Written by Jin Chen 1, Baohua Wu 2, Margaret Delap 2, Bjorn Knutsson 2, Honghui.

Locality Aware Dynamic Load Management for Massively Multiplayer Games Jin Chen, Baohua Wu, Margaret Delap, Bjorn Knutson, Honghui Lu and Cristina Amza.

Peer-to-Peer Support for Massively Multiplayer Games Bjorn Knutsson, Honghui Lu, Wei Xu, Bryan Hopkins Presented by Mohammed Alam (Shahed)

CISC October Goals for today: Foster’s parallel algorithm design –Partitioning –Task dependency graph Granularity Concurrency Collective communication.

1 One Torus to Rule Them All: Multi-dimensional Queries in P2P Systems Prasanna Ganesan Beverly Yang Hector Garcia-Molina Stanford University.

ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,

Key-Key-Value Stores for Efficiently Processing Graph Data in the Cloud Alexander G. Connor Panos K. Chrysanthis Alexandros Labrinidis Advanced Data Management.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.

An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.

1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.

Reliable and Smooth Fine Granular Scalable Video Streaming Zhibo Chen Yun He 2002 IEEE Region 10 Conference on Computer, Communications, Control and Power.

Strategies for Implementing Dynamic Load Sharing.

Wide Web Load Balancing Algorithm Design Yingfang Zhang.

Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He

Interference Minimization and Uplink Relaying For a 3G/WLAN Network Ju Wang Virginia Commonwealth University May, 2005.

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.

1 Efficient Management of Data Center Resources for Massively Multiplayer Online Games V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, T. Fahringer,

Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems Artur Andrzejak, Sven Graupner,Vadim Kotov, Holger Trinks.

Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.

© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 5: Adjust and Troubleshoot Single- Area OSPF Scaling Networks.

Module 12: Designing High Availability in Windows Server ® 2008.

Multi-dimensional Queries in P2P Systems. Applications Photo-sharing (photographs tagged with metadata) Multi-player online games (locate objects and.

Cristiana Amza University of Toronto. Once Upon a Time … … locks were painful for dynamic and complex applications …. e.g., Massively Multiplayer Games.

Load Balancing in Structured P2P System Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, Ion Stoica IPTPS ’03 Kyungmin Cho 2003/05/20.

Peer-to-Peer Support for Massively Multiplayer Games Zone Federation of Game Servers : a Peer-to-Peer Approach to Scalable Multi-player Online Games [INFOCOM.

Network Aware Resource Allocation in Distributed Clouds.

The Little Engines(s) That Could: Scaling Online Social Networks Josep M. Pujol, Vijay Erramilli, Georgos Siganos, Xiaoyuan Yang Nikos Laoutaris, Parminder.

Peer-to-Peer AOI Voice Chatting for Massively Multiplayer Online Games (P2P-NVE 2007 workshop) Jehn-Ruey Jiang and Hung-Shiang Chen Adaptive Computing.

Chapter 3 Parallel Algorithm Design. Outline Task/channel model Task/channel model Algorithm design methodology Algorithm design methodology Case studies.

A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.

PIMA-motivation PIMA: Partition Improvement using Mesh Adjacencies  Parallel simulation requires that the mesh be distributed with equal work-load and.

Peer-to-Peer AOI Voice Chatting for Massively Multiplayer Online Games (P2P-NVE 2007 workshop) Jehn-Ruey Jiang and Hung-Shiang Chen Presenter: Shun-Yun.

THE LITTLE ENGINE(S) THAT COULD: SCALING ONLINE SOCIAL NETWORKS B 圖資三謝宗昊.

Dynamic Load Balancing in Charm++ Abhinav S Bhatele Parallel Programming Lab, UIUC.

Clustering Moving Objects in Spatial Networks Jidong Chen, Caifeng Lai, Xiaofeng Meng, Renmin University of China Jianliang Xu, and Haibo Hu Hong Kong.

1 MMORPG Servers. 2 MMORPGs Features Avatar Avatar Levels Levels RPG Elements RPG Elements Mission Mission Chatting Chatting Society & Community Society.

CS 347Notes101 CS 347 Parallel and Distributed Data Processing Distributed Information Retrieval Hector Garcia-Molina Zoltan Gyongyi.

Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.

Lecture 4 TTH 03:30AM-04:45PM Dr. Jianjun Hu CSCE569 Parallel Computing University of South Carolina Department of.

Copyright © 2011, Uniform and Non-Uniform Zoning for Load Balancing in Virtual Environments Ahmed, D.T.; Shirmohammadi, S. Embedded and Multimedia.

1 Peer-to-Peer Networked Virtual Environments Shun-Yun Hu ( 胡舜元 ) CSIE, National Central University, Taiwan 2007/10/18.

QoS Supported Clustered Query Processing in Large Collaboration of Heterogeneous Sensor Networks Debraj De and Lifeng Sang Ohio State University Workshop.

Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.

Partitioning using Mesh Adjacencies  Graph-based dynamic balancing Parallel construction and balancing of standard partition graph with small cuts takes.

A Grid-enabled Multi-server Network Game Architecture Tianqi Wang, Cho-Li Wang, Francis C.M.Lau Department of Computer Science and Information Systems.

An Adaptive Load Balancing Management for Distributed Virtual Environment Systems Yuanxing Yao 1, Tae-Hyung Kim 1, 1 Department of Computer Science and.

Data Structures and Algorithms in Parallel Computing Lecture 7.

Static Process Scheduling

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

Network Architecture Research in SPYCE CIP/URI Project Jonathan M. Smith University of Pennsylvania 3/31/03.

Load Balancing : The Goal Given a collection of tasks comprising a computation and a set of computers on which these tasks may be executed, find the mapping.

Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.

Www3.informatik.uni-wuerzburg.de Institute of Computer Science Chair of Communication Networks Prof. Dr.-Ing. P. Tran-Gia Simulation Framework for Live.

National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.

Chen Qian, Xin Li University of Kentucky

Optimizing Distributed Actor Systems for Dynamic Interactive Services

Hydra: Leveraging Functional Slicing for Efficient Distributed SDN Controllers Yiyang Chang, Ashkan Rezaei, Balajee Vamanan, Jahangir Hasan, Sanjay Rao.

Scalable Load-Distance Balancing

Parallel Programming By J. H. Wang May 2, 2017.

An Adaptive Load Balancing Management for

Parallel Programming in C with MPI and OpenMP

Latent Space Model for Road Networks to Predict Time-Varying Traffic

A Case for Mutual Notification

Parallel Programming in C with MPI and OpenMP

QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.

Presentation transcript:

Locality Aware Dynamic Load Management for Massively Multiplayer Games Jin Chen, Baohua Wu, Margaret Delap, Bjorn Knutsson, Margaret Delap, Bjorn Knutsson, Honghui Lu, Cristiana Amza University of Toronto & University of Pennsylvania

Massively Multiplayer Online Games (MMOGs) A large number of players (e.g., 100K) SLA: Update interval to players (e.g., 1 sec) Game hosted on distributed servers

State-of-art game world partitioning Ad hoc partitions Countries, rooms

The scalability problem Flocking Players move to one area or hotspot Overload the server hosting the hotspot Static partitioning is impractical! Static partitioning is impractical!

Current solution Admission control Gateways E.g., airports, doors

Our solution: Contiguous world Seamless partition Players can “see” across server boundaries Players can smoothly transfer Inter server communication Boundary information Player handoff

Dynamic load management Regions Granularity for load management Region remapping Migrate regions from one server to another

Locality aware load management Keep adjacent regions on same server Less locality, higher inter-server communication Global reshuffle Block partition

Roadmap The algorithm ImplementationResults

Goals of a locality aware load management algorithm Balancing the server load in terms of the numbers of players Minimizing inter-server communication Goals conflict ! Desirable: Low number of region remappings Avoid thrashing

Our algorithm Load shedding algorithm Goal: Balance load & maintain locality Triggered by upper limit of load Locality aware aggregation algorithm Goal: Correct locality disruption Triggered by high inter-server communication in normal load

Load shedding algorithm Triggered by load >= upper limit Target: safe load First priority: Load shedding to neighbor servers Balance load & preserve locality If neighbors are also overloaded, load shedding to lightly loaded servers

Load shedding Quest!

Load shedding under quest

Load shedding to neighbors

Load shedding to lightly loaded servers Added more inter-server communication!

Locality aware aggregation Triggered by SLA violations & load is normal Aggregation Merge boundary regions into neighbor partitions

Locality aware aggregation (1)

Locality aware aggregation (2)

Graph model Local load graph for each server The partition of game map on a server A vertex  a region Vertex weight  load An edge  adjacent relationship of two regions

A game map hosted by a server

A local load graph

Heuristic graph partitioning Goal Preserve locality & meet weight constraints

Locality metric: Number of connected components

Experiment methodology Single server experiments with Simmud A MMOG game server from UPenn Bottleneck is bandwidth Determine algorithm parameters Collect traces Simulate a large scale game

Simulation setting 100 servers and 400 regions 6000 independent players Traces collected from SimMud A LAN cluster server system 100 Mbps inter-server bandwidth 100 Mbps server-players bandwidth A WAN distributed server system 100 Mbps shared network bandwidth towards both its players and neighbor servers SLA: 2 seconds

Algorithms used for comparison Static partitioning Block partitioning Spread Global reshuffle Lightest Shed load to a lightly loaded server Locality

A LAN cluster server system Quest lasts during sec

A WAN distributed server system Quest lasts during sec

A WAN distributed server system MetricLocalityLightestSpread # of Region Remap # of Connected Components

Conclusion Presented a load management algorithm Supports seamless game world partitioning Uses a locality aware algorithm Achieves better performance (SLA) Up to a factor of 8 compared to Static Up to a factor of 6 compared to global reshuffle

Thanks!