Applicability of group communication for increased scalability in MMOGs

Proceedings of 5th ACM SIGCOMM Workshop on Network and System Support for Games, NetGames '06

Volumn , Issue , 2006, Pages

  Vik, Knut Helge ^a   Griwodz, Carsten ^a   Halvorsen, Pål ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH LIMITATION; CENTRAL SERVERS; CLIENT-SERVER SYSTEMS; COMPUTING POWER; CONCEPT OF TIME; DIRECT COMMUNICATIONS; DISTRIBUTED INTERACTIVE APPLICATIONS; DRIVING FACTORS; GROUP COMMUNICATIONS; GROUP MEMBERS; GROUP MEMBERSHIPS; LOW LATENCY; MASSIVE MULTIPLAYER ONLINE GAMES; MULTI-PARTY COMMUNICATION; OVERLAY MULTICAST; PERCEIVED QUALITY; RESOURCE CONSUMPTION; SCALABILITY PROBLEMS; SHORTEST PATH TREE; SPANNING TREE; STEINER-TREE HEURISTICS; VIRTUAL WORLDS;

DISTRIBUTED COMPUTER SYSTEMS; GROUP DELAY; MULTICASTING; SCALABILITY; VIRTUAL REALITY; WIRELESS SENSOR NETWORKS;

COMMUNICATION;

EID: 77953106229     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1230040.1230065     Document Type: Conference Paper

References (38)

1. S. Banerjee and B. Bhattacharjee. Analysis of the NICE application layer multicast protocol. Technical Report UMIACSTR 2002-60 and CS-TR 4380, Department of Computer Science, University of Maryland, College Park, June 2002.
2. D. Bauer, S. Rooney, and P. Scotton. Network infrastructure for massively distributed games. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 36-43, Braunschweig, Germany, Apr. 2002.
3. P. Bettner and M. Terrano. 1500 archers on a 28.8: Network programming in Age of Empires and beyond. In Game Developers Conference, San Jose, CA, USA, 2001.
4. M. S. Borella. Source models of network game traffic. Elsevier Computer Communications, 23(4):403-410, Feb. 2000.
5. M. Busse, B. Lamparter, M. Mauve, and W. Effelsberg. Lightweight QoS-support for networked mobile gaming. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 85-92, Portland, OR, USA, 2004.
6. C. Chambers, Wu-chang Feng, S. Sahu, and D. Saha. Measurement-based characterization of a collection of on-line games. In Proceedings of the USENIX Internet Measurement Conference (IMC), pages 1-14, Berkeley, CA, USA, 2005.
7. K.-T. Chen, P. Huang, C.-Y. Huang, and C.-L. Lei. Games traffic analysis: An MMORPG perspective. In Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), pages 19-24, Stevenson, WA, USA, 2005. ACM Press.
8. M. Claypool. The effect of latency on user performance in real-time strategy games. Elsevier Computer Networks, 49(1):52-70, Sept. 2005.
9. M. P. de Aragão and R. F. F. Werneck. On the implementation of MST-based heuristics for the Steiner problem in graphs. In ALENEX, pages 1-15, 2002.
10. G. Feng, Tak-Shing, and P. Yum. Efficient multicast routing with delay constraints. Int. J. Commun. Sys., 12:181-195, January 1999.
11. W.-c. Feng, F. Chang, W.-c. Feng, and J. Walpole. Provisioning on-line games: a traffic analysis of a busy Counter-strike server. In Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurement, pages 151-156, Marseille, France, 2002.
12. G. Fox and S. Pallickara. The Narada event brokering system: Overview and extensions. In PDPTA '02: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pages 353-359. CSREA Press, 2002.
13. P. Francis, S. Ratnasamy, R. Govindan, and C. Alaettinoglu. Yoid project.
14. Funcom. Anarchy online. http://www.anarchy-online.com/, Feb. 2006.
15. M. Goodrich and R. Tamassia. Algorithm Design: Foundations, Analysis and Internet Examples. John Wiley and Sons, 2002.
16. C. Griwodz and P. Halvorsen. The fun of using TCP for an MMORPG. In Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), Newport, RI, USA, May 2006. ACM Press.
17. O. Heckmann, M. Piringer, J. Schmitt, and R. Steinmetz. On realistic network topologies for simulation. In International workshop on models, methods and tools for reproducible network research, pages 28-32, Karlsruhe, Germany, 2003.
18. S.-Y. Hu and G.-M. Liao. Scalable peer-to-peer networked virtual environment. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 129-133, Portland, OR, USA.
19. F. Hwang, D. Richards, and P. Winter. The Steiner tree problem. Elsevier Annals of Discrete Mathematics, 53:203-282, 1992.
20. T. Iimura, H. Hazeyama, and Y. Kadobayashi. Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 116-120, Portland, OR, USA, 2004.
21. C. Jin, Q. Chen, and S. Jamin. Inet: Internet topology generator. Technical Report CSE-TR-433-500, Dept. of EECS, University of Michigan, Ann Arbor, Sept. 2000.
22. L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Inf., 15:141-145, 1981.
23. L. S. Liu and R. Zimmermann. Immersive peer-to-peer audio streaming platform for massive online games. In Proceedings of the IEEE International Workshop on Networking Issues in Multimedia Entertainment (NIME), Las Vegas, NV, USA, 2006.
24. M. Mauve, S. Fischer, and J. Widmer. A generic proxy system for networked computer games. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 25-28, Braunschweig, Germany, Apr. 2002.
25. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: Universal topology generation from a user's perspective. Technical Report 2001-003, 1 2001.
26. L. Pantel and L. Wolf. On the impact of delay on real-time multiplayer games. In Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), pages 23-29, Miami Beach, FL, USA, 2002.
27. D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. ALMI: An application level multicast infrastructure. In Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems (USITS), pages 49-60, 2001.
28. V. Rayward-Smith and A. Clare. The computation of nearly minimal Steiner trees in graphs. International Journal of Mathematical Education in Science and Technology, 14(1):8pp, 1983.
29. N. Sheldon, E. Girard, S. Borg, M. Claypool, and E. Agu. The effect of latency on user performance in Warcraft III. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 3-14, Redwood City, CA, USA, 2003.
30. S. Shi and J. Turner. Routing in overlay multicast networks. In Proceedings of the Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), New York, NY, USA, 2002.
31. S. Y. Shi, J. Turner, and M. Waldvogel. Dimensioning server access bandwidth and multicast routing in overlay networks. In Prceedings of NOSSDAV 2001, pages 83-92, June 2001.
32. J. G. Siek, L.-Q. Lee, and A. Lumsdaine. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, 2002.
33. H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica 24, 24(6):573-577.
34. K.-H. Vik. Game state and event distribution using proxy technology and application layer multicast. In Proceedings of the ACM International Multimedia Conference (ACM MM), pages 1041-1042, Singapore, 2005. ACM Press.
35. J. Vogel, J.Widmer, D. Farin, M. Mauve, and W. Effelsberg. Priority-based distribution trees for application-level multicast. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 148-157, Redwood City, CA, USA, 2003.
36. B. M. Waxman. Routing of Multipoint Connections. IEEE Journal of Selected Areas in Communications, 6, December 1988.
37. S. Yamamoto, Y. Murata, K. Yasumoto, and M. Ito. A distributed event delivery method with load balancing for mmorpg. In Proceedings of the Workshop on Network and System Support for Games (NETGAMES), pages 1-8, Hawthorne, NY, USA, 2005.
38. A. Young, C. Jiang, M. Zheng, A. Krishnamurthy, L. Peterson, and R. Wang. Overlay mesh construction using interleaved spanning trees, 2004.