ROUTING IN MULTIHOP PACKET-SWITCHING NETWORKS - GB/S CHALLENGE

被引:43
作者
BARANSEL, C
DOBOSIEWICZ, W
GBURZYNSKI, P
机构
[1] MONMOUTH UNIV, DEPT COMP SCI, LONG BEACH, NJ USA
[2] UNIV ALBERTA, DEPT COMP SCI, EDMONTON, AB, CANADA
来源
IEEE NETWORK | 1995年 / 9卷 / 03期
关键词
D O I
10.1109/65.386051
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The authors survey networking solutions that have been proposed for high-speed packet-switched applications. Using these solutions as examples, they identify the specific problems resulting from very high transmission rates and explain how these problems influence the design of high-speed networks and protocols. They conclude that the solutions based on deflection routing are the most promising ones and suggest a number of directions for their evolution.
引用
收藏
页码:38 / 61
页数:24
相关论文
共 92 条
[1]   MULTIHOP LIGHTWAVE NETWORKS - A COMPARISON OF STORE-AND-FORWARD AND HOT-POTATO ROUTING [J].
ACAMPORA, AS ;
SHAH, SIA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (06) :1082-1090
[2]   TERABIT LIGHTWAVE NETWORKS - THE MULTIHOP APPROACH [J].
ACAMPORA, AS ;
KAROL, MJ ;
HLUCHYJ, MG .
AT&T TECHNICAL JOURNAL, 1987, 66 (06) :21-34
[3]  
ADBY PR, 1974, INTRO OPTIMIZATION M
[4]  
[Anonymous], 1992, DATA NETWORKS
[5]  
[Anonymous], 1988, UNDERGRADUATE TEXTS
[6]   AN OPTIMAL SHORTEST-PATH ROUTING POLICY FOR NETWORK COMPUTERS WITH REGULAR MESH-CONNECTED TOPOLOGIES [J].
BADR, HG ;
PODAR, S .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (10) :1362-1371
[7]  
BAER JL, 1980, COMPUTER SYSTEMS ARC
[8]  
Bertsekas D., 1987, DATA NETWORKS
[9]   ON THE IMPOSSIBILITY OF DIRECTED MOORE GRAPHS [J].
BRIDGES, WG ;
TOUEG, S .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 29 (03) :339-341
[10]   METARING - A FULL-DUPLEX RING WITH FAIRNESS AND SPATIAL REUSE [J].
CIDON, I ;
OFEK, Y .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (01) :110-120