AN OPTIMAL SHORTEST-PATH ROUTING POLICY FOR NETWORK COMPUTERS WITH REGULAR MESH-CONNECTED TOPOLOGIES

被引：44

作者：

BADR, HG

PODAR, S

机构：

[1] US W ADV TECHNOL,ENGLEWOOD,CO 80111

[2] SUNY STONY BROOK,DEPT COMP SCI,STONY BROOK,NY 11794

来源：

关键词：

D O I：

10.1109/12.35831

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：1362 / 1371

页数：10

共 22 条

[1]

AGERWALA T, 1978, P INT C PARALLEL PRO

[2]

ARANGO M, 1985, IEEE T COMPUT, V34, P174, DOI 10.1109/TC.1985.1676555

[3]

ARANGO M, 1983, MAR P ACM S COMM ARC, P94

[4]

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

[5] AN ADAPTIVE COMMUNICATIONS PROTOCOL FOR NETWORK COMPUTERS [J].

BADR, HG ;

GELERNTER, D ;

PODAR, S .

[6]

BHUYAN LN, 1984, IEEE T COMPUT, V33, P323, DOI 10.1109/TC.1984.1676437

[7]

DOTY KW, 1984, IEEE T COMPUT, V33, P447, DOI 10.1109/TC.1984.1676461

[8]

Dreyfus S. E., 1977, ART THEORY DYNAMIC P

GARCIAMOLINA, H .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1983, 8 (02) :186-213

[10]

HILLIS D, 1985, CONNECTION MACHINE