Document Type
Thesis
Date of Award
Spring 5-31-2003
Degree Name
Master of Science in Computer Science - (M.S.)
Department
Computer Science
First Advisor
Boris S. Verkhovsky
Second Advisor
James M. Calvin
Third Advisor
James A. McHugh
Abstract
An accelerated feedback algorithm to solve the single-facility minisum problem is studied with application to designing networks with the star topology. The algorithm, in which the acceleration with respect to the Weiszfeld procedure is achieved by multiplying the current Weiszfeld iterate by an accelerating feedback factor, is shown to converge faster than the accelerating procedures available in the literature. Singularities encountered in the algorithm are discussed in detail. A simple practical exception handling subroutine is developed. Several applications of the algorithm to designing computer networks with the star topology are demonstrated. Applications of the algorithm as a subroutine for multi-switch location problems are considered. Various engineering aspects involved in acquiring and processing coordinates for geographic locations are discussed. A complete algorithm in pseudocode along with the source code listing in Mathematica 4.1 is presented.
Recommended Citation
Polyakov, Yuriy S., "Feedback algorithm for switch location : analysis of complexity and application to network design" (2003). Theses. 629.
https://digitalcommons.njit.edu/theses/629
