Conference Paper

An empirical evaluation of TCP performance in online games.

DOI: 10.1145/1178823.1178830 Conference: Proceedings of the International Conference on Advances in Computer Entertainment Technology, ACE 2006, Hollywood, California, USA, June 14-16, 2006
Source: DBLP

ABSTRACT A fundamental design question to ask in the development of a network game is—Which transport protocol should be used—TCP, UDP, or some other protocols? Seeking an ob- jective answer to the choice of communication protocol for MMORPGs, we assess whether TCP, a popular choice, is suitable for MMORPGs based on empirical evidence. To the best of our knowledge, this work is the first evaluation of transport protocol performance using real-life game traces. We analyze a 1, 356-million-packet trace from ShenZhou Online, a TCP-based, commercial, mid-sized MMORPG. Our analysis indicates that TCP is unwieldy and inappropri- ate for MMORPGs. This is due to four distinctive charac- teristics of MMORPG traffic: 1) tiny packets, 2) low packet rate, 3) application-limited traffic generation, and 4) bi- directional traffic. We show that because TCP was origi- nally designed for unidirectional and network-limited bulk data transfers, it cannot adapt well to MMORPG traffic. In particular, the window-based congestion control and the fast retransmit algorithm for loss recovery are ineffective. Fur- thermore, TCP is overkill, as not every game packet needs to be transmitted in a reliably and orderly manner. We also show that the degraded network performance did impact users' willingness to continue a game. Finally, we discuss guidelines in designing transport protocols for online games.

0 Bookmarks
 · 
81 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Improving latency is the key to a successful online game-playing experience. With the use of multiple servers along with a well-provisioned network it is possible to reduce the latency. Given a network of servers, game clients, and a desired delay bound, we have designed algorithms to determine the subnetwork of servers whose cardinality is minimal. We have considered the cases wherein the subnetwork architecture is a client-server and a peer-to-peer. We have also provided exhaustive empirical evaluations of our algorithms and compared their performance with the optimum. Experimental results show that our polynomial-time algorithms could find good solutions quickly.
    GLOBECOM Workshops (GC Wkshps), 2010 IEEE; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent advances in multimedia software and hardware technologies and the availability of high-speed Internet service have been instrumental for growth in the online gaming industry. Multiple servers distributed across the network are commonly used to provide the desired quality-of-service (QoS) for the network game in order to achieve a higher quality-of-experience (QoE) to the players (clients). Each player in this distributed multi-player gaming environment connects to a particular server and it distributes each of the actions to all other players through the servers they are connected to. We imagine the server network to be an overlay network, wherein the latency on a link between two servers is the latency of the Internet path connecting them. We assume that we are given an overlay network of servers with link latencies and a set of players each with a different latency to each of the servers. Now our goal is to develop algorithms that perform the following actions in such a way that delay related QoS constraints are satisfied: (a) choose a subnetwork of the server network (server network selection) and (b) assign each player to a server in the subnetwork (client-assignment). More specifically, the QoS constraints that we address in this paper are a bound on the maximum delay in propagating a player's move to all other players (delay bound) and a bound on the maximum difference in the arrival times of a player's move at all other players (delay-variation bound). We have provided polynomial-time heuristics to determine a minimal cardinality server network and the corresponding client-assignment that satisfy both delay bound and that minimize delay-variation, if such a solution exists. We have considered cases in which the server network follows two communication models: client-server (CS) and peer-to-peer (P2P). Our extensive empirical studies indicate that our heuristic uses significantly less run-time in achieving the tightest delay variation for a given end-- - to-end delay bound while choosing a minimal number of servers.
    Communication Systems and Networks (COMSNETS), 2011 Third International Conference on; 02/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Applications on the smartphones are able to capitalize on the increasingly advanced hardware to provide a user experience reasonably impressive. However, the advancement of these applications are hindered battery lifetime of the smartphones. The battery technologies have a relatively low growth rate. Applications like mobile multiplayer games are especially power hungry as they maximize the use of the network, display and CPU resources. The PGTP, presented in this paper is aware of both the transport requirement of these multiplayer mobile games and the limitation posed by battery resource. PGTP dynamically controls the transport based on the criticality of game state and the network state to save energy at the wireless network interface (WNIC) level with almost no degradation to the quality of the game play.
    Communications and Signal Processing (ICCSP), 2011 International Conference on; 03/2011

Full-text (2 Sources)

View
53 Downloads
Available from
Jun 5, 2014