A TRADE-OFF BETWEEN SPACE AND EFFICIENCY FOR ROUTING TABLES

被引：220

作者：

PELEG, D

UPFAL, E

机构：

[1] IBM CORP,ALMADEN RES CTR,SAN JOSE,CA 95120

[2] WEIZMANN INST SCI,IL-76100 REHOVOT,ISRAEL

来源：

JOURNAL OF THE ACM | 1989年 / 36卷 / 03期

关键词：

D O I：

10.1145/65950.65953

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：510 / 530

页数：21

共 21 条

[11] DESIGNING NETWORKS WITH COMPACT ROUTING TABLES [J].

FREDERICKSON, GN ;

JANARDAN, R .

ALGORITHMICA, 1988, 3 (01) :171-190

[12] OPTIMAL CLUSTERING STRUCTURES FOR HIERARCHICAL TOPOLOGICAL DESIGN OF LARGE COMPUTER-NETWORKS [J].

KLEINROCK, L ;

KAMOUN, F .

NETWORKS, 1980, 10 (03) :221-248

[13]

Kleinrock L., 1977, Computer Networks, V1, P155, DOI 10.1016/0376-5075(77)90002-2

[14] GRAPH SPANNERS [J].

PELEG, D ;

SCHAFFER, AA .

JOURNAL OF GRAPH THEORY, 1989, 13 (01) :99-116

[15]

PELEG D, 1987, RJ5768 IBM RES REP

[16]

PELEG D, IN PRESS SIAM J COMP

[17]

PERLMAN R, 1982, 5TH P C SYST SCI

[18] LABELING AND IMPLICIT ROUTING IN NETWORKS [J].

SANTORO, N ;

KHATIB, R .

COMPUTER JOURNAL, 1985, 28 (01) :5-8

[19]

SUNSHINE CA, 1982, P IEEE INFOCOM 82 LA

[20] INTERVAL ROUTING [J].

VANLEEUWEN, J ;

TAN, RB .

COMPUTER JOURNAL, 1987, 30 (04) :298-307

← 1 2 3 →