Z.D. Wu∗


  1. [1] N.E. Baughman & B.N. Levine, Cheat-proof playout for cen-tralized and distributed online games, Proc. IEEE INFOCOM,Anchorage, Alaska, 2001, 104–113.
  2. [2] J.C.S. Lui & M.F. Chan, An efficient partitioning algorithmfor distributed virtual environment systems, IEEE Trans. onParallel and Distributed Systems, 13 (1), 2002, 1–19.
  3. [3] L. Zou, M.H. Ammar, & C. Diot, An evaluation of groupingtechniques for state dissemination in networked multi-usergames, Proc. of 9th International Symposium on Modelling,Analysis, and Simulation of Computer and TelecommunicationSystem (MASCOTS), Washington D.C., USA, 1999, 33–40.
  4. [4] D. Bauer, I. Iliadis, S. Rooney, & P. Scotton, Communica-tion architectures for massive multiplayer games, Journal ofMultimedia Tools and Applications, 23, 2004, 47–66.
  5. [5] E. Rhalibi & M. Merabti, Agent-based modeling for a peer-to-peer MMOG architecture, ACM Computer in Entertainment,3 (2), 2005, Article 3B.
  6. [6] S. Rooney, D. Bauer, & R. Deydier, A Federation peer-to-peer network game architecture, Research Report, IBM ZurichResearch Laboratory, RZ 3528 (#99542), 2004.
  7. [7] B. Knutsson, H. Lu, W. Xu, & B. Hopkins, Peer-to-peer supportfor massively multiplayer games, Proc. of IEEE INFOCOM,Hong Kong, 2004, 96–107.
  8. [8] S. Fiedler, M. Wallner, & M. Weber, A Communicationarchitecture for massive multiplayer games, ACM Proc. ofNetGames, Braunschweig, 2002, 14–22.
  9. [9] J.D. Pellegrino & C. Dovrolis, Bandwidth requirement andstate consistency in three multiplayer game architectures, ACMProc. of NetGames, Redwood City, CA, 2003, 52–59.
  10. [10] T. Limura, H. Hazeyama, & Y. Kadobayashi, Zoned federationof game servers: A peer-to-peer approach to scalable multi-player online games, ACM SGCOMM’04 Workshops, Portland,Oregon, USA, 2004.
  11. [11] J. Chen, B. Wu, M. DeLap, B. Knutsson, H. Lu, &C. Amza, Locality aware dynamic load management for mas-sively multiplayer games, ACM SIGPLAN Symp. on Principlesand Practice of Parallel Programming (PPoPP), Chicago, IL,2005, 289–300.
  12. [12] B.D. Vleeschauwer, B.V.D. Bossche, T. Verdickt, F.D. Turck,B. Dhoedt, & P. Demeester, Dynamic microcell assignment formassively multiplayer online gaming, Proc. of NetGames’05,Hawthorne, New York, USA, 2005.
  13. [13] S. Ferretti & M. Roccetti, A novel obsolescence-based approachto event delivery synchronisation in multiplayer games, Inter-national Journal of Intelligent Games and Simulation, 13 (1),2004, 7–19.
  14. [14] D. Bauer, S. Rooney, & P. Scotton, Network infrastructurefor massively distributed games, Proc. of NetGames 2002Conference, Braunschweig, Germany, 2002, 3–9.
  15. [15] F.C. Wu, F. Chang, W. Feng, & J. Wapole, A traffic charac-terization of popular on-line games, IEEE/ACM Transactionson Networking, 13 (3), 2005, 488–500.
  16. [16] A. Yu & S.T. Vuong, MOPAR: a mobile peer-to-peer overlayarchitecture for interest management of massively multiplayeronline games, Proc. of the International Workshop on Networkand Operating Systems Support for Digital Audio and Video,Stevenson, Washington, USA, ACM Press, 2005, 99–104.
  17. [17] N. Ducheneaut & R.J. Moore, The social side of gaming: Astudy of interaction patterns in a massively multiplayer onlinegame, Proc. of CSCW’04, Chicago, IL, USA, ACM Press,2004, 360–369.
  18. [18] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, &H. Balakrishnan, Chord: A scalable peer-to-peer lookup ser-vice for Internet applications, Proc. of the ACM SIGCOMM’01 Conference, San Diego, CA, 2001, 149–160.
  19. [19] A. Rowstron & P. Druschel, Pastry: Scalable, distributedobject location and routing for large-scale peer-to-peer systems,Proc. of IFIP/ACM International Conference on DistributedSystems Platforms (Middleware), Heidelberg, Germany, 2001,29–350.
  20. [20] M. Castro, P. Druschel, A. Kermarrec, & A. Rowstron, Alarge-scale and decentralized application-level multicast infras-tructure, IEEE Journal on Selected Areas in Communications(JSAC), 20 (8), 2002.
  21. [21] T. Henderson, The effects of relative delays in networked games,Ph.D. thesis, Department of Computer Science, UniversityCollege London, February 2003.
  22. [22] Martin Mauve, How to keep a dead man from shooting, Proc.of the 7th International Workshop on Interactive DistributedMultimedia Systems and Telecommunication Services, October17–20, 2000, 199–204.
  23. [23] LINEAGE c Ncsoft.
  24. [24] J. Smed, T. Kaukoranta, & H. Hakonen, A review on networkingand multiplayer computer games, Technical Report No. 454,Turku Centre for Computer Science, April 2002.
  25. [25] L. Kleinrok, Queuing systems, volume 1, theory (New York:Wiley, 1975).
  26. [26] J. Medhi, Stochastic models in queuing theory, Second Edition(Academic Press, 2003).
  27. [27] S. Ratnasamy, P. Francis, M. Handley, R. Karp, & S. Shenker,A Scalable Content-Addressable Network, ACM SIGCOMM2001, August 27–31, 2001.
  28. [28] I. Stoica, R. Morris, D. Karger, F. Kaashoek, & H. Balakrish-nan, Chord: A scalable peer-to-peer lookup service for Internetapplications, ACM SIGCOMM 2001, August 27–31, 2001.
  29. [29] Z.D. Wu, Performance modelling of multicast groups for multi-player games in peer-to-peer networks, Proc. of 9th IEEE Inter-national Symposium on Distributed Simulation and Real-TimeApplications, Montreal, Canada, 2005, 105–122.

Important Links:

Go Back