Abstract

The continued growth of computer networks in both size and complexity presents challenges for the control protocols that are tasked with maintaining optimal data-forwarding paths. These protocols commonly rely on shortest-path algorithms to determine where network data should be propagated and how it should be analyzed for inclusion in forwarding tables. However, problems arise during reconvergence, the process in which devices rediscover optimal paths following a network failure. Because control protocols were built decades ago for the networks of that era, the existing shortest-path algorithms utilized were designed for problems before the advent of modern computer networks. This resulted in protocols that often cause extended downtime while reconverging the network to a functional state. This downtime reduces service availability, reliability, and can result in a substantial financial impact. This is especially true for data centers, which house thousands of servers to provide cloud-native services. This dissertation addresses these challenges through the development of proactive solutions to minimize downtime and reduce the computational overhead required for reconvergence. Proactivity is achieved through the construction of a Meshed Tree, a novel structure designed for resiliency by maintaining both preferred and precomputed backup forwarding paths. These backup paths, managed by the Meshed Tree Algorithm (MTA) introduced in this work, mitigate reconvergence delays when a component failure occurs along the preferred path. MTA was validated and implemented in a Meshed Tree Protocol (MTP) for use in switched Ethernet networks and then extended for data center networks through the use of a multi-rooted Meshed Tree. By explicitly designing an algorithm that accounts for the dynamic nature of modern networks, MTPs can significantly reduce latency, control overhead, and data loss during recovery. Three solutions implementing Meshed Trees are presented in this dissertation: 1. The Meshed Tree Algorithm (MTA): A distributed algorithm that stores and ranks path-vectors at every node to determine their preferred and backup paths. These path-vectors are used to build both the shortest-path tree and alternative trees to be used in the event of a failure. An analysis of MTA is presented and then compared to Dijkstra’s algorithm and the IEEE Spanning Tree algorithm to prove its proactive approach allows for an efficient reconvergence system. 2. Meshed Tree Protocol for Switched Networks (MTP-SW): A protocol enhancing network-wide resiliency in switched Ethernet environments by introducing a Meshed Tree. MTP-SW extends prior evaluations against the Rapid Spanning Tree Protocol (RSTP) to examine root node failures and to demonstrate how a decoupled forwarding system for unicast traffic enables efficient path reconstruction. 3. Meshed Tree Protocol for Data Center Networks (MTP-DCN): A protocol integrating the Meshed Tree system into folded-Clos topologies. By designing a control protocol around recurring topological patterns, MTP-DCN achieves a marked reduction in operational complexity. Its performance is evaluated against the Border Gateway Protocol (BGP), which is regularly used in DCNs, to demonstrate improvements in reconvergence time, packet loss, and control overhead. These contributions demonstrate that by rethinking how routing and forwarding are approached in structured network topologies, it is possible to achieve faster recovery, reduced control overhead, and improved overall resiliency.

Publication Date

11-25-2025

Document Type

Dissertation

Student Type

Graduate

Degree Name

Computing and Information Sciences (Ph.D.)

Department, Program, or Center

Computing and Information Sciences Ph.D, Department of

College

Golisano College of Computing and Information Sciences

Advisor

Nirmala Shenoy

Advisor/Committee Member

Mohan Kumar

Advisor/Committee Member

John Hamilton

Campus

RIT – Main Campus

Download

Share

COinS