摘要：We propose a general, simple and practical technique, named Distributed Leafs Pruning (D LP), which canbe combined with every distance vector routing algorithm based on shortest paths, allowing to reduce thetotal number of messages sent by that algorithm. We combine the new technique with three algorithmsknown in the literature: DUA L, which is loop-free and is part of CISCO's widely used EIGRP proto-col; D US T, which has been shown to be effective on networks with power law node degree distribution,although it suffers of looping; LF R, which has been very recently introduced, is loop-free and has beenshown to be very effective on real networks. We give experimental evidence that these combinations leadto an important gain in terms of the number of messages sent by D UA L, DU ST and LFR, on networkshaving a power-law node degree distribution. We also notice that, in many cases the use of DL P deter-mines a gain in terms of the maximum and the average space occupancy per node
