1 / 6

Is Spanning Tree Protocol Right for ESS Mesh?

This article discusses the advantages and disadvantages of using the spanning tree protocol for an ESS mesh network. It also explores alternative shortest-path forwarding algorithms and raises questions for further consideration.

morrisont
Download Presentation

Is Spanning Tree Protocol Right for ESS Mesh?

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Is Spanning Tree Protocol Right for ESS Mesh? Tyan-Shu Jou, Ted Kuo, and Ming Sheu tsjou@janusysnetworks.com Janusys Networks, Inc. Date: May 11, 2004 Tyan-Shu Jou, et al., Janusys Networks

  2. Forwarding Topologies to Prevent Traffic Looping on an ESS Mesh • One global spanning tree (802.1d/802.1w) • Shortest Path based routing algorithms (Spanning tree algorithms are essentially Distance Vector routing protocol running at Layer 2 that computes the lowest cost paths to the designated Root node) Tyan-Shu Jou, et al., Janusys Networks

  3. Advantages of Using Spanning Tree on ESS Mesh • Proven & standard algorithm • Rapid Spanning Tree (802.1w) can converge within a short time • (Although on wireless networks, link up/down detection are timer dependent) • Low processing overhead Tyan-Shu Jou, et al., Janusys Networks

  4. Disadvantages of using Spanning Tree on ESS Mesh • Not optimal connections between wireless peers • Not intended for dynamic topology – the global tree has to be reconstructed for any link change • Load sharing is difficult—eg., in case multiple border nodes to wired network exist • Difficult to reflect dynamic metrics such as receiving signal strength Tyan-Shu Jou, et al., Janusys Networks

  5. Examples of Shortest-path forwarding Algorithms • OSPFv3 extension for wireless ad-hoc network • IETF MANET: 4 IP routing protocols for wireless ad-hoc network • Many others (NRL Dynamic backbone, Zigbee, …) Tyan-Shu Jou, et al., Janusys Networks

  6. Questions for the SG • Should we decide which layer (or, what address) the forwarding algorithm should be based? • Should we decide one forwarding algorithm? • Can we only define the communication message format rather than the algorithm? • Can we only define the MAC interface so the same hardware module can be shared? • How much interoperability among vendors required? Tyan-Shu Jou, et al., Janusys Networks

More Related