• ETRI Journal
• /
• 제33권2호
• /
• pp.219-229
• /
• 2011

In this paper, we propose a transformation scheme used to analyze online gaming traffic properties and develop a traffic model. We analyze the packet size and the inter departure time distributions of a popular first-person shooter game (Left 4 Dead) and a massively multiplayer online role-playing game (World of Warcraft) in order to compare them to the existing scheme. Recent online gaming traffic is erratically distributed, so it is very difficult to analyze. Therefore, our research focuses on a transformation scheme to obtain new smooth patterns from a messy dataset. It extracts relatively heavy-weighted density data and then transforms them into a corresponding dataset domain to obtain a simplified graph. We compare the analytical model histogram, the chi-square statistic, and the quantile-quantile plot of the proposed scheme to an existing scheme. The results show that the proposed scheme demonstrates a good fit in all parts. The chi-square statistic of our scheme for the Left 4 Dead packet size distribution is less than one ninth of the existing one when dealing with erratic traffic.

• 산업기술연구
• /
• 제20권B호
• /
• pp.233-238
• /
• 2000

The study of game traffic has neglected by scientists, but as Internet gaming becomes more popular, multiplayer online games have become a significant element of Internet traffic. In this paper we analyze Internet traffic generated by sessions of multiplayer online games and study source models of multiplayer online game traffic. Our analysis shows that the empirical game traffic can be characterized by certain analytical model. We describe how our empirical traffic data set can be modeled and discuss how game server type influences interarrival distribution.

• 전자공학회논문지CI
• /
• 제47권6호
• /
• pp.103-112
• /
• 2010

네트워크 트래픽 분석 및 모델링은 그 중요성에 따라 많은 연구가 진행되어온 영역이다. 기존의 네트워크 트래픽 분석 및 모델링 관련 연구는 간단한 패킷 스트림을 전송하거나 HTTP와 같은 특정 어플리케이션의 트래픽 특성을 반영하는데 초점이 맞춰져 있다. 본 논문에서는 멀티미디어 데이터의 특성을 반영한 네트워크 트래픽 생성기를 제안한다. 멀티미디어 데이터의 특성을 반영하기 위해 대표적인 멀티미디어 콘텐츠인 온라인 게임의 트래픽을 분석하기 위해서 온라인 게임의 패킷 전송간 시간과 패킷 크기 확률변수들에 따른 분포를 모델링 하였으며 그 모델을 입력으로 갖는 네트워크 트래픽 생성기의 구조를 제시하였다. 제안된 네트워크 트래픽 생성기를 이용하여 L4D(Left4Dead), WoW(World of Warcraft)의 트래픽을 생성해 본 결과 실제 데이터와 유사도가 높은 분포를 갖는 것을 확인 할 수 있었다.

• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.806-817
• /
• 2016

Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.2920-2939
• /
• 2012

Enterprises that develop online games have to deploy supporting infrastructures, including hardware and bandwidth resources, in order to provide a good service to users. First Person Shooter games generate high rates of small UDP packets from the client to the server, so the overhead is significant. This work analyzes a method that saves bandwidth, by the addition of a local agent which queues packets, compresses headers and uses a tunnel to send a number of packets within a multiplexed packet. The behavior of the system has been studied, showing that significant bandwidth savings can be achieved. For certain titles, up to 38% of the bandwidth can be saved for IPv4. This percentage increases to 54% for IPv6, as this protocol has a bigger overhead. The cost of these bandwidth savings is the addition of a new delay, which has an upper bound that can be modified. So there is a tradeoff: the greater the added delays, the greater the bandwidth savings. Significant reductions in the amounts of packets per second generated can also be obtained. Tests have been deployed in an emulated scenario matching an access network, showing that if the number of players is big enough, the added delays can be acceptable in terms of user experience.