Adaptive event dissemination for peer-to-peer multiplayer online games
Pages 312 - 319
Abstract
In this paper we show that gossip algorithms may be effectively used to disseminate game events in Peer-to-Peer (P2P) Multiplayer Online Games (MOGs). Game events are disseminated through an overlay network. The proposed scheme exploits the typical behavior of players to tune the data dissemination. In fact, it is well known that users playing a MOG typically generate game events at a rate that can be approximated using some (game dependent) probability distribution. Hence, as soon as a given node experiences a reception rate, for messages coming from a given peer, which is lower than expected, it can send a stimulus to the neighbor that usually forwards these messages, asking it to increase its dissemination probability. Three variants of this approach will be studied. According to the first one, upon reception of a stimulus from a neighbor, a peer increases its dissemination probability towards that node irrespectively from the sender. In the second protocol a peer increases only the dissemination probability for a given sender towards all its neighbors. Finally, the third protocol takes into consideration both the sender and the neighbor in order to decide how to increase the dissemination probability. We performed extensive simulations to assess the efficacy of the proposed scheme, and based on the simulation results we compare the different dissemination protocols. The results confirm that adaptive gossip schemes are indeed effective and deserve further investigation.
References
[1]
Parallel And Distributed Simulation (PADS) Research Group. http://pads.cs.unibo.it, 2011.
[2]
D. T. Ahmed and S. Shirmohammadi. A dynamic area of interest management and collaboration model for p2p mmogs. In Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications, DS-RT '08, pages 27--34, Washington, DC, USA, 2008. IEEE Computer Society.
[3]
G. Armitage and P. Branch. Distribution of first person shooter online multiplayer games. Int. J. Adv. Media Commun., 1:59--75, September 2005.
[4]
A.-L. Barabási, R. Albert, and H. Jeong. Scale-free characteristics of random networks: the topology of the world-wide web. Physica A: Statistical Mechanics and its Applications, 281(1--4):69--77, Jun 2000.
[5]
E. Cronin, A. R. Kurc, B. Filstrup, and S. Jamin. An efficient synchronization mechanism for mirrored game architectures. Multimedia Tools Appl., 23:7--30, May 2004.
[6]
G. D'Angelo and M. Bracuto. Distributed simulation of large-scale and detailed models. International Journal of Simulation and Process Modelling (IJSPM), 5(2):120--131, 2009.
[7]
G. D'Angelo and S. Ferretti. Simulation of scale-free networks. In Simutools '09: Proc. of the 2nd International Conference on Simulation Tools and Techniques, pages 1--10, ICST, Brussels, Belgium, 2009. ICST.
[8]
S. Ferretti. A synchronization protocol for supporting peer-to-peer multiplayer online games in overlay networks. In DEBS '08: Proc. of the second international conference on Distributed event-based systems, pages 83--94, New York, NY, USA, 2008. ACM.
[9]
S. Ferretti. Modeling Faulty, Unstructured P2P Overlays. In Proc. of the 19th International Conference on Computer Communications and Networks (ICCCN 2010). IEEE, August 2010.
[10]
S. Ferretti and G. D'Angelo. Multiplayer online games over scale-free networks: a viable solution? In Proc. of the International Workshop on DIstributed SImulation and Online gaming (DISIO 2010) - Conference on Simulation Tools and Techniques (SIMUTools 2010). ICST, 2010.
[11]
S. Ferretti, C. E. Palazzi, M. Roccetti, G. Pau, and M. Gerla. Fila in gameland, a holistic approach to a problem of many dimensions. Comput. Entertain., 4, October 2006.
[12]
G. H. L. Fletcher and H. A. Sheth. Unstructured peer-to-peer networks: Topological properties and search performance. In 3rd International Conference on Autonomous Agents and MUlti-Agent Systems, pages 14--27. Springer, 2004.
[13]
E. R. Gansner and S. C. North. An open graph visualization system and its applications to software engineering. Softw. Pract. Exper., 30:1203--1233, September 2000.
[14]
B. Garbinato, D. Rochat, and M. Tomassini. Impact of scale-free topologies on gossiping in ad hoc networks. In NCA, pages 269--272. IEEE Computer Society, 2007.
[15]
H. Guclu and M. Yuksel. Limited scale-free overlay topologies for unstructured peer-to-peer networks. IEEE Trans. Parallel Distrib. Syst., 20(5):667--679, 2009.
[16]
T. Iimura, H. Hazeyama, and Y. Kadobayashi. Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games. In Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games, NetGames '04, pages 116--120, New York, NY, USA, 2004. ACM.
[17]
J. Müller, S. Fischer, S. Gorlatch, and M. Mauve. A proxy server-network for real-time computer games. In Proceedings of Euro-Par 2004 Parallel Processing, 10th International Euro-Par Conference, Pisa, Italy, volume 3149 of Lecture Notes in Computer Science, pages 606--613. Springer, 2004.
[18]
M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167--256, 2003.
[19]
S. Verma and W. T. Ooi. Controlling gossip protocol infection pattern using adaptive fanout. In ICDCS '05: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, pages 665--674, Washington, DC, USA, 2005. IEEE Computer Society.
[20]
A. P. Yu and S. T. Vuong. Mopar: a mobile peer-to-peer overlay architecture for interest management of massively multiplayer online games. In Proceedings of the international workshop on Network and operating systems support for digital audio and video, NOSSDAV '05, pages 99--104, New York, NY, USA, 2005. ACM.
Index Terms
- Adaptive event dissemination for peer-to-peer multiplayer online games
Recommendations
Multiplayer Online Games over scale-free networks: a viable solution?
SIMUTools '10: Proceedings of the 3rd International ICST Conference on Simulation Tools and TechniquesIn this paper we discuss the viability of deploying Multiplayer Online Games (MOGs) over scale-free networks. We employ a general peer-to-peer overlay network; nodes have a number of neighbors which follows a power law distribution, pk ~ k-α, the usual ...
Peer-to-peer multimedia applications
MM '06: Proceedings of the 14th ACM international conference on MultimediaIn both academia and industry, peer-to-peer (P2P) applications have attracted great attention. Peer-to-peer file sharing applications, such as Napster, Gnutella, Kazaa, BitTorrent, Skype and PPLive, have witnessed tremendous success among end users. And ...
Understanding overlay characteristics of a large-scale peer-to-peer IPTV system
This article presents results from our measurement and modeling efforts on the large-scale peer-to-peer (p2p) overlay graphs spanned by the PPLive system, the most popular and largest p2p IPTV (Internet Protocol Television) system today. Unlike other ...
Comments
Information & Contributors
Information
Published In
March 2011
527 pages
ISBN:9781936968008
- General Chairs:
- Jason Liu,
- Francesco Quaglia,
- Program Chairs:
- Stephan Eidenbenz,
- Stephen Gilmore
Sponsors
- ICST
In-Cooperation
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 21 March 2011
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SIMUTools '11
Sponsor:
SIMUTools '11: 4th International ICST Conference on Simulation Tools and Techniques
March 21 - 25, 2011
Barcelona, Spain
Acceptance Rates
Overall Acceptance Rate 20 of 73 submissions, 27%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 106Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in