Abstract: The standard Pastry protocol uses the static PNS algorithm to implement the routing locality.It will degenerate with the time going.The improved algorithm，PNS-CG，costs relatively high overhead.To address these problems，an improved dynamic PNS algorithm is proposed which enhances the routing locality property with much less overhead than PNS-CG and improves the routing efficiency in dynamic environment.

Key words: routing locality, proximity neighbor selection, Constrained Gossiping Proximity Neighbor Selection

摘要： 针对静态的PNS算法使路由局部性随时间退化以及改进的PNS-CG的动态局部性维护协议的系统开销较大的问题，提出了一种动态PNS改进算法。在高动态性网络中，改进的算法比PNS-CG在占用更少的开销的情况下，解决了局部性退化问题，提高了路由效率。

关键词: 路由局部性, 邻近邻居选择, 一种基于邻近邻居选择的有限闲聊的方法（PNS-CG）