Self-Refining Skip Graph: A Structured Overlay Approaching to Ideal Skip Graph

In Skip Graph, each node constructs its routing table by choosing neighbor nodes based on its membership vector when a node joins or leaves. However, membership vectors are determined randomly, so nodes do not always compose an ideal topology of Skip Graph. This causes route length to be long. Therefore, we propose Self-Refining Skip Graph, a structured overlay where each node refines its routing table for an ideal topology of Skip Graph. Our proposed method shows shorter route length as approaching to an ideal topology while keeping the robustness caused by membership vectors. We confirmed in the evaluation that the topology approaches to an ideal one and the route length becomes shorter than Skip Graph.