Name
Abstract | ||
|---|---|---|
Partial concentrators have been shown to be useful in the construction of various types of interconnecting networks. It is shown how a large class of combinatorial designs, which are well studied in the literature, can be used to construct partial concentrators and thus provide a direct link between the fields of combinatorial designs and switching networks. A construction efficiency factor called the cost ratio is introduced, and some lower bounds on the capacity of partial concentrators having certain characteristics are established. It is shown how to use various combinatorial designs to construct partial concentrators having these same characteristics and corresponding capacities |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/26.87219 | Communications, IEEE Transactions |
Keywords | Field | DocType |
combinatorial switching,switching networks,capacity,combinatorial designs,construction efficiency factor,cost ratio,interconnecting networks,lower bounds,partial concentrators,switching networks | Topology,Combinatorics,Computer science,Upper and lower bounds,Bipartite graph,Electronic engineering,Combinatorial design,Efficiency factor | Journal |
Volume | Issue | ISSN |
39 | 7 | 0090-6778 |
Citations | PageRank | References |
2 | 0.55 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. K. Hwang | 1 | 332 | 100.54 |
| Richards, G.W. | 2 | 2 | 0.55 |