000056834 001__ 56834
000056834 005__ 20170327111849.0
000056834 0247_ $$2doi$$a10.1007/s11042-015-3001-y
000056834 0248_ $$2sideral$$a92946
000056834 037__ $$aART-2015-92946
000056834 041__ $$aeng
000056834 100__ $$0(orcid)0000-0002-6977-6363$$aSaldana, J.$$uUniversidad de Zaragoza
000056834 245__ $$aOn the effectiveness of an optimization method for the traffic of TCP-based multiplayer online games
000056834 260__ $$c2015
000056834 5060_ $$aAccess copy available to the general public$$fUnrestricted
000056834 5203_ $$aThis paper studies the feasibility of using an optimization method, based on multiplexing and header compression, for the traffic of Massively Multiplayer Online Role Playing Games (MMORPGs) using TCP at the Transport Layer. Different scenarios where a number of flows share a common network path are identified. The adaptation of the multiplexing method is explained, and a formula of the savings is devised. The header compression ratio is obtained using real traces of a popular game and a statistical model of its traffic is used to obtain the bandwidth saving as a function of the number of players and the multiplexing period. The obtained savings can be up to 60 % for IPv4 and 70 % for IPv6. A Mean Opinion Score model from the literature is employed to calculate the limits of the multiplexing period that can be used without harming the user experience. The interactions between multiplexed and non-multiplexed flows, sharing a bottleneck with different kinds of background traffic, are studied through simulations. As a result of the tests, some limits for the multiplexing period are recommended: the unfairness between players can be low if the value of the multiplexing period is kept under 10 or 20 ms. TCP background flows using SACK (Selective Acknowledgment) and Reno yield better results, in terms of fairness, than Tahoe and New Reno. When UDP is used for background traffic, high values of the multiplexing period may stress the unfairness between flows if network congestion is severe.
000056834 540__ $$9info:eu-repo/semantics/openAccess$$aby$$uhttp://creativecommons.org/licenses/by/3.0/es/
000056834 590__ $$a1.331$$b2015
000056834 591__ $$aENGINEERING, ELECTRICAL & ELECTRONIC$$b120 / 253 = 0.474$$c2015$$dQ2$$eT2
000056834 591__ $$aCOMPUTER SCIENCE, SOFTWARE ENGINEERING$$b31 / 105 = 0.295$$c2015$$dQ2$$eT1
000056834 591__ $$aCOMPUTER SCIENCE, THEORY & METHODS$$b37 / 105 = 0.352$$c2015$$dQ2$$eT2
000056834 591__ $$aCOMPUTER SCIENCE, INFORMATION SYSTEMS$$b62 / 142 = 0.437$$c2015$$dQ2$$eT2
000056834 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/acceptedVersion
000056834 7102_ $$15008$$2560$$aUniversidad de Zaragoza$$bDepartamento de Ingeniería Electrónica y Comunicaciones$$cIngenieria Telematica
000056834 773__ $$g(2015), [42 pp]$$pMultimed. Tools Appl.$$tMULTIMEDIA TOOLS AND APPLICATIONS$$x1380-7501
000056834 8564_ $$s1177413$$uhttp://zaguan.unizar.es/record/56834/files/texto_completo.pdf$$yPostprint
000056834 8564_ $$s32510$$uhttp://zaguan.unizar.es/record/56834/files/texto_completo.jpg?subformat=icon$$xicon$$yPostprint
000056834 909CO $$ooai:zaguan.unizar.es:56834$$particulos$$pdriver
000056834 951__ $$a2016-10-26-10:06:19
000056834 980__ $$aARTICLE