Wyniki wyszukiwania dla: REARRANGEABLE NETWORK

• A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks

  Publikacja

  • P. Obszarski
  • M. Kubale

  - Rok 2015

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

• Rearrangeability in multicast Clos networks is NP-complete

  Publikacja

  • A. Jastrzębski
  • M. Kubale

  - Rok 2010

  Przestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...

  Pełny tekst do pobrania w serwisie zewnętrznym