References in periodicals archive ?
Among the KCDS algorithms, the algorithm that generates the highest number of neighbours is the k-gossip.
The algorithms compared are: MBN-TSA, MCDS, Mesh, Tree, Span, Marking process with rules 1 & 2, and rule k, and KCDS algorithms.
In networks in which there are more frequent failures it is better to use the KCDS algorithms, which provide path redundancy in the backbone.