On the Geographic Distribution of On- line Game Servers and Players Wu-chang FengWu-chi Feng Discussion moderated By: John Carter.

Slides:



Advertisements
Similar presentations
Ethernet Switch Features Important to EtherNet/IP
Advertisements

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Multicast Tree Reconfiguration in Distributed Interactive Applications Pål Halvorsen 1,2, Knut-Helge Vik 1 and Carsten Griwodz 1,2 1 Department of Informatics,
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
NETWORK LOAD BALANCING NLB.  Network Load Balancing (NLB) is a Clustering Technology.  Windows Based. (windows server).  To scale performance, Network.
On the Geographic Distribution of On- line Game Servers and Players Wu-chang FengWu-chi Feng Presented By: Abhishek Gupta.
Measurement and Estimation of Network QoS among Peer Xbox Game Players Youngki Lee, KAIST Sharad Agarwal, Microsoft Research Chris Butcher, Bungie Studio.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Provisioning On-line Games: A Traffic Analysis of a Busy Counter-Strike Server Wu-chang Feng, Francis Chang, Wu-chi Feng, Jonathan Walpole.
Provisioning On-line Games: A Traffic Analysis of a Busy Counter- Strike Server Wu-chang Feng, Francis Chang, Wu-chi Feng, Jonathan Walpole Instructor:
Ashish Gupta, Marcia Zangrilli, Ananth I. Sundararaj, Peter A. Dinda, Bruce B. Lowekamp EECS, Northwestern University Computer Science, College of William.
Network Traffic Measurement and Modeling CSCI 780, Fall 2005.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
1 Measurement-based Characterization of a Collection of On-line Games Chris Chambers Wu-chang Feng Portland State University Sambit Sahu Debanjan Saha.
Peer-to-peer Multimedia Streaming and Caching Service by Won J. Jeon and Klara Nahrstedt University of Illinois at Urbana-Champaign, Urbana, USA.
A Traffic Characterization of Popular On-Line Games Wu-Chang Feng, Francis Chang, Wu- Chi Feng, and Jonathan Walpole IEEE/ACM Trans. Networking, Jun
Network Analysis of Counter-strike and Starcraft Mark Claypool, David LaPoint, Josh Winslow Worcester Polytechnic Institute Worcester, MA, USA
Bandwidth DoS Attacks and Defenses Robert Morris Frans Kaashoek, Hari Balakrishnan, Students MIT LCS.
Bandwidth Measurements for VMs in Cloud Amit Gupta and Rohit Ranchal Ref. Cloud Monitoring Framework by H. Khandelwal, R. Kompella and R. Ramasubramanian.
1 Efficient Management of Data Center Resources for Massively Multiplayer Online Games V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, T. Fahringer,
1 Latency Equalization: A Programmable Routing Service Primitive Minlan Yu Joint work with Marina Thottan, Li Li at Bell Labs.
1 Measurement-based Characterization of a Collection of On-line Games Chris Chambers Wu-chang Feng Portland State University Sambit Sahu Debanjan Saha.
4/20/2017 7:57 PM.
Barracuda Load Balancer Server Availability and Scalability.
1 The SpaceWire Internet Tunnel and the Advantages It Provides For Spacecraft Integration Stuart Mills, Steve Parkes Space Technology Centre University.
System Center 2012 – ConfigMgr Design Tips SUSAN DYER, MICROSOFT SENIOR II CONSULTANT MARCH 8, 2014 DMVMUG Reston, VA
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
BGP ANYCAST Simulations Using GTNetS (work in progress) Talal Jaafar Georgia Tech & CAIDA.
1 An SLA-Oriented Capacity Planning Tool for Streaming Media Services Lucy Cherkasova, Wenting Tang, and Sharad Singhal HPLabs,USA.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Skype P2P Kedar Kulkarni 04/02/09.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
POSTECH DP&NM Lab. Internet Traffic Monitoring and Analysis: Methods and Applications (1) 2. Network Monitoring Metrics.
Module 4: Designing Routing and Switching Requirements.
Othman Othman M.M., Koji Okamura Kyushu University 1.
Scalability Don McGregor Research Associate MOVES Institute
Module 4: Planning, Optimizing, and Troubleshooting DHCP
1 Chapter 12: VPN Connectivity in Remote Access Designs Designs That Include VPN Remote Access Essential VPN Remote Access Design Concepts Data Protection.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Advanced Networking Lab. Given two IP addresses, the estimation algorithm for the path and latency between them is as follows: Step 1: Map IP addresses.
Networks CS105. What is a computer network? A computer network is a collection of computing devices that are connected in various ways so that they can.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
LAN Switching and Wireless – Chapter 1 Vilina Hutter, Instructor
Lecture 1 Page 1 CS 239, Fall 2010 Distributed Denial of Service Attacks and Defenses CS 239 Advanced Topics in Computer Security Peter Reiher September.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Multicast instant channel change in IPTV systems 1.
Load Distribution among Replicated Web Servers: A QoS-based Approach Marco Conti, Enrico Gregori, Fabio Panzieri WISP KAIST EECSD CALab Hwang.
1. Introduction REU 2006-Packet Loss Distributions of TCP using Web100 Zoriel M. Salado, Mentors: Dr. Miguel A. Labrador and Cesar D. Guerrero 2. Methodology.
KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.
6.1 © 2004 Pearson Education, Inc. Exam Designing a Microsoft ® Windows ® Server 2003 Active Directory and Network Infrastructure Lesson 6: Designing.
Patch Scheduling for On-line Games Chris Chambers Wu-chang Feng Portland State University.
ICNP 2006 Inter­domain Policy Violations in Overlay Routes Srinivasan Seetharaman, Mostafa Ammar Networking and Telecommunications Group College of Computing.
UNIT 2 LESSON 9 CS PRINCIPLES. UNIT 2 LESSON 9 OBJECTIVES Students will be able to: Explain the inefficiencies of everyone managing their own name-to-
1 Internet Traffic Measurement and Modeling Carey Williamson Department of Computer Science University of Calgary.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
Introduction to “Tap – Dance ”. Company Proprietary Presentation Topics  Introduction  Handover scenarios  Inter-Network Handover consequences  Common.
TCP/IP Utilities Richard Goldman May 29, 2003.
ETHANE: TAKING CONTROL OF THE ENTERPRISE
Planning and Troubleshooting Routing and Switching
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Memory Management for Scalable Web Data Servers
Bandwidth Measurements for VMs in Cloud
Content Distribution Networks
Measurement-based Characterization of a Collection of On-line Games
Multicasting Unicast.
Presentation transcript:

On the Geographic Distribution of On- line Game Servers and Players Wu-chang FengWu-chi Feng Discussion moderated By: John Carter

Motivation  Understanding geographic distribution of game servers and players. Q: How much can we generalize results?  Server placement strategies enhance gaming experience. FPSes require proximity to servers. Q: Is geographic proximity a good approximation for topological proximity?

Contributions  Geographic characterization of game servers for popular FPSes: Q: Where are the servers located ?  Geographic characterization of game players for one game server: Q: Where are the players?

Methodology  Q: How did the researchers measure the client and server locations? Q: How did they determine IP addresses? Q: How did they map addresses to locs?  Q: How did researchers encourage players to come to their server?

Methodology  Obtaining server addresses: Obtain server list from centralized registry server. Select server based on round trip latency from client, using ping.

Methodology (contd.)  Obtaining client addresses. Not easy! Needs access to centralized authentication and game servers. Easier to focus on the distribution of players for a particular game.  Deriving geographic locations Use commercial geographic mapping tool.

Evaluation  Longitudinal histogram for Game Servers distribution.

Evaluation (contd.)  Longitudinal CDF of game server distribution.

Evaluation (contd.)  Latitudinal CDF of game servers.

Evaluation (contd.)  Longitudinal histogram for players.

Evaluation (contd.)  Longitude CDF for players. Only 30% of the players are within 10 degree longitude and about 50% players are in North America!

Discussion  Q: What did they believe caused the distributions of clients/servers?  Q: How did the distribution change over time? Time of day? Load?  Q: What can servers/developers do to improve client choices?

Evaluation (contd.)  Reasons for utilization of game servers by geographically remote users: Disparity between geographic location and network topology. Application server delays dominate network delays. Server selection mechanisms for popular games are broken. The number of players on a server determines desirability over delay. A shortage of servers overseas.

Evaluation (contd.)  Player locations over time – Time of day phenomenon!

Evaluation (contd.)  Player locations over time.

Conclusion.  Results show that game servers are mainly distributed across the northern hemisphere in US, Europe and East Asia.  There is some geographic preference between players and servers.  The dominant factor in the geographic distribution of game players is the time- of-day.

Provisioning On-line Games: Analysis of a Busy Counter-Strike Server Francis Chang, Wu-chang Feng, Wu-chi Feng, Jonathan Walpole

Week in the Life of a C-S Server  Multiple transient clients connect to pre- existing stationary game server Internet Server Network Monitor

Discussion  Q: What were the major findings? Bandwidth patterns? Periodic? Client bandwidth? Packet sizes?  Q: Is game traffic like other traffic? How so or how not?  Q: What lessons can we learn?

Bandwidth: Nearly constant

Usage patterns  Network usage unlike traditional internet apps Bandwidth is not self-similar, aggregates well

Bandwidth analysis  Highly periodic broadcasts at msec level

Client bandwidth  Designed to saturate the “last mile” Carefully kept under 56Kbps modem limit

Packet size distributions  Primarily long bursts of small packets Driven by low latency requirements

Final observations  Bursts of small packets not a great match for way routers work Hard to quickly route large bursts  NAT routers particularly bad Drop lots of packets  Unfortunately, buffering is not the solution Added latency eliminates benefit

Discussion What lessons did we learn?

What would YOU do?  What if you were building a server infrastructure for an online game?  How would you build it?  What issues would you consider?  How would you optimize for various user scenarios?  Can we improve network proximity?  Let’s design some “on paper”…