ROUTING OF MULTIPOINT CONNECTIONS

被引：1721

作者：

WAXMAN, BM

机构：

来源：

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | 1988年 / 6卷 / 09期

关键词：

D O I：

10.1109/49.12889

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：1617 / 1622

页数：6

共 16 条

[1] ROUTING TO MULTIPLE DESTINATIONS IN COMPUTER-NETWORKS [J].

BHARATHKUMAR, K ;

JAFFE, JM .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (03) :343-351

[2]

Coxeter H. S. M., 1961, INTRO GEOMETRY

[3]

DREYFUS SE, 1971, NETWORKS, V1, P195

[4] STEINER MINIMAL TREES [J].

GILBERT, EN ;

POLLAK, HO .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1968, 16 (01) :1-&

[5] RANDOM GRAPHS [J].

GILBERT, EN .

ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (04) :1141-1144

[6] DISTRIBUTED MULTI-DESTINATION ROUTING - THE CONSTRAINTS OF LOCAL INFORMATION [J].

JAFFE, JM .

SIAM JOURNAL ON COMPUTING, 1985, 14 (04) :875-888

[7] A FAST ALGORITHM FOR STEINER TREES [J].

KOU, L ;

MARKOWSKY, G ;

BERMAN, L .

ACTA INFORMATICA, 1981, 15 (02) :141-145

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

MCQUILLAN, JM ;

RICHER, I ;

ROSEN, EC .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1980, 28 (05) :711-719

[9]

MEHLHORN H, 1988, INFORM PROCESS LETT, V27, P125

[10]

MILLER RE, 1972, COMPLEXITY COMPUTER, P85

← 1 2 →