Global internet function can be improved by deploying nodes at specific locations in a network, so that a virtual network can be formed. This virtual network, termed an overlay network, works well without completely changing the architecture of the system. Complexity theory is employed to perform this task by approaching the minimal deployment of relay nodes as a non-deterministic polynomial-time hard problem. The current project presents an algorithm based on complexity theory, used to overcome challenges in ineffective routing such as the convergence time of the Border Gateway Protocol, Transmission Control Protocol throughput, and service quality of the Voice over Internet Protocol. A Java-based graphical user interface developed for this project is used to assess the effectiveness and efficiency of the algorithm.
|Commitee:||Khoo, I-Hung, Yeh, Hen-Geul|
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 56/04M(E), Masters Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be