Search
Abstract
In this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially solvable instances as well as a number of NP-complete cases. Our results warn of possible troubles arising in the control of Clos networks even if they are composed of small-size switches in outer stages. This is in sharp contrast to classical unicast Clos networks for which all the control problems are polynomially solvable.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (3)
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1515/bpasts-2015-0085
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
Bulletin of the Polish Academy of Sciences-Technical Sciences
no. 63,
pages 739 - 744,
ISSN: 0239-7528 - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Obszarski P., Jastrzębski A., Kubale M.: Towards the boundary between easy and hard control problems in multicast Clos networks// Bulletin of the Polish Academy of Sciences-Technical Sciences. -Vol. 63, iss. 3 (2015), s.739-744
- DOI:
- Digital Object Identifier (open in new tab) 10.1515/bpasts-2015-0085
- Verified by:
- Gdańsk University of Technology
seen 146 times