Search
Abstract
In 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects. We also recognize the complexity status for a related routing problem. In our considerations we introduce the hypergraph edge coloring model, which is a suitable mathematical idealization for the three-stage Clos networks.
Authors (2)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- Recent Advances on System, Signal, Control, Communications and Computers strony 51 - 54
- Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Obszarski P., Kubale M.: A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks// Recent Advances on System, Signal, Control, Communications and Computers/ Budapeszt: WSEAS Press, 2015, s.51-54
- Verified by:
- Gdańsk University of Technology
seen 104 times