文件名称：泛洪式算法的改进-p2p网络协议介绍
文件大小：4.61MB
文件格式：PPT
更新时间：2024-05-15 17:02:31
p2p
泛洪式算法的改进 有各种方法可以控制和减少在分布式无结构P2P网络中基于泛洪搜索方法带来大量不必要流量,这大致可归为三类 基于改进转发机制的方法； 基于缓存的方法； 拓扑结构的优化。 “dynamic TTL setting or expanding ring” and “k-walker random walk”. But “k-walker random walk” may have large lookup length (latency). So object replication mechanisms (such as uniform replication, proportional replication, square-root proportional replication, and log-form replication) are proposed at the same time to reduce the lookup length. Lookup message and length can be simultaneously decreased using cache mechanisms such as: cache some objects in the reverse path of queries 这些改进方法会使得无结构P2P网络在将来会有更广阔的应用。