CONCENTRATORS, SUPERCONCENTRATORS, GENERALIZERS, AND NONBLOCKING NETWORKS

被引：49

作者：

CHUNG, FRK

机构：

来源：

BELL SYSTEM TECHNICAL JOURNAL | 1979年 / 58卷 / 08期

关键词：

D O I：

10.1002/j.1538-7305.1979.tb02972.x

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, we study various communication networks, such as concentrators, superconcentrators, generalizers, and rearrangeable and nonblocking networks. We improve bounds for the number of edges (which can be viewed as approximations of the cost) in some networks by combinatorial analysis. © 1979 The Bell System Technical Journal

引用

页码：1765 / 1777

页数：13

共 11 条

[1]

ASH RB, 1965, INFORMATION THEORY, P113

[2]

Bassalygo L. A., 1973, PROBLEMS INFORMATION, V9, p[84, 64]

[3] OPTIMAL REARRANGEABLE GRAPHS [J].

CHUNG, FRK .

BELL SYSTEM TECHNICAL JOURNAL, 1975, 54 (09) :1647-1661

[4]

Hall P., 1935, J LONDON MATH SOC, V1, P26, DOI DOI 10.1112/JLMS/S1-10.37.26

[5]

Margulis G. A., 1973, Problems of Information Transmission, V9, P325

[6]

PINSKER MS, 1973, 7TH P INT TEL C STOC

[7] GENERALIZED CONNECTORS [J].

PIPPENGER, N .

SIAM JOURNAL ON COMPUTING, 1978, 7 (04) :510-514

[8]

Pippenger N., 1977, SIAM Journal on Computing, V6, P298, DOI 10.1137/0206022

[9]

PIPPENGER N, UNPUBLISHED

[10]

RYSER HJ, 1963, 14 NEW YORK MATH ASS

← 1 2 →