Back to search

Rochester Institute of Technology

A Performance Analysis of the Meshed Tree Protocol and the Rapid Spanning Tree Protocol

Abstract

dc:description.abstract

Loop avoidance is essential in switched networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to overcome this issue and preserve the stability of the network. However, during topology changes as the result of a failure, frame forwarding latency or frame loss is introduced when re-converging and identifying new spanning tree paths. The Meshed Tree algorithm (MTA) offers a new approach. Meshed Trees support multiple tree branches from a single root to cut down on re-convergence latency on link failures. A Meshed Tree Protocol (MTP) based on MTA is currently under development as an IEEE standard. MTP is evaluated for convergence delay and frame loss in comparison with Rapid Spanning Tree Protocol (RSTP) on the GENI testbed.

Degree

thesis:*
Name thesis:degree_name
Networking and System Administration (MS)
Level thesis:degree_level
Thesis

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Willis, Peter
Contributors dc:contributor
  • Nirmala Shenoy

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://repository.rit.edu/theses/10183

Chain of custody

source
Harvested from
Rochester Institute of Technology
Base URL
repository.rit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Willis, Peter. A Performance Analysis of the Meshed Tree Protocol and the Rapid Spanning Tree Protocol. Thesis thesis, https://repository.rit.edu/theses/10183