Provisioning On-line Games: A Traffic Analysis of a Busy Counter-Strike Server. Wu-chang Feng, Francis Chang, Wu-chi Feng, Jonathan Walpole Instructor: Dr. Charles Krasic Presentation by: zhen tan. Outline. The goal of the paper About the game About the trace
Related searches for Provisioning On-line Games: A Traffic Analysis of a Busy Counter-Strike Server
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Wu-chang Feng, Francis Chang, Wu-chi Feng, Jonathan Walpole
To Understand the resource requirements of a popular on-line first person shooter game
Figure 1 (a) total bandwidth obeserved at the server
Figure 1(a)Total bandwidth
Figure 1 (b) packed load observed at the server
Figure 1 (b) packet load
The relation of H and β : H=1- 1/2β
Normalized to base interval of 10ms
Figure 3 (a)Interval size=10ms
Figure 3 (b)Interval size=50ms
Figure 3(c)Interval size=1sec
Figure 3 (d)Interval size=30min
Routing devices that are not designed to handle small packets will see significant packet loss or even worse, when handle game traffic.
Router designers and vendors often make packet size assumptions when building their gear, often expecting average sizes in between 1000 and 2000 bits (125-250 bytes). Thus, a significant shift in packet size from the deployment of online games will make the route lookup function as the bottleneck of the link speed.