An Abstract Model for Optical Interconnection Networks

  • Si Qing Zheng
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 468)


We present an abstract model, the hypernetwork model, for optical interconnection networks. A hypernetwork is a network that connects a large number of processors using multiple multiconnect components. Hypernetwork topology design can be formulated as a constrained optimization problem. Using several examples, we show how to use concepts and existing results in hypergraph theory and combinatorial block design theory to construct hypernetworks.


Parallel Computing Abstract Model Interconnection Network Direct Network Spatial Light Modulator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Akers, D. Harel, and B. Krishnamurthy. The star graph: an attractive alternative to the n-cube. Proceedings of 1987 International Conference on Parallel Processing, 393–400, 1987.Google Scholar
  2. [2]
    B.W. Arden, and H. Lee. Analysis of chordal ring network. IEEE Transactions on Computers, 30:291–295, 1981.Google Scholar
  3. [3]
    C. Berge. Hypergraphs. North-Holland, 1989.Google Scholar
  4. [4]
    P. E. Green, Jr. Fiber Optical Networks. Prentice Hall, 1993.Google Scholar
  5. [5]
    H. Hanani. The existence and construction of balanced incomplete block designs, Ann. Math. Statist., 32:361–386, 1961.Google Scholar
  6. [6]
    H. Hanani. On balanced incomplete block designs with blocks having five elements, Journal of Combinatorial Theory 12A:184–201, 1972.Google Scholar
  7. [7]
    J. Jahns and S. H. Lee. Optical Computing Hardware. Academic Press, 1994.Google Scholar
  8. [8]
    F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes. Morgan Kaufmann Publishers, 1992.Google Scholar
  9. [9]
    Y. Li, J. Wu and S. Q. Zheng. An optical interconnection structure based on the dual of a hypercube. To appear in Informatica.Google Scholar
  10. [10]
    C. C. Lindner. A survey of embedding theorems for Steiner systems. Topics on Steiner Systems, edited by C. C. Lindner and A. Rosa, North-Holland, 1980.Google Scholar
  11. [11]
    C.C Lindner and A. Rosa (editors). Topics on Steiner Systems. North-Holland, 1980.Google Scholar
  12. [12]
    O. M. Dighe, R. Vaidyanathan and S. Q. Zheng. The bus-connected ringed tree: a versatile interconnection network. Journal of Parallel and Distributed Computing, 33:189–196, 1996.CrossRefGoogle Scholar
  13. [13]
    D. K. Ray-Chaudhui and R. M. Wilson, Solution of Kirkman’s School-girl Problem, Proc. Symp. Pure Math. 19, 1971.Google Scholar
  14. [14]
    C. Tocci and H. J. Caulfield (editors). Optical Interconnection: Foundations and Applications. Artech House, 1994.Google Scholar
  15. [15]
    W. D. Wallis. Combinatorial Designs. Marcel Dekker, 1988.Google Scholar
  16. [16]
    R. M. Wilson. An existence theory for pairwise balanced designs III. Proof of the existence conjectures. Journal of Combinatorial Theory, 18A:71–79, 1975.Google Scholar
  17. [17]
    S. Q. Zheng. Hypernetworks — a class of interconnection networks with increased wire sharing: Part I–Part IV. Technical Report, #94-008, Department of Compute Science, Louisiana State University, Baton Rouge, LA 70803, 1994.Google Scholar
  18. [18]
    S. Q. Zheng. Hypernetworks: a class of interconnection networks for new parallel computers. Proceedings of 8th ISCA International Conference on Parallel and Distributed Computing Systems, 189–194, 1995.Google Scholar
  19. [19]
    S. Q. Zheng. Hypercube hypernetworks: implementations of hypercube with increased wire sharing. Proceedings of 8th ISCA International Conference on Parallel and Distributed Computing Systems, 452–457, 1995.Google Scholar
  20. [20]
    S. Q. Zheng. Sparse hypernetworks based on Steiner triple systems. Proceedings of 1995 International Conference on Parallel Processing (ICPP), I:92–95, 1995.Google Scholar
  21. [21]
    S. Q. Zheng and J. Wu. Dual of a complete graph as an interconnection network. Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP), 433–442, 1996.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Si Qing Zheng
    • 1
  1. 1.Department of Computer Science Erik Jonsson School of Engineering and Computer ScienceUniversity of Texas at DallasRichardson

Personalised recommendations