HAMMER2 progress report - 07-Aug-2012

Siju George sgeorge.ml2 at gmail.com
Tue Aug 14 17:53:43 PDT 2012

On Wed, Aug 8, 2012 at 10:44 AM, Matthew Dillon
<dillon at 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? :-)


More information about the Users mailing list