The contents of this legacy page are no longer maintained nor supported, and are made available only for historical purposes.

Bibliography Details

Chang~Feng W., Chang F., Chi~Feng W., and Walpole J., "A Traffic Characterization of Popular on-line Games", in IEEE/ACM Transactions on Networking 2005, Oct 2005.

A Traffic Characterization of Popular on-line Games
Authors: Chang Feng W.
Chang F.
Chi Feng W.
Walpole J.
Published: IEEE/ACM Transactions on Networking, 2005
Entry Dates: 2009-02-09
Abstract: This paper describes the results of the first comprehensive analysis of a range of popular on-line, multi-player, game servers. The results show that the traffic behavior of these servers is highly predictable and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link. 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 traces also indicate 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.
  • datasets:from the Counter-Strike server of one of the most popular on-line gaming communities in the Northwest; record the traffic to and rom the server over the course of a week(April 11-18, 2002); The trace collected consisted of a half billion packets;