Abstract
Mesh topologies play a vital role in switched networks. Broadcast storms due to the loops in Mesh Networks are a major concern in switched networks. Logical spanning trees are constructed using algorithms like spanning tree algorithm to avoid loops and hence address the broadcast storm problem. However, in the event of a topology change or a link failure in the network, it takes time to converge and construct new spanning tree to forward frames. Link State routing and other protocols like Rapid Spanning Tree protocol[2][19] were introduced to address the problems of high convergence times in the basic spanning tree protocol(STP) in the event of network component failures. A much efficient and advanced approach was offered with Mesh Tree Protocol based on the Mesh Tree Algorithm. Mesh Tree Protocol constructs multiple tree branches from a single root and quickly falls back to an alternate path or switch in case of link or switch failures. This cuts down the convergence delays considerably.
The Mesh Tree Protocol based on the Mesh Tree Algorithm is currently under development as an IEEE standard. Other major changes in the MTP compared to the already existing protocols is that the root is manually assigned instead of using the root election procedure. This will cut down the delays during instantiation of the protocol but also has risk concerning the action of the protocol if the manually assigned root fails. To address this concern, an enhancement to the Mesh Tree protocol is being researched in this thesis. The idea is to implement a Multiple Meshed Tree algorithm where meshed trees will be constructed from multiple roots. This thesis introduces root redundancy in the Mesh Tree Protocol and will be assessed for performance improvements on root failures in comparison with Rapid Spanning Tree Protocol (RSTP) which re-elects a root switch on the current root switch failure.
Library of Congress Subject Headings
Computer networks--Reliability; Routing protocols (Computer network protocols)--Evaluation; Telecommunication--Switching systems
Publication Date
1-2020
Document Type
Thesis
Student Type
Graduate
Degree Name
Computer Science (MS)
Department, Program, or Center
Computer Science (GCCIS)
Advisor
Leonid Reznik
Advisor/Committee Member
Nirmala Shenoy
Advisor/Committee Member
H.B. Acharya
Recommended Citation
Rudroju, Shashank, "Root Failure Analysis in Meshed Tree Networks" (2020). Thesis. Rochester Institute of Technology. Accessed from
https://repository.rit.edu/theses/10341
Campus
RIT – Main Campus
Plan Codes
COMPSCI-MS