Author:
Obszarski P.,Jastrzębski A.,Kubale M.
Abstract
AbstractIn 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.
Subject
Artificial Intelligence,Computer Networks and Communications,General Engineering,Information Systems,Atomic and Molecular Physics, and Optics
Reference12 articles.
1. On - stage clos networks with different nonblocking requirements on two types of calls;Fu;Comb Opt,2005
2. On colouring the nodes of a network Cambridge Philosophical Society;Brooks;Proc Math Phys Sci,1941
3. and Strictly nonblocking - stage Clos networks with some rearrangeable multicast capability;Hwang;IEEE Trans Commun,2002
4. A study of nonblocking switching networks;Clos;Bell Syst Tech J,1953
5. An extension of DHH - Erdos conjecture on cycle - plus - triangle graphs;Du;Taiwan J Math,2002