Back to search

NJIT

Feedback algorithm for switch location : analysis of complexity and application to network design

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science - (M.S.)
Discipline thesis:degree_discipline
Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Polyakov, Yuriy S.
Contributors dc:contributor
  • Boris S. Verkhovsky
  • James M. Calvin
  • James A. McHugh

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/629

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Polyakov, Yuriy S.. Feedback algorithm for switch location : analysis of complexity and application to network design. https://digitalcommons.njit.edu/theses/629