On Wed, Aug 8, 2012 at 10:44 AM, Matthew Dillon <dil...@apollo.backplane.com> wrote:
> Full graph spanning tree protocol so there can be loops, multiple ways > to get to the same target, and so on and so forth. The SPANs propagate > the best N (one or two) paths for each mount. > Can this be tested in development. What commands should be used? :-) --Thanks
