Coordinating Mobile Servers for Static Hierarchical States
Savio S. H. Tse, Markus Schaal · 2014
We design a Peer-to-Peer network to maintain a large set of hierarchical static states. We argue that these states are common and natural in collaborative knowledge-based systems, and online games. On the top of the hierarchy, we apply many B+-trees of order-k for connecting all online nodes to enhance parallelism, where k is any constant more than two. The overhead communication cost for each join and leave is bounded by O(logk N) messages, and the number of connections (edges) in each node is bounded by 2k+4.