Implementation of a Peer-to-Peer Multiplayer Game with ... - DVS

More documents

Recommendations

Info

700006000050000Traffic (bytes/s)4000030000DownUp200001000000 10 20 30 40 50 60 70 80Time (s)Figure 5.3: Traffic of one client with new clients joining every 2 seconds, up to a total of 32 clients at 64seconds25000002000000Traffic (bytes/s)15000001000000DownUp50000000 10 20 30 40 50 60 70 80Time (s)Figure 5.4: Server traffic with new clients joining every 2 seconds, up to a total of 32 clients at 64 seconds74 5.1 Networking Measurements
Table 5.2: Peer traffic depending on the total number of players# Players Total (B/s) Up (B/s) Down (B/s)2 2,841 1,422 1,4203 6,260 3,131 3,1294 10,434 5,286 5,1486 19,302 9,621 9,6828 28,295 14,121 14,17412 48,109 23,996 24,11316 70,471 35,977 34,49424 123,948 61,805 62,14332 191,991 95,888 96,10348 353,216 176,762 176,45464 554,774 277,124 277,650600,000500,000400,000Traffic (bytes/s)300,000200,000TotalDownUp100,00000 10 20 30 40 50 60 70# PlayersFigure 5.5: Peer traffic depending on the total number of players5 Evaluation 75
Page 1 and 2:
Implementation of aPeer-to-Peer Mul
Page 3:
AbstractMassively multiplayer onlin
Page 7 and 8:
Contents1 Introduction 71.1 Planet
Page 9 and 10:
1 IntroductionIn the recent years,
Page 11 and 12:
Figure 1.2: Screenshot of the origi
Page 13:
Avatar is the virtual representatio
Page 16 and 17:
scenarios with millions of users, t
Page 18 and 19:
ArchitectureCensus operates in epoc
Page 20 and 21:
administrative data. For short gami
Page 22 and 23:
2.3.2 HydraHydra [5] is a peer-to-p
Page 24 and 25:
DHT’s key space. A comparison of
Page 26 and 27: the sender). Interest sets limit th
Page 28 and 29: EvaluationVON is evaluated in a sim
Page 30 and 31: 2.4.1 Low-Latency Information Disse
Page 32 and 33: 2.4.3 Object Synchronization and Ga
Page 34 and 35: API IntroductionThis section briefl
Page 36 and 37: The EndPoint class provides two mai
Page 39 and 40: 3 ConceptThis work’s implementati
Page 41 and 42: A solution could be using a mix of
Page 43 and 44: closing connections immediately is
Page 45: game instance. startNode() takes a
Page 48 and 49: Figure 4.1: Game Component Dependen
Page 50 and 51: Figure 4.2: In-game status message
Page 52 and 53: lock other tasks, resulting in a fa
Page 54 and 55: AvatarAn abstract representation of
Page 56 and 57: Figure 4.4: The network engine’s
Page 58 and 59: Figure 4.6: AI motion prediction wi
Page 60 and 61: MessageTable 4.1: Message types use
Page 62 and 63: Table 4.2: Message types used by th
Page 64 and 65: }// init gamegame ->init(device , t
Page 66 and 67: Irrlicht for Linux requires a few a
Page 68 and 69: ExamplesRunning the program without
Page 70 and 71: 4.6.2 Implementation ConcernsUnlike
Page 72 and 73: eset callback may be called synchro
Page 74 and 75: Table 5.1: Client-server traffic de
Page 78 and 79: 1000000900000800000700000Traffic (b
Page 80 and 81: Table 5.3: Computation time and mem
Page 82 and 83: Table 5.4: Computation time and mem
Page 85 and 86: 6 ConclusionThe core task of this w
Page 87: New game features and improvements
Page 90 and 91: AIprintf("Init AI...\n");ctx ->ai->
Page 93 and 94: Bibliography[1] E. J. Berglund and
Page 95: [32] Ion Stoica, Robert Morris, Dav
show all

Implementation of a Peer-to-Peer Multiplayer Game with ... - DVS

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?