SOME COMPLEXITY RESULTS IN THE DESIGN OF DEADLOCK-FREE PACKET SWITCHING-NETWORKS

被引：15

作者：

TOUEG, S ^{[1
]}

STEIGLITZ, K ^{[1
]}

机构：

[1] PRINCETON UNIV,DEPT ELECT ENGN & COMP SCI,PRINCETON,NJ 08544

来源：

关键词：

D O I：

10.1137/0210053

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：702 / 712

页数：11

共 11 条

[1]

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

AHUJA, V .

[3]

DAVIS DW, 1973, IEEE T COMMUN, V20, P546

[4]

GIESSLER A, 1978, COMPUTER NETWORKS, V2, P191

[5]

GUNTHER KD, IFIP IIASA WORKSHOP, pG15

[6]

Kleinrock L., 1976, QUEUEING SYSTEMS

[7] SOME COMMENTS ON SIMULATED DATAGRAM STORE-AND-FORWARD NETWORKS [J].

PRICE, WL ;

HAENLE, JD .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1978, 2 (01) :70-73

[8]

PRICE WL, 1974, AUG P IFIP C, P151

[9]

RAUBOLD E, 1976, AUG P ICCC 76 TOR ON, P483

[10]

TOUEG S, 1979, 11TH P ACM S THEOR C, P89