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

More documents

Recommendations

Info

AIprintf("Init AI...\n");ctx ->ai->init(ctx ->game , ctx ->timer , ctx ->eventMgr);// init doneprintf("Game running.\n");}} else {printf("Connect failed!\n");delete ctx ->ai;delete ctx ->networkEngine;delete ctx ->eventMgr;delete ctx ->timer;delete ctx ->game;delete ctx ->device;delete ctx;}// node start function , called from SML simulator codevoid startNode(const char* peerAddr , const char* gatewayAddr) {printf("Starting node (connect to \"%s\").\n", peerAddr);static bool first = true;// create context objectMainContext* ctx = new MainContext();// create objectsprintf("Setting up...\n");ctx ->eventMgr = new EventManager();ctx ->device = new IrrlichtDev(ctx ->eventMgr , first);ctx ->game = new ImplGameInstance ();ctx ->timer = new BSTimer();ctx ->networkEngine = new P2NetworkEngine (8585, peerAddr , gatewayAddr);ctx ->ai = new SimpleAI();// connect to networkprintf("Connecting to the network ...\n");ctx ->networkEngine ->init(ctx ->timer , ctx ->eventMgr , ctx ->game);ctx ->networkEngine ->configureUser(ctx ->device ->getDevice ());ctx ->networkEngine ->connectAsync(connectCallback , ctx);}first = false;88 A.1 Simulation: Game Main Code
A.2 Simulation: Game Connector CodeListing A.2: simulator.sml(* fake transport_open and transport_close for C++ bindings *)fun nothing () = ()val () = _export "transport_open" : (unit -> unit) -> unit; nothingval () = _export "transport_close" : (unit -> unit) -> unit; nothing(* call C++ node start code *)fun start (peer : string , gateway : string option) =letval startNode = _import "startNode" : string * string -> unit;val () = Log.log(Log.INFO , "starting node " ^ peer)instartNode (peer , Option.getOpt (gateway , ""))end(* create nodes *)val () = GlobalLog.print ("Creating nodes.\n")fun makeNode partner node =SimulatorNode.setCurrent (node , fn () => start (partner , NONE))val bootstrapNode = Vector.sub (nodes , 0)val bootstrapAddr = Word32.toString (valOf(MasterConnectionProperties.staticAddress(SimulatorNode.connection bootstrapNode )))val () = GlobalLog.print ("Preparing nodes.\n")val () = Vector.app (fn x => ignore (Simulator.RawEvent.schedule(Time.zero , fn _ => makeNode bootstrapAddr x))) nodes(* stop event *)fun stopSim _ =( GlobalLog.print "Stopping Simulator.\n"; OS.Process.exit OS.Process.success)val _ = Simulator.RawEvent.schedule (Time.fromSeconds 300, stopSim)(* run *)val () = GlobalLog.print "Running simulator.\n"val () = Simulator.run ()A Source Code Extracts 89
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 76 and 77: 700006000050000Traffic (bytes/s)400
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 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?