Performance evaluation of routing algorithms for distributed key-value store based on order preserving linear hashing and Skip graph

摘要

In this paper, routing algorithms for the distributed key-value store based on order preserving linear hashing and Skip Graph are evaluated. In this system, data are divided by linear hashing and Skip Graph is used for overlay network. The routing table of this system is very uniform. Then, short detours can exist in the route of forwarding. In this paper, by comparison with an exact shortest route, it proved that the routing algorithm using detour is effective.