Study on locality-aware peer-to-peer network model
一种位置感知的对等网络模型研究*

This paper proposed a locality-aware distributed spanning tree (LDST) model for trying to access the network resources localized and reduce the latency, by organizing adjacent nodes in geographical into close groups in logical. Firstly, defined the distance of two nodes in the overlay network with the hops or the latency between two nodes in the underlying network. Next, presented the rules how to select the node as the representative and the group as the nearest group in the LDST model, and showed the arrival algorithm to construct a non-landmark, hierarchy and locality-aware overlay network. Finally, the mathematic analysis and simulation results show that the LDST model is a small-world, the time complexity of the arrival algorithm is logarithmic and the scalable LDST model has a good application value.