Provisioning on-line games: a traffic analysis of a busy counter-strike server

  • Authors:

  • Francis Chang;Wu-chang Feng;Wu-chi Feng;Jonathan Walpole

  • Affiliations:

  • OGI School of Science and Engineering at OHSU;OGI School of Science and Engineering at OHSU;OGI School of Science and Engineering at OHSU;OGI School of Science and Engineering at OHSU

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This poster describes the results of a 500 million packet trace of a popular on-line, multiplayer, game server. The results show that the traffic behavior of this heavily loaded game server is highly predictable and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link (i.e. 56k modems). Specifically, in order to maximize the interactivity of the game itself and to provide relatively uniform experiences between players playing over different network speeds, on-line games typically fix their usage requirements in such a way as to saturate the network link of their lowest speed players. While the traffic observed is highly predictable, the trace also indicates that these on-line games provide significant challenges to current network infrastructure. As a result of synchronous game logic requiring an extreme amount of interactivity, a close look at the trace reveals the presence of large, highly periodic, bursts of small packets. With such stringent demands on interactivity, routers must be designed with enough capacity to quickly route such bursts without delay. As current routers are designed for bulk data transfers with larger packets, a significant, concentrated deployment of on-line game servers will have the potential for overwhelming current networking equipment.