Hypercube sandwich approach to conferencing

Journal of Supercomputing

Volumn 10, Issue 3, 1996, Pages 271-283

  Houlahan, Joanne F ^a   Cowen, Lenore J ^a   Masson, Gerald M ^a  

^a Johns Hopkins University   (United States)

Author keywords

Conference; Dynamic networks; Hypercube; Nonblocking

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DIGITAL SIGNAL PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS;

BIDIRECTIONAL PERMUTATION NETWORK; CASCADED CONFERENCE NETWORK; HYPERCUBE SANDWICH NETWORK (HSN); WIDE SENSE NONBLOCKING CONFERENCING;

INTERCONNECTION NETWORKS;

EID: 0030233059     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00130110     Document Type: Conference Paper

References (20)

1. H. L. Abbott and M. Katchalski. On the snake in the box problem. Journal of Combinatorial Theory, Series B, 45: 13-24, 1988.
2. R. Ahlswede and K.U. Koschnick. Note on an extremal problem arising for unreliable networks in parallel computing. Discrete Mathematics, 47: 137-152, 1983.
3. B. Becker and H.-U. Simon. How robust is the n-cube? Information and Computation, 77: 162-178, 1988.
4. V.E. Beneš. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.
5. J. Bruck, R. Cypher, and D. Soroker. Tolerating faults in hypercubes using subcube partitioning. IEEE Transactions on Computers, 41(5): 599-605, 1992.
6. D.G. Cantor. On non-blocking switching networks. Networks, 1: 367-377, 1972.
7. P. Feldman, J. Friedman, and N. Pippenger. Wide-sense nonblocking networks. SIAM Journal of Discrete Mathematics, 1(2): 158-173, 1988.
8. J.F. Houlahan, L.J. Cowen, and G.M. Masson. Hypercube sandwich approach to conferencing. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications '95, pp. 481-490, 1995.
9. J. F. Houlahan. Sandwich networks for conferencing. Ph.D. Thesis. Johns Hopkins University, Department of Computer Science, 1996.
10. F.K. Hwang. Rearrangeability of multi-connection three-stage Clos networks. Networks, 2: 301-306, 1972.
11. F.K. Hwang. Three-stage multiconnection networks which are nonblocking in the wide sense. Bell System Technical Journal, 58(10): 2183-2187, 1979.
12. F.K. Hwang and A. Jajszczyk. On nonblocking multiconnection networks. IEEE Transactions on Communications, COM-34(10): 1038-1041, 1986.
13. A. Jajszczyk. Comments on "Three-stage multiconnection networks which are nonblocking in the wide sense." Bell System Technical Journal, 62: 2113-2114, 1983.
14. D.J. Kleitman. On a problem of Yuzvinsky on separating the n-cube. Discrete Mathematics, 60: 207-213, 1986.
15. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufman, 1992.
16. J.S. Turner. Practical wide-sense non-blocking generalized connectors. Washington University Technical Report WUCS-88-29, 1988.
17. J. Wojciechowski. A new lower bound for snake-in-the-box codes. Combinatorica, 9(1): 91-99, 1989.
18. D.R. Woodall. The Bay Restaurant - A linear storage problem. American Math. Monthly: 240-246, March 1974.
19. Y. Yang and G.M. Masson. Rearrangeable broadcast ring sandwich networks. IEEE Transactions on Computers, 44 (10): 1169-1180, 1995.
20. E. W. Zegura. Analysis of switching networks for multiport and multivariate communication. Ph.D. Thesis, Washington University, 1993.