Light-weight Partial Flooding Strategy in Gnutella Network
Zhiguo Zhang · Computer and Modernization · 2011
Although it is very effective in content search,standard flooding mechanism is very inefficient because it results in a great amount of redundant messages which greatly restricts the scalability of networks.To solve the issue of redundancy message increasing quickly but coverage growing slowly when hop is high,this paper proposes a new lightweight partial flooding strategy named PartialFlood.In PartialFlood,when node receives a message it will not send the message to all its neighbors but select only part of them randomly as the object to forward.Analysis and simulation results show that the PartialFlood can greatly minimize the number of redundant messages while retaining the same message propagating scope as that of standard flooding,and it can be effectively used in P2P searching.