位置感知的覆盖网构建算法

提出了一个基于底层网络位置信息建立P2P覆盖网的算法Lanet:覆盖网中每个节点都选择和本节点物理距离相近的节点作为自己的邻居,逻辑上相邻的节点也是物理上相近的节点。由于路由路径中每跳的延时都较低,这使得所建立的覆盖网络具有非常低的延时伸展率(latency stretch)。Lanet不需要网络中固定的节点集充当地标节点,具有很好的分布性和可扩展性。模拟实验结果表明,利用该算法建立的位置感知的P2P系统能够大幅度降低数据定位的延时。

Research of Location-aware Overlay Construction Algorithm

An algorithm named Lanet whereby the overlay network construction is based on the location information of underlying physical topology is presented.Each peer is connected to a small subset of the other peers which are close in the physical network.The peers that are close in the logical network are also close in the physical network.As a result,the expected delay of each hop in the routing path is very low.This leads to low latency stretch of the overlay network.This algorithm is scalable and distributing for a fixed subset of nodes act as landmarks is not required.Simulation results indicate that the latency of data location in these location-aware systems that are constructed with Lanet can be significantly decreased.