Traffic Congestion Analysis for a Software-Defined Network
Abstract
The objective of this thesis is to implement an anomaly-detection method that can be used to detect congestion in a software-defined network. The method incorporates spectral graph theory and phantom node techniques. The experimental implementation of spectral graph theory used eigenvalue-eigenvector solutions to characterize a mathematical model of the networks topology. In this thesis, we used the phantom node technique to determine congestion in the network by using a virtual node to set the threshold for available link capacity, or the maximum amount of traffic, that can cross the links in the network before the links are considered congested. Results show that when the network is congested, a shift occurs in the eigenvalue and eigenvalue index spectrum.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 2018
- Accession Number
- AD1052780
Entities
People
- Moniqua J. Maxie
Organizations
- Naval Postgraduate School