Advisor Information
Thom Davis
Presentation Type
Oral Presentation
Start Date
26-3-2021 12:00 AM
End Date
26-3-2021 12:00 AM
Abstract
Communication networks tend to contain redundant devices and mediums of transmission, thus the need to locate, document, and optimize networks is increasingly becoming necessary. However, many people do not know where to start the optimization progress. What is network topology? What is this “Shortest Path Problem”, and how can it be used to better my network? These questions are presented, taught, and answered within this paper. To supplement the reader’s understanding there are thirty-eight figures in the paper that are used to help convey and compartmentalize the learning process needed to grasp the materials presented in the ending sections.
In the respect of the audience, the information covered in this paper is intended for a lay person. There is no needed background, aside from an unrelenting will to learn, to understand the information and topics presented in this paper. As of Fall 2020, this paper is up-to-date with the fundamentals of the latest trends in IT Innovation, and is a simple search engine result away for the specific side problems that happen to pop into your mind while reading.
This paper will start by teaching the fundamentals of network infrastructure by introducing the physical devices that are contained in a network, then introducing the structure and terminology of the network topologies themselves, and then finally introduce Shortest Path Problems via Graph Theory to then be applied to network topologies. While a reader can use this paper to directly solve a specific networking issue they happen to have in their respected environment, the topics and problems covered in the later sections of the paper will introduce different perspectives and ideas about optimizing networks outside the scope of traditional approaches.
Files over 3MB may be slow to open. For best results, right-click and select "save as..."
Included in
Discrete Mathematics and Combinatorics Commons, OS and Networks Commons, Other Computer Sciences Commons, Other Mathematics Commons, Set Theory Commons, Theory and Algorithms Commons
Optimizing Networking Topologies with Shortest Path Algorithms
Communication networks tend to contain redundant devices and mediums of transmission, thus the need to locate, document, and optimize networks is increasingly becoming necessary. However, many people do not know where to start the optimization progress. What is network topology? What is this “Shortest Path Problem”, and how can it be used to better my network? These questions are presented, taught, and answered within this paper. To supplement the reader’s understanding there are thirty-eight figures in the paper that are used to help convey and compartmentalize the learning process needed to grasp the materials presented in the ending sections.
In the respect of the audience, the information covered in this paper is intended for a lay person. There is no needed background, aside from an unrelenting will to learn, to understand the information and topics presented in this paper. As of Fall 2020, this paper is up-to-date with the fundamentals of the latest trends in IT Innovation, and is a simple search engine result away for the specific side problems that happen to pop into your mind while reading.
This paper will start by teaching the fundamentals of network infrastructure by introducing the physical devices that are contained in a network, then introducing the structure and terminology of the network topologies themselves, and then finally introduce Shortest Path Problems via Graph Theory to then be applied to network topologies. While a reader can use this paper to directly solve a specific networking issue they happen to have in their respected environment, the topics and problems covered in the later sections of the paper will introduce different perspectives and ideas about optimizing networks outside the scope of traditional approaches.