An adaptive link assignment algorithm for dynamically changing topologies

Author

Noakes, Michael D. ; Cain, J. Bibb ; Nieto, John W. ; Althouse, Edwin L.

Author_Institution

Harris Corp., Melbourne, FL, USA

Volume

41

Issue

5

fYear

1993

fDate

5/1/1993 12:00:00 AM

Firstpage

694

Lastpage

706

Abstract

An adaptive link assignment algorithm for the distributed optimization of dynamically changing network topologies is presented. The algorithm is responsible for determining the network connectivity by controlling the selection of links to be established and disconnected. This algorithm is designed to recover from predictable link outages as well as massive unpredictable failures. To minimize computational time complexity as well as to improve transient response. Some known graph-theoretic algorithms are utilized

Keywords

graph theory; network topology; optimisation; telecommunication links; adaptive link assignment algorithm; adaptive routing algorithm; computational time complexity; distributed optimization; dynamically changing network topologies; graph-theoretic algorithms; link outages; massive unpredictable failures; network connectivity; transient response; Algorithm design and analysis; Delay; Helium; Heuristic algorithms; Laboratories; Military communication; Military satellites; Network topology; Robustness; Scheduling;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.225485

Filename

225485