Scheme | Neighbor discovery | Connectivity | Partitioning | AOI type | Latency | Other supports |
Update-free Regions | server introduction | all | none | aura | 1-hop | |
Solipsis | peer notification | AOI neighbors | AOI | focus | 1-hop | |
P2P Message Exchange | list exchange | AOI neighbors | AOI | focus | 1-hop | |
Federated P2P | server notification | server | static | focus | 2-hop | |
SimMud | DHT query supernode notification | supernode | static (rectangle) | focus | 2 to many | state management event ordering |
Real Tournament | supernode notification | supernode | dynamic (split) | aura | 1-hop | mobile network state management |
Frontier Sets | server introduction | all | none | focus | 1-hop | |
VON | peer notification | AOI neighbors | AOI | focus | 1-hop | Voronoi-based |
Zone Federation | supernode notification DHT query | supernode | static | focus | 1-hop | |
OPeN | DHT query | tree (octree) AOI neighbors | AOI | focus | 1-hop | spatial object query |
Time Prisoner | server introduction | AOI neighbors | AOI | aura | 1-hop | |
HYMS | supernode notification server notification | supernode/server | dynamic (kd-tree) | focus | 2 hops | fault tolerance cheat prevention real MMOG trace/analysis |
Delaunay-VCS | peer notification | nearest neighbor | AOI | nimbus | 1 to many | Delaunay-based |
Message Interchange Protocol | list exchange | AOI neighbors quadrant neighbors | AOI | focus | 1-hop | |
MOPAR | DHT query list exchange | supernode AOI neighbors | static (hexagon) | focus | 1-hop | |
N-Trees | supernode notification | tree (quad/octree) | dynamic (split-merge) | focus | 1-hop | |
DEDM | supernode notification | supernode tree (k-ary) | static | focus | 2 to many | event ordering load balancing tree, ns2 simulation |
APOLO | peer notification overlay multicast | quadrant neighbors | AOI | nimbus | 1 to many | |
Colyseus | (ranged) DHT query | AOI neighbors | AOI | focus | 1-hop | state management event ordering |
COVER | peer notification supernode notification | tree (quadtree) | dynamic (split-merge) | focus | 1 to 2 hops | |
RAP | supernode notification | supernode AOI neighbors | static | focus | 1 hop | triad supernode fault tolerance cheat prevention |
Relay Node | server notification | server supernode | AOI | focus | 2 to 3 hops | |
P2P- Infrastructure | server notification | server | dynamic (split-merge) | focus | 2 | |
Peer Clustering | supernode notification | supernode | static (hexagon) | focus | 2 hops | supernode-based fault tolerance and cheat prevention |
DSID | supernode notification | tree (2~8 children) | dynamic (split-merge) | focus | 2 to many | |
Pastry-based MMOG | DHT query supernode notification | supernode | static | focus | 2 to many | persistent storage supernode-based cheat prevention |
Peers@Play | supernode notification | supernode AOI neighbors | N/A | focus | 1 to 2 hops | dynamic clustering |
DN Clustering | peer notification | nearest neighbors | AOI | nimbus | 1 to many | Delaunay-based dynamic clustering |
Mediator | DHT query supernode notification | supernode AOI neighbors | dynamic | focus | 1-hop | supernode selection & match-making |
Hydra | server introduction | server | static | focus | 2-hop | fault tolerance API design |
DS2M | peer notification | mesh server | static | N/A | 1 to many | degree-constrain minimum-cost graph |
Nomad | peer notification | AOI neighbors | AOI | focus | 1-hop | Voronoi-based |
VON Forwarding | peer notification overlay multicast | nearest neighbors | AOI | nimbus | 1 to many | Voronoi-based asymmetric AOI |
QuadCast | server introduction peer notification | quadrant neighbors | AOI | nimbus | 1 to many | AOI voice chat |
|
Voronoi Data Management | peer notification | AOI neighbors | AOI | nimbus | 1 hop | Voronoi-based state management |
VSM | peer notification supernode notification | AOI neighbors supernode | dynamic (Voronoi) | focus | 2 to 3 hops | Voronoi-based state management dynamic clustering fault tolerance |
Solipsis (2) | supernode notification | AOI neighbors supernode | dynamic (Voronoi) | focus | 2 to 3 hops | Voronoi-based state management |
HyperVerse | server notification | AOI neighbors server | dynamic | focus | 2 hops | state management |
VoroCast | peer notification overlay multicast | nearest neighbors | AOI | nimbus | 1 to many | Voronoi-based non-redundant forwarding |
Donnybrook | server introduction | all | none | aura | 1 to 2 hops | state management variable update frequency |
pSense | peer notification overlay multicast | AOI neighbors quadrant neighbors | AOI | focus | mostly 1 (depend on density) | bandwidth limited probabilistic update |
Voronoi AOI-cast | peer notification | AOI neighbors | AOI | nimbus | 1 to many | Voronoi-based direct and forwarding hybrid |
VoroGame | peer notification | AOI neighbors tree | AOI | nimbus | 1 hop | Voronoi-based dual overlay state management |
QuON | peer notification | quadrant neighbors AOI neighbors | AOI | focus | 1 hop | |
P2P Second Life | DHT query | tree | dynamic (split-merge) | focus | 1 to many | KAD-based persistent storage fault tolerance |
Area of Propagation | server introduction | server AOI neighbors | AOI | nimbus | 1 to 2 | concept of AOI/AOE hybrid update propagation |
PBT | DHT query + overlay multicast | tree | dynamic (split-merge) | focus | 1 to many | grid + binary space partitioning dynamic load balancing |
DAM | overlay multicast | nearest neighbor | AOI | nimbus | 1 to many | Delaunay-based real experiment |
Blue Banana | peer notification | AOI neighbors | AOI | focus | 1 hop | Solipsis-based movement prediction |
VN-Cloud | DHT query | server, mesh | AOI | focus | 1 to many | cloud resource virtual nodes |
 
Classification | Description |
Neighbor discovery |
the method a peer learns of relevant neighbors to interact with, including these types:
server introduction: the server knows all nodes, and tells a newly joined node all neighbors.
server notification: the server maintains all nodes, notifies a peer of its AOI neighbors.
supernode notification: selected peers with knowledge of entire region notify other regular peers.
peer notification: peers mutually notify each other of new AOI neighbors.
list exchange: peers exchange the neighbor list they maintain to discover new AOI neighbors.
DHT query: peers form a DHT overlay, and search for relevant neighbors or supernodes for new AOI neighbors.
overlay multicast: peers multicast their positions regularly to allow other nodes learn of their positions.
|
Connectivity |
which other nodes does a single node connects within the P2P environment, including these types:
server: each peer connects only to the server (a provisioned machine).
all: each peer maintains contacts with all other nodes in the world.
supernode: each peer connects to certain selected peers.
AOI neighbors: each peer connects to all other nodes within the AOI.
nearest neighbors: each peer connects to its nearest 1-hop neighbors (according to Voronoi/Delaunay mapping)
quadrant neighbors: each peer connects with one neighbor within each of the four quadrants.
tree: each peer connects to a parent node and several children nodes.
mesh: each peer connects to a few nearby nodes to ensure a connected mesh
|
Partitioning |
whether the entire virtual world is partitioned into various regions, including the following types:
none: there's no partitioning.
AOI: no explicit partitioning exists, but each node generally interacts only with their AOI neighbors.
static: world is partitioned beforehand, and the partitions cannot changed during run-time.
dynamic: the partitioning occurs dynamically according to loading or node density.
|
AOI type |
definition of area of interest (AOI) used, including the following types:
aura: sphere of interaction, if two aura intersect then interaction is mutual
focus: sphere of reception (subscriber-like), the AOI indicates an area where all events within should be received
nimbus: sphere of influence (publisher-like), the AOI indicates an area the node or event may affect
|
Latency | number of end-to-end hops to send an update message to a visible neighbor |
Other supports | any other functionalties supported by the scheme beyond basic P2P topology maintenance and neighbor discovery |