Dynamic State Determination of a Software-Defined Network via Dual Basis Representation
Loading...
Authors
Parker, Thomas
Johnson, Jamie
Tummala, Murali
McEachen, John
Scrofani, James
Subjects
Software-defined network
Laplacian matrix
algebraic connectivity
spectral graph theory
control theory
Laplacian matrix
algebraic connectivity
spectral graph theory
control theory
Advisors
Date of Issue
2014
Date
Publisher
Language
Abstract
To maximize the performance of a softwaredefined
network, a network observer must develop a state that
can be tracked and controlled. We propose a novel method that
uses the entire eigenspace of the Laplacian matrix to determine
the state of a SDN. Our approach exploits the double
orthogonality of the Laplacian matrix in order to define the dual
basis. Each basis uses the entire reachability space with the
objective of fully describing the centrality of each node over time.
The reachability space is defined by the dual basis once the null
space has been removed. The definition of the dual basis allows
the network controller to observe the network state to determine
which areas are most utilized and least utilized. Once the state
has been estimated, the controller may choose to correct the
network state by rerouting flows or preventing additional flows.
Type
Article
Description
Series/Report No
Department
Electrical and Computer Engineering
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.