AN ADAPTIVE LINK ASSIGNMENT ALGORITHM FOR DYNAMICALLY CHANGING TOPOLOGIES

被引：30

作者：

NOAKES, MD

CAIN, JB

NIETO, JW

ALTHOUSE, EL

机构：

[1] HARRIS CORP,DEPT ADV TECHNOL,MELBOURNE,FL 32901

[2] SIGMA XI,RES TRIANGLE PK,NC

[3] USN,RES LAB,DIV INFORMAT TECHNOL,COMMUN SYST BRANCH,WASHINGTON,DC 20375

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1993年 / 41卷 / 05期

关键词：

D O I：

10.1109/26.225485

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper presents an adaptive link assignment algorithm for the distributed optimization of dynamically changing network topologies. 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, we are utilizing some known graph-theoretic algorithms.

引用

页码：694 / 706

页数：13

共 11 条

[1]

BERKSEKAS D, 1987, DATA NETWORKS

[2]

CAIN JB, 1987, OCT MILCOM 87 C REC

[3]

CAIN JB, UNPUB IEEE T COMMUN

[4]

Dijkstra E.W., 1959, NUMER MATH, V1, P269, DOI [DOI 10.1007/BF01386390, 10.1007/BF01386390]

[5]

EVEN S, 1979, GRAPH ALGORITHMS

[6]

Feller W., 1950, INTRO PROBABILITY TH

[7]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P135, DOI 10.1137/0202012

[8]

Lin S., 1983, ERROR CONTROL CODING

[9] THE NEW ROUTING ALGORITHM FOR THE ARPANET [J].

MCQUILLAN, JM ;

RICHER, I ;

ROSEN, EC .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1980, 28 (05) :711-719

[10]

TANENBAUM AS, 1981, COMPUTER NETWORKS

← 1 2 →