LABELING AND IMPLICIT ROUTING IN NETWORKS

被引：182

作者：

SANTORO, N ^{[1
]}

KHATIB, R ^{[1
]}

机构：

[1] UNIV OTTAWA,DEPT INFORMAT,OTTAWA K1N 5B4,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1093/comjnl/28.1.5

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：5 / 8

页数：4

共 9 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

ARDEN BW, 1981, IEEE T COMPUT, V30, P291

[3] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].

GALLAGER, RG ;

HUMBLET, PA ;

SPIRA, PM .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77

[4]

HAGONEL J, 1983, 3RD P INT C DISTR CO, P755

KORACH, E ;

ROTEM, D ;

SANTORO, N .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1984, 6 (03) :380-401

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

MCQUILLAN, JM ;

RICHER, I ;

ROSEN, EC .

[7]

TANENBAUM AS, 1982, COMPUTER NETWORKS

[8]

Thomas R. H., 1979, ACM Transactions on Database Systems, V4, P180, DOI 10.1145/320071.320076

[9]

WITTIE LD, 1981, IEEE T COMPUT, V30, P264