[Beowulf] Spanning Tree Protocol and latency: allowing loops in switching networks for minimizing switch hops
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Rahul Nabar rpnabar at gmail.comTue Feb 23 21:32:02 PST 2010
- Previous message: [Beowulf] Spanning Tree Protocol and latency: allowing loops in switching networks for minimizing switch hops
- Next message: [Beowulf] Spanning Tree Protocol and latency: allowing loops in switching networks for minimizing switch hops
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Tue, Feb 23, 2010 at 11:03 PM, Eric W. Biederman <ebiederm at xmission.com> wrote: > > For the most trivial of loops there is link aggregation. Yup, that's true. Am already using link aggregation but never thought of that as a loop before. But makes sense. > For more interesting loops you can run many ethernet switches > as wire speed ip routers talking a routing protocol like ospf. Thanks! I will look that up. Maybe it serves my need. -- Rahul
- Previous message: [Beowulf] Spanning Tree Protocol and latency: allowing loops in switching networks for minimizing switch hops
- Next message: [Beowulf] Spanning Tree Protocol and latency: allowing loops in switching networks for minimizing switch hops
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list