reliving the history of multi player games
play

Reliving the history of multi player games @phuesler @rirei At - PowerPoint PPT Presentation

Jul 13, 2023 •576 likes •1.63k views

Reliving the history of multi player games @phuesler @rirei At Wooga Evolution is driven by teams Technologies Architecture Platforms User interaction Level 1: Read-only interaction High score Pacman read-only access Client Client

  1. Reliving the history of multi player games @phuesler @rirei

  6. At Wooga Evolution is driven by teams

  7. Technologies

  8. Architecture

  9. Platforms

  10. User interaction

  11. Level 1: Read-only interaction

  12. High score Pacman

  16. read-only access Client Client DB Score

  17. Level 2: Inbox interaction

  18. Turn based Empire Civilization

  20. inbox Client Client DB Inbox

  21. Inbox interaction Client Client App Inbox

  22. woo.ga/backend

  23. Level 3: Real interaction

  24. Real interaction MUD World of Warcraft

  27. Real interaction Client Client Usr Usr App Loc

  29. Handling conflicts Client Client Usr Usr Log Log App Loc

  31. woo.ga/backend

  32. Level 4: Real time interaction

  33. Real time interaction Super Mario Kart Starcraft

  34. Player 1 Player 2 Server

  35. Player 1 Player 2 Server

  36. Player 1 Player 2 Server

  37. Sources of inspiration

  38. We depend on • good throughput • low latency • low packet loss • no jitter

  39. Level 4: Real time interaction on mobile

  40. 3G Internet

  41. Bandwidth 0.73 Mbps 3G 1.2 Mbps https://de.wikipedia.org/wiki/High_Speed_Uplink_Packet_Access https://de.wikipedia.org/wiki/High_Speed_Downlink_Packet_Access

  42. Added Latency (RTT) * 3G 70 - 180 ms * HSDPA/HSUPA http://202.194.20.8/proc/VTC09Spring/DATA/09-18-19.PDF

  43. Packet loss

  44. Latency Jitter 300 225 150 75 0 RTT ms

  45. Let’s do Bomberman

  47. Real Time Interpolation Lag Compensation Lockstep Packet Loss Quality of Service TCP UDP Client Prediction Peer-To-Peer Latency Object Replication Synchronization Protocol Physics Extrapolation Match Making Collision Detection

  49. 1

  50. Architecture C1 Server C2 move :up c1 moved :up c2 placed bomb place bomb bomb exploded bomb exploded game over game over

  51. TCP JSON EASY!!!

  52. Works on Wi fi : )

  53. game doesn’t work on 3G : (

  54. Jitter

  55. Dropped packets

  56. TCP Packet Ordering and Resend

  57. TCP Flow and Congestion Control

  58. no update no update Warping no update 4 updates at once

  59. or WORSE : (

  60. 2

  61. Architecture C1 Server C2 move :up c1 moved :up c2 placed bomb place bomb bomb exploded bomb exploded game over game over

  62. 3G UDP Will it work?

  63. Poor man’s TCP User Id Local Seq No Remote Seq No Ack bit fi eld JSON P N Payload ad • http://ga ff erongames.com/networking-for-game-programmers/reliability-and- fl ow-control/

  64. Poor man’s TCP Ordering ✔ Acknowledge Packets ✔ X Resending Packets X Flow Control X Congestion Control

  65. 3G UDP ✔ Tested with a few providers in Germany, Switzerland and Netherlands

  66. game barely works on Wi fi : |

  67. game doesn’t work at all on 3G!!! : (

  68. Packet Loss

  69. No synchronization

  70. 3

  71. UDP JSON State updates

  72. Full State Full State Full State Full State Send full state

  73. MTU Ethernet 1500 bytes PPPoE 1492 bytes Edge 1440 bytes https://en.wikipedia.org/wiki/Maximum_transmission_unit http://ipixcel.org/EDGE_Capabilities,_Technology,_and_Applications_PDF.pdf

  74. Architecture C1 Server C2 move :up move :down state update state update state update state update game over game over

  75. 10 msg/second

  76. 100 ms walking speed

  77. Game works on 3G : )

  78. Highscores and Matchmaking are BROKEN! : (

  79. 4

  80. Architecture C1 Server C2 move :up move :down state update state update state update state update game over game over

  81. Different Concerns Matchmaking Highscores Game Play Login/Logout User Data Reliable Unreliable

  82. Different Concerns Matchmaking Highscores Game Play Login/Logout User Data HTTP UDP

  83. Server architecture Game Server Lobby Server UDP Service HTTP Service RPC Matchmaking Game Logic Logic User Registry User Registry Database

  84. UDP Binary

  85. Binary protocol 64 bit 32bit 32bit 8bit 8bit Rest User Id SeqNr Ack Bit fi eld Command Payload 144 bits 944 bits 18 bytes 118 bytes

  86. 2 Player State update ~ 136 bytes

  87. 1.420 KBps ✔ 10 msg/second 56K Modem 7 KBps

  88. Improved Gameplay : )

  89. 5

  90. FIFO with timers

  91. Casual Matchmaking 4 Players Match Skill Time

  92. Hierarchical Clustering

  93. Better Matchmaking = 10 =1 =1 1 1 2 10 2 2 3 10 3 3 4 10 4 4 6 10 5 5 10 6 6 10 7 7 Queueing Find Matches Reschedule Start Game

  94. Better Matchmaking : )

  95. Geo Matching

  96. Play Locally : )

  97. Debugging

  98. Terminal Client

  99. Bots

  100. Network Link Conditioner

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Introduction (1 of 2) Games are increasingly networked Multi-player, connecting PCs and

Introduction (1 of 2) Games are increasingly networked Multi-player, connecting PCs and

4/10/2017 Introduction (1 of 2) Games are increasingly networked Multi-player, connecting PCs and Game consoles (e.g., Counter-strike, Halo) Single-player, pulling and pushing content to Web Networking for Games service (e.g.,

1.2k views • 15 slides
Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Joint

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Joint

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Joint work with milie Kaufmann PhD Student Team SCEE, IETR, CentraleSuplec, Rennes & Team SequeL, CRIStAL, Inria, Lille CMAP Seminar 31 st

1.47k views • 96 slides
Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Joint

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Joint

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Joint work with milie Kaufmann PhD Student Team SCEE, IETR, CentraleSuplec, Rennes & Team SequeL, CRIStAL, Inria, Lille ALT Conference 08 -

951 views • 63 slides
Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Christophe Moy milie Kaufmann Advised by PhD Student Team SCEE, IETR, CentraleSuplec, Rennes & Team SequeL, CRIStAL, Inria, Lille SequeL

860 views • 68 slides
Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson

Multi-Player Bandits Revisited Decentralized Multi-Player Multi-Arm Bandits Lilian Besson Advised by Christophe Moy milie Kaufmann PhD Student Team SCEE, IETR, CentraleSuplec, Rennes & Team SequeL, CRIStAL, Inria, Lille SequeL

920 views • 70 slides
Globalizing Player Accounts with MySQL at Riot Games Tyler Turk Riot Games, Inc. About Me

Globalizing Player Accounts with MySQL at Riot Games Tyler Turk Riot Games, Inc. About Me

Globalizing Player Accounts with MySQL at Riot Games Tyler Turk Riot Games, Inc. About Me Senior Infrastructure Engineer Player Platform at Riot Games Father of three Similar talk at re:Invent last year 2 Accounts Team Responsible for

503 views • 34 slides
Tabletop Game Design UDLS: April 17th, 2015 Neil Newman Zero Player Games Solved Games - Tic

Tabletop Game Design UDLS: April 17th, 2015 Neil Newman Zero Player Games Solved Games - Tic

Tabletop Game Design UDLS: April 17th, 2015 Neil Newman Zero Player Games Solved Games - Tic tac toe - The same is true of more complicated games: Connect 4, Checkers Analysis Paralysis - AP describes a player that takes too long to decide

503 views • 17 slides
Extensive Form Games Extensive-form games with perfect information When moving, each player

Extensive Form Games Extensive-form games with perfect information When moving, each player

Extensive Form Games Extensive-form games with perfect information When moving, each player is aware of all previous moves 2,10 (perfect information). 3,8 A (pure) strategy for player i is a mapping from player is nodes to 2,10

238 views • 13 slides
11.4 The Informed Player Moves Second: Screening In screening games, the informed player

11.4 The Informed Player Moves Second: Screening In screening games, the informed player

11.4 The Informed Player Moves Second: Screening In screening games, the informed player moves second , which means that he moves in response to contracts offered by the uninformed player. r An offer conveys no information

399 views • 15 slides
CS440/ECE448 Lecture 8: Two-Player Games Slides by Svetlana Lazebnik 9/2016 Modified by Mark

CS440/ECE448 Lecture 8: Two-Player Games Slides by Svetlana Lazebnik 9/2016 Modified by Mark

CS440/ECE448 Lecture 8: Two-Player Games Slides by Svetlana Lazebnik 9/2016 Modified by Mark Hasegawa-Johnson 2/2019 Why study games? Games are a traditional hallmark of intelligence Games are easy to formalize Games can be a good

565 views • 38 slides
Outline CS 188: Artificial Intelligence Zero-sum deterministic two player games Spring 2011

Outline CS 188: Artificial Intelligence Zero-sum deterministic two player games Spring 2011

Outline CS 188: Artificial Intelligence Zero-sum deterministic two player games Spring 2011 Minimax Evaluation functions for non-terminal states Alpha-Beta pruning Lecture 8: Games, MDPs Stochastic games 2/14/2010 Single

247 views • 7 slides
CS 598 RM : Algorithmic game theory Lecture 1 Two-player games For any two-player game, we have

CS 598 RM : Algorithmic game theory Lecture 1 Two-player games For any two-player game, we have

CS 598 RM : Algorithmic game theory Lecture 1 Two-player games For any two-player game, we have the following basic notation. Table 1: Basic notation Player 1 ( P 1 ) Player 2 ( P 2 ) Set of actions S 1 S 2 Action i S 1 j S 2

282 views • 5 slides
Algorithms for solving two- player normal form games Recall: Nash equilibrium Let A and B be

Algorithms for solving two- player normal form games Recall: Nash equilibrium Let A and B be

Algorithms for solving two- player normal form games Recall: Nash equilibrium Let A and B be | M | x | N | matrices. Mixed strategies: Probability distributions over M and N If player 1 plays x , and player 2 plays y , the payoffs are

1.28k views • 32 slides
CMU 15-896 Noncooperative games 4: Stackelberg games Teacher: Ariel Procaccia A curious game

CMU 15-896 Noncooperative games 4: Stackelberg games Teacher: Ariel Procaccia A curious game

CMU 15-896 Noncooperative games 4: Stackelberg games Teacher: Ariel Procaccia A curious game Playing up is a dominant strategy for row player 1,1 3,0 So column player would play left Therefore, is the 0,0 2,1 only Nash

645 views • 22 slides
De Finetti reductions and parallel repetition of multi-player non-local games joint work with

De Finetti reductions and parallel repetition of multi-player non-local games joint work with

De Finetti reductions and parallel repetition of multi-player non-local games joint work with Andreas Winter Ccilia Lancien Toulouse - StoQ - September 11 th 2015 Toulouse - StoQ - September 11th 2015 Ccilia Lancien De Finetti reductions

682 views • 43 slides
ECE 4524 Artificial Intelligence and Engineering Applications Meeting 5: Two-Player Games and

ECE 4524 Artificial Intelligence and Engineering Applications Meeting 5: Two-Player Games and

ECE 4524 Artificial Intelligence and Engineering Applications Meeting 5: Two-Player Games and MiniMax Search Reading: AIAMA 5.1-5.2 Todays Schedule: Formally define games Example games Adversarial search MiniMax algorithm

838 views • 20 slides
never done jalewis@thoughtworks.com @boicy 1 never done 2 never done Incomplete adjective

never done jalewis@thoughtworks.com @boicy 1 never done 2 never done Incomplete adjective

building systems that are never done jalewis@thoughtworks.com @boicy 1 never done 2 never done Incomplete adjective not having all the necessary or appropriate parts 3 never done Incomplete adjective not having all the necessary or

2.35k views • 153 slides
Fourth Quarter 2012 Results February 7, 2013 Safe Harbor Disclosure Please review our SEC

Fourth Quarter 2012 Results February 7, 2013 Safe Harbor Disclosure Please review our SEC

Fourth Quarter 2012 Results February 7, 2013 Safe Harbor Disclosure Please review our SEC filings on Form 10-K and Form 10-Q The statements contained in this presentation that are not historical facts are forward-looking statements. The company

389 views • 16 slides
RECONCILIATION TO IFRS 2008 REVENUE & EBITA ACTIVISION BLIZZARD February 18, 2009

RECONCILIATION TO IFRS 2008 REVENUE & EBITA ACTIVISION BLIZZARD February 18, 2009

RECONCILIATION TO IFRS 2008 REVENUE & EBITA ACTIVISION BLIZZARD February 18, 2009 Activision Blizzard Reconciliation to IFRS IFRS US non-GAAP comparable basis Net revenues: $5bn Net Revenues: 2.1bn Operating income: $1.2bn EBITA:

443 views • 7 slides
Game Design Pa,erns CS 4730 Computer Game Design

Game Design Pa,erns CS 4730 Computer Game Design

Game Design Pa,erns CS 4730 Computer Game Design Credit: Some slide material courtesy Walker White (Cornell) CS 4730 Architecture Big Picture

443 views • 23 slides
H1 FY15 Earnings presentation October 30th, 2014 Yves Guillemot, President and Chief Executive

H1 FY15 Earnings presentation October 30th, 2014 Yves Guillemot, President and Chief Executive

H1 FY15 Earnings presentation October 30th, 2014 Yves Guillemot, President and Chief Executive Officer Alain Martinez, Chief Financial Officer Jean-Benot Roquette, SVP Investor Relations D I S C L A I M E R This statement may contain

693 views • 28 slides
Game and Learn: An Introduction to Educational Gaming 4. Games and Learning Ruben R. Puentedura,

Game and Learn: An Introduction to Educational Gaming 4. Games and Learning Ruben R. Puentedura,

Game and Learn: An Introduction to Educational Gaming 4. Games and Learning Ruben R. Puentedura, Ph.D Learning from Games Active Learning Gamers Learn From: 1. Doing and reflecting critically Active Learning Example: Europa Universalis III

473 views • 11 slides
A battle of bits: building confidence in cryptography D. J. Bernstein University of Illinois at

A battle of bits: building confidence in cryptography D. J. Bernstein University of Illinois at

A battle of bits: building confidence in cryptography D. J. Bernstein University of Illinois at Chicago Tanja Lange Technische Universiteit Eindhoven Negation joint work with: Peter Schwabe Academia Sinica ECC2K-130 joint work with: many,

1.63k views • 115 slides
CSE 501 Principles and Applications of Program Analysis Alvin Cheung Spring 15

CSE 501 Principles and Applications of Program Analysis Alvin Cheung Spring 15

CSE 501 Principles and Applications of Program Analysis Alvin Cheung Spring 15 Welcome to CSE 501! The Cast J K J h Q , D , , h i , e K ! h Q 0 , D 0 , , h 0 i , ( 0 , e ) force( Q 0 , D 0 , ( 0 , e ))

866 views • 34 slides

More recommend