Message propagation in a distributed virtual world

• US 8,750,313 B1
• Filed: 02/10/2012
• Issued: 06/10/2014
• Est. Priority Date: 03/29/2007
• Status: Expired due to Fees

• Current Assignee: Qurio Holdings Incorporated
• Original Assignee: Qurio Holdings Incorporated
• Inventors: Kandekar, Kunal, Walsh, Richard J.
• Primary Examiner(s): Ton, Dang
• Assistant Examiner(s): Mansoury, Nourali
• Application Number:
  US13/370,583
• Time in Patent Office: 851 Days
• Field of Search: 370/395.31
• US Class Current: 370/395.31
• CPC Class Codes: A63F 13/352 involving special game server arrangements, e.g. regional servers connected to a national server or a plurality of servers managing partitions of the game world
• CPC Class Codes: A63F 2300/51 Server architecture
• CPC Class Codes: A63F 2300/53 details of basic data processing
• CPC Class Codes: A63F 2300/5533 using program state or machine event data, e.g. server keeps track of the state of multiple players on in a multiple player game
• CPC Class Codes: A63F 2300/5553 user representation in the game field, e.g. avatar
• CPC Class Codes: A63F 2300/8082 Virtual reality
• CPC Class Codes: H04L 61/4511 using domain name system [DNS]
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/131 Protocols for games, networked simulations or virtual reality

Abstract

A message propagation scheme for a distributed virtual world is provided. In general, each of a number of peer servers hosts a cell of the virtual world, where the cell is also referred to herein as a virtual space. A peer server issues an advertisement/subscription (ad/sub) message, or message flow path setup message, identifying message types produced by the virtual objects in the virtual space hosted by the peer server and message types consumed by the virtual objects in the virtual space hosted by the peer server. Based on the ad/sub message, for each message type produced, message flow paths from the peer server to other peer servers hosting virtual objects that are consumers of the message type are identified. Likewise, for each message type consumed, message paths from other peer servers hosting virtual objects that are producers of the message type to the peer server are identified.

Claims

1. A method of defining message flow paths in a distributed virtual world formed by a plurality of peer servers each hosting a virtual space corresponding to a cell of the distributed virtual world, comprising:

receiving, at a neighboring peer server hosting a virtual space neighboring a virtual space hosted by an originating peer server, a message flow path setup message from the originating peer server identifying a plurality of produced message types produced by at least one virtual object within a virtual space hosted by the originating peer server and a scope of the plurality of produced message types;

identifying, at the neighboring peer server, ones of the plurality of produced message types that are of interest to the neighboring peer server;

identifying, at the neighboring peer server, ones of the plurality of produced message types that are of interest to at least one further neighboring peer server of the neighboring peer server;

providing a response to the originating peer server identifying the ones of the plurality of produced message types that are of interest to the neighboring peer server such that messages of the ones of the plurality of produced message types are subsequently routed from the originating peer server to the neighboring peer server; and

updating a routing table by the neighboring peer server such that messages of a plurality of consumed message types from the at least one further neighboring peer server of the neighboring peer server are routed to the peer server.

2. The method of claim 1 wherein the ones of the plurality of produced message types that are of interest to the neighboring peer server comprise at least one of the plurality of produced message types consumed by at least one virtual object within the virtual space hosted by the neighboring peer server and within the scope of the at least one of the plurality of produced message types.

3. The method of claim 1 wherein identifying the ones of the plurality of produced message types of interest to the neighboring peer server comprises:

determining whether at least one virtual object within the virtual space hosted by the neighboring peer server consumes at least one of the plurality of produced message types and is within the scope of the at least one of the plurality of produced message types; and

if at least one virtual object within the virtual space hosted by the neighboring peer server consumes at least one of the plurality of produced message types and is within the scope of the at least one of the plurality of produced message types, generating the response to the peer server such that the response includes information identifying the at least one of the plurality of produced message types consumed by the at least one virtual object within the virtual space hosted by the neighboring peer server.

4. The method of claim 3 wherein identifying the ones of the plurality of produced message types of interest to the neighboring peer server further comprises:

propagating the message flow path setup message to at least one further neighboring peer server of the neighboring peer server; and

further generating the response such that the response further comprises information identifying the at least one of the plurality of produced message types that is of interest to the at least one neighboring peer server.

5. The method of claim 4 wherein, for each one of the at least one neighboring peer server, propagating the message flow path setup message comprises:

filtering the message flow path setup message based on the scope of the plurality of produced message types to remove information identifying ones of the plurality of produced message types having scopes that do not extend into a virtual space hosted by the one of the at least one neighboring peer server to provide a filtered message flow path setup message; and

providing the filtered message flow path setup message to the one of the at least one neighboring peer server.

6. The method of claim 4 further comprising updating a routing table of the neighboring peer server such that messages of the at least one of the plurality of produced message types that is of interest to the at least one neighboring peer server received from the originating peer server are routed to the at least one neighboring peer server.

7. The method of claim 1 wherein the message flow path setup message further identifies a plurality of consumed message types that are of interest to the originating peer server and a scope for the plurality of consumed message types, and the method further comprises:

determining whether at least one virtual object within the virtual space hosted by the neighboring peer server produces at least one of the plurality of consumed message types; and

if at least one virtual object within the virtual space hosted by the neighboring peer server produces at least one of the plurality of consumed message types and is within the scope of the at least one of the plurality of consumed message types, updating a routing table of the neighboring peer server such that messages of the at least one of the plurality of consumed messages types produced by the at least one virtual object within the virtual space hosted by the neighboring peer server are routed to the originating peer server.

8. The method of claim 7 wherein the plurality of consumed message types comprises at least one message type consumed by at least one virtual object within the virtual space hosted by the originating peer server.

9. The method of claim 7 wherein the plurality of consumed message types comprises at least one message type predicted to be consumed by the at least one virtual object within the virtual space hosted by the originating peer server.

10. The method of claim 7 further comprising:

propagating the message flow path setup message to at least one further neighboring peer server of the neighboring peer server.

11. The method of claim 10 wherein, for each one of at least one neighboring peer server, propagating the message flow path setup message comprises:

filtering the message flow path setup message based on the scope of the plurality of consumed message types to remove information identifying ones of the plurality of consumed message types having a scope that does not extend into a virtual space hosted by the one of the at least one neighboring peer server to provide a filtered message flow path setup message; and

providing the filtered message flow setup message to the one of the at least one neighboring peer server.

12. A method of defining message flow paths in a distributed virtual world formed by a plurality of peer servers each hosting a virtual space corresponding to a cell of the distributed virtual world, comprising:

generating, at a peer server, a message flow path setup message identifying a plurality of consumed message types that are of interest to the peer server and a scope of the plurality of consumed message types; and

providing the message flow path setup message to at least one neighboring peer server from the plurality of peer servers, the at least one neighboring peer server hosting a virtual space neighboring the virtual space of the peer server in the distributed virtual world;

wherein at least one message flow path for at least one of the plurality of consumed message types is established between at least one of the plurality of peer servers hosting a virtual object that produces the at least one of the plurality of consumed message types and the peer server based on the message flow path setup message and the at least one neighboring peer server propagates the message flow path setup message to at least one further neighboring peer server of the at least one neighboring peer server, and the at least one neighboring peer server updates its routing table such that messages of at least one of the plurality of consumed message types received from the at least one further neighboring peer server are routed to the peer server.

13. The method of claim 12 wherein the at least one neighboring peer server updates its routing table such that messages of at least one of the plurality of consumed message types produced by at least one virtual object within a virtual space hosted by the at least one neighboring peer server and within the scope of the at least one plurality of consumed message types are routed to the peer server.

14. A method of defining message flow paths in a distributed virtual world formed by a plurality of peer servers each hosting a virtual space corresponding to a cell of the distributed virtual world, comprising:

receiving, at a neighboring peer server hosting a virtual space neighboring a virtual space hosted by an originating peer server, a message flow path setup message from the originating peer server identifying a plurality of consumed message types that are of interest to the originating peer server and a scope of the plurality of consumed message types;

determining, at the neighboring peer server, whether at least one virtual object within the virtual space hosted by the neighboring peer server produces at least one of the plurality of consumed message types;

if the at least one virtual object within the virtual space hosted by the neighboring peer server produces at least one of the plurality of consumed message types and is within the scope of the at least one of the plurality of consumed message types, updating a routing table of the neighboring peer server such that messages of the at least one of the plurality of consumed messages types produced by the at least one virtual object within the virtual space hosted by the neighboring peer server are routed to the originating peer server;

determining, at the neighboring peer server, if ones of the plurality of consumed message types are of interest to at least one further neighboring peer server of the neighboring peer server; and

updating a routing table by the neighboring peer server such that messages of the plurality of consumed message types received from the at least one further neighboring peer server of to a neighboring peer server are routed to the originating peer server.

15. The method of claim 14 further comprising:

propagating the message flow path setup message to at least one further neighboring peer server of the neighboring peer server.

16. A system comprising:

a) a communication interface communicatively coupling the system to a network; and

b) a control system associated with the communication interface and including a peer server hosting a virtual space of a distributed virtual world formed by a plurality of peer servers including the peer server each hosting a virtual space corresponding to a cell of the distributed virtual world, the peer server configured to;

i) receive, from an originating peer server hosting a virtual space neighboring the virtual space hosted by the peer server, a message flow path setup message identifying a plurality of produced message types produced by at least one virtual object within the virtual space hosted by the originating peer server and a scope of the plurality of produced message types;

ii) identify ones of the plurality of produced message types that are of interest to the peer server;

iii) identify ones of the plurality of produced message types that are of interest to at least one further neighboring peer server of the neighboring peer server;

iv) provide a response to the originating peer server identifying the ones of the plurality of produced message types of interest to the peer server such that messages of the ones of the plurality of produced message types are subsequently routed from the originating peer server to the peer server; and

v) update a routing table such that messages of the plurality of consumed message types from the at least one further neighboring peer server of the neighboring peer server are routed to the peer server.

17. A system comprising:

a) a communication interface communicatively coupling the system to a network; and

b) a control system associated with the communication interface and including a peer server hosting a virtual space of a distributed virtual world formed by a plurality of peer servers including the peer server each hosting a virtual space corresponding to a cell of the distributed virtual world, the peer server configured to;

i) receive, from an originating peer server hosting a virtual space neighboring the virtual space hosted by the peer server, a message flow path setup message identifying a plurality of consumed message types that are of interest to the originating peer server and a scope of the plurality of consumed message types;

ii) determine whether at least one virtual object within the virtual space hosted by the peer server produces at least one of the plurality of consumed message types;

iii) if the at least one virtual object within the virtual space hosted by the peer server produces at least one of the plurality of consumed message types and is within the scope of the at least one of the plurality of consumed message types, update a routing table of the peer server such that messages of the at least one of the plurality of consumed message types produced by the at least one virtual object within the virtual space hosted by the peer server are routed to the originating peer server;

iv) determine if ones of the plurality of consumed message types are of interest to at least one further neighboring peer server of the neighboring peer server; and

v) update a routing table such that messages of the plurality of consumed message types received from the at least one further neighboring peer server of the neighboring peer server are routed to the originating peer server.

18. The system of claim 17 wherein the peer server is further configured to:

propagate the message flow path setup message to at least one neighboring peer server of the peer server.