Skip to main content
SpringerLink
Log in

On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Hwang and Lin introduced a new nonblocking requirement for 2-cast traffic which imposes different requirements on different types of coexisting calls. The requirement is strictly nonblocking for point-to-point calls among the 2-cast traffic, and is rearrangeable for genuine 2-cast calls. They conjectured that the 3-stage Clos network C(n,n,r,r,2n) satisfies the above requirement. We prove that C(n,n,4,r,2n) satisfies the above requirement.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • C. Clos, “A study of nonblocking switching networks,” Bell Syst. Tech. J., vol. 32, pp. 406–424, 1953.

    Google Scholar 

  • D.Z. Du, D.F. Hsu, and F.K. Hwang, “The hamiltonian property of consecutive-d digraphs,” Mathl. Comput. Modelling, vol. 17, pp. 61–63, 1993.

    Google Scholar 

  • D.Z. Du and H.Q. Ngo, “An extension of DHH-Erdös conjecture on cycle-plus-triangle graphs,” Taiwan J. Math. vol. 6, pp. 65–105, 2002.

    Google Scholar 

  • H. Fleischner and M. Stiebitz, “A solution to a coloring problem of P. Erdös,” Disc. Math., vol. 101, pp. 39–48, 1992.

    Google Scholar 

  • P. Hall, “On representatives of subsets,” J. London Math. Soc., vol. 10, pp. 26–30, 1935.

    Google Scholar 

  • F.K. Hwang, S.-C. Liaw, and L.D. Tong, “Strictly nonbolcking 3-stage Clos networks with some rearrangeable multicast capability,” IEEE Trans. Commun., vol. 6, pp. 261–267, 2002.

    Google Scholar 

  • F.K. Hwang and C.H. Lin, “Broadcasting in a three-stage point-to-point nonblocking network,” Inter. J. Rel. Qual. Safety Eng., vol. 2, pp. 299–307, 1995.

    Google Scholar 

  • D.G. Kirkpatrick, M. Klawe, and N. Pippenger, “Some graph-coloring theorems with applications to generalized connection networks,” SIAM J. Alg. Disc. Methods, vol. 6, pp. 576–582, 1955.

    Google Scholar 

  • G.M. Masson and B.W. Jordan, “Generalized multi-stage connection networks,” Networks, vol. 2, pp. 191–209, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Chiao Tung University, Hsin Chu, Taiwan, R.O.C.

    Hung-Lin Fu & Frank K. Hwang

Authors
  1. Hung-Lin Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank K. Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hung-Lin Fu.

Additional information

Supported in part by NSC91-2115-M009-002.

Supported in part by the National Science Council under grant NSC91-2115-M009-010 and by the Li-Li-Tai-Yang Network Research Center of National Chiao Tung University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, HL., Hwang, F.K. On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. J Comb Optim 9, 263–266 (2005). https://doi.org/10.1007/s10878-005-1410-y

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-1410-y

Keywords

Search

Navigation