Name
Abstract | ||
|---|---|---|
The degree to which rearrangement reduces blocking, and its cost in time and complexity, depend on the algorithm used. Here we apply two algorithms to a range of time-space-time networks and compare the results obtained with those produced by Akiyama. We note that in one of these algorithms some states can occur which make effective rearrangement impossible, a condition which does not have a parallel in space division networks. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1109/TCOM.1983.1095816 | Communications, IEEE Transactions |
Keywords | DocType | Volume |
Space-division switching,Time-division switching | Journal | 31 |
Issue | ISSN | Citations |
3 | 0090-6778 | 1 |
PageRank | References | Authors |
0.39 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steit, H.A. | 1 | 1 | 0.39 |
| Smith, D. | 2 | 1 | 0.39 |