Performance Evaluation of GP3 - A Grid-Based Spatial Index Infrastructure

Resilience and Multicast Aspects of the Structured Network Overlay GP3

“…One can see, that the average variation is always between 2 and 3.5. This is a quite good result, especially if considering, that the average order variation during the join process is around 1.5, as shown in [4]. Consequently we can assess, that the GP3 structure and the uniform distribution of the plane can be preserved quite good under random node failures.…”

“…As previous evaluations presented in [4] have shown, the overlay allows efficient joining of nodes to the network as well as fast node lockup. It has been shown by formal proofs that the upper bound for the order variation as well as for join and node lookup operations is in O(log 4 n).…”

“…In [4] it has been shown, that the join algorithm of GP3 produces a uniform distribution of the plane. While this is important for the scalability of the overlay, the resilience against high churn rates is crucial as well.…”

“…Since, as already mentioned, the messages from the source, to each receiver takes exactly the same path as with unicast routing, the latency for each node is the ssame as if unicast messages are send to each receiver. As shown in [4] the hop count between two arbitrary nodes depends on the number of nodes in the network and is given by O(log 4 n). To get information, how long it takes, till all nodes have received a geocast, in the simulations, we measured the actual longest path between the source and the receivers for each multicast.…”

“…GP3 is a structured P2P overlay network especially designed for our scenario of a globalscale Distributed Virtual Environment (DVE). It has been shown in [4], that GP3 allows for the reference locality in virtual online environments and provides efficient join and node lookup operation. The behavior of the overlay under different churn rates as well as the robustness against random node failures is studied in this paper.…”