Off-campus UMass Amherst users: To download campus access dissertations, please use the following link to log into our proxy server with your UMass Amherst user name and password.

Non-UMass Amherst users: Please talk to your librarian about requesting this dissertation through interlibrary loan.

Dissertations that have an embargo placed on them will not be available to anyone until the embargo expires.

ORCID

https://orcid.org/0000-0002-7890-9711

Access Type

Open Access Thesis

Document Type

thesis

Degree Program

Electrical & Computer Engineering

Degree Type

Master of Science in Electrical and Computer Engineering (M.S.E.C.E.)

Year Degree Awarded

2021

Month Degree Awarded

February

Abstract

Network configurations are typically done by manually setting up the configuration files. Such manual configuration requires the network operators to be able to deal with low-level protocol-specific parameters as well as have a big picture of the network in mind. Thus, network configuration is prone to error. What makes things worse is that the network is a dynamic system where there are link failures/additions and routing announcements from outside the network. The growth of the network size and the huge number of routing events make it hard to predict the effect of the configuration.

In this thesis, we proposed a graph-algorithm-based approach to verify the network configuration robustness. In addition to verifying properties for one network snapshot, our approach can also verify these properties under intra-domain and inter-domain routing events efficiently. We implement the proposed approach and evaluate under both synthe- sized and real network configurations. The experiment results show that our approach can achieve at least 100x speedup over the existing approaches when verifying properties under routing events and scale to large networks with thousands of nodes.

DOI

https://doi.org/10.7275/20020360

First Advisor

Lixin Gao

Second Advisor

Daniel Holcomb

Third Advisor

Tongping Liu

Download
COinS