Home // ICNS 2012, The Eighth International Conference on Networking and Services // View article

A Meshed Tree Algorithm For Loop Avoidance In Switched Networks

Authors:
Nirmala Shenoy

Keywords: Loop Avoidance; Switched Networks; Meshed Trees

Abstract:
Loop free forwarding and routing is a continuing challenge in networks that have link and path redundancy. Solutions to overcome looping in bridged or switched networks are addressed by special protocols at layer 2, which block ports in the bridges to build a logical forwarding spanning tree. In this paper a meshed tree algorithm that aids in building and maintaining multiple overlapped tree branches from a single root node without blocking any ports is presented. Its potential use in bridged networks for loop avoidance is discussed. Some of its salient features are compared with spanning tree-based protocols and TRILL (Transparent Interconnection of Lots of Links) on RBridges (router bridges), another solution proposed for resolving loops in bridged networks

Pages: 52 to 56

Copyright: Copyright (c) IARIA, 2012

Publication date: March 25, 2012

Published in: conference

ISSN: 2308-4006

ISBN: 978-1-61208-186-1

Location: St. Maarten, The Netherlands Antilles

Dates: from March 25, 2012 to March 30, 2012