Dynamic State Determination of a Software-Defined Network via Dual Basis Representation
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Fu Chen-Hua (Monterey, California: Naval Postgraduate School, 1993-03);Efficient performance and high throughput are the major goals of the network performance management. How can we achieve these goal? First, it is necessary to know the network traffic situations. This thesis research ...
Naval Postgraduate School Center for Homeland Defense and Security (CHDS) (Monterey, California. Naval Postgraduate SchoolCenter for Homeland Defense and Security, 2006-07);July 2006. The July 2006 issue of Homeland Security Affairs offers articles about risk perception, domestic right wing extremist groups, social network analysis, and the impact of foreign policy on homeland security. It ...
Warnke, Scott D. (Monterey, California: Naval Postgraduate School, 2016-06);Identifying communities in a dark network is a potentially difficult task. The nature of dark networks, and their characteristic of con-cealing connections within the network, makes community detection an enterprise based ...