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

Hung-Lin Fu () and Frank K. Hwang
Additional contact information
Hung-Lin Fu: National Chiao Tung University
Frank K. Hwang: National Chiao Tung University

Journal of Combinatorial Optimization, 2005, vol. 9, issue 3, No 2, 263-266

Abstract: 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.

Keywords: 3-stage Clos networks; nonblocking networks; rearrangeable networks (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-1410-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:9:y:2005:i:3:d:10.1007_s10878-005-1410-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-1410-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().