Using geometrical routing for overlay networking in MMOGs

At a first glance, transmitting update information to a geographic region in the virtual space seems to be an attractive primitive in Massively Multiplayer Online Gaming (MMOG) applications where players are constantly moving and need to send updates to their neighbors who are in the same region of the virtual space. The system would become more scalable if entities did not need to keep track of each other or send messages directly to one another. Rather, an entity could just send a message to a specific region in the virtual space (its area of effect), as opposed to sending packets to specific IP addresses, significantly reducing tracking and routing overhead. Fundamentally speaking, update message exchange is mostly based on users’ visibility range, which is mainly affected by proximity; i.e., avatars are interested in nodes within a specific distance around them. Therefore MMOG applications require a routing scheme that can deliver messages to specified locations in the virtual space. Such location based routing motivates the use of geographical routing, which has been introduced and successfully used in the context of wireless networks; however, in its current form it is not well suited for MMOGs which run on wired networks. In this article, we propose a scalable MMOG networking architecture based on hierarchical multi-grid geographical routing that is well suited for MMOG networks. We present our concept and design of hierarchical geometrical routing based on locality sensitive hashing, demonstrate its performance, and discuss both the strengths and shortcomings of our approach.

[1]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[2]  Hiroaki Hazeyama,et al.  Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games , 2004, NetGames '04.

[3]  Carsten Griwodz,et al.  Multicast Tree Diameter for Dynamic Distributed Interactive Applications , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[4]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[5]  Christophe Diot,et al.  Deployment issues for the IP multicast service and architecture , 2000, IEEE Netw..

[6]  Margo I. Seltzer,et al.  Wired Geometric Routing , 2007, IPTPS.

[7]  Tomasz Imielinski,et al.  GeoCast—geographic addressing and routing , 1997, MobiCom '97.

[8]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[9]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[10]  Randy H. Katz,et al.  OverQoS: offering Internet QoS using overlays , 2003, CCRV.

[11]  Abdelfettah Diabi,et al.  A Peer-to-Peer Communication Architecture for Networked Games , 2005 .

[12]  Jaroslav Opatrny,et al.  Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks , 2006 .

[13]  Aaron Harwood,et al.  Enabling massively multi-player online gaming applications on a P2P architecture , 2005 .

[14]  Thorsten Hampel,et al.  A peer-to-peer architecture for massive multiplayer online games , 2006, NetGames '06.

[15]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[16]  Ahmed Helmy,et al.  Efficient geocasting with perfect delivery in wireless networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[17]  Jaroslav Opatrny,et al.  Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[18]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[19]  Honghui Lu,et al.  Peer-to-peer support for massively multiplayer games , 2004, IEEE INFOCOM 2004.

[20]  Srinivasan Seshan,et al.  Colyseus: A Distributed Architecture for Online Multiplayer Games , 2006, NSDI.

[21]  Piotr Indyk,et al.  Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[22]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[23]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[24]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[25]  Son T. Vuong,et al.  MOPAR: a mobile peer-to-peer overlay architecture for interest management of massively multiplayer online games , 2005, NOSSDAV '05.