A nonbacktracking matrix decomposition algorithm for routing on Clos networks

  title={A nonbacktracking matrix decomposition algorithm for routing on Clos networks},
  author={John D. Carpinelli and A. Yavuz Oruç},
  journal={IEEE Trans. Commun.},
A number of matrix decomposition schemes have been previously reported for routing on Clos switching networks. These schemes occasionally fail to find the right decomposition, unless backtracking is used. It is shown that a partition may occur during the decomposition process, and that this is the underlying reason these algorithms fail for some decompositions. A parallel algorithm which can recognize when a partition exists and set up the Clos network without backtracking is given. > 

Figures from this paper

A new decomposition algorithm for rearrangeable Clos interconnection networks

We give a new decomposition algorithm to route a rearrangeable three-stage Clos network in O(nr/sup 2/) time, which is faster than all existing decomposition algorithms. By performing a row-wise

Optmization Models for Routing in Switching Networks of Clos Type with many Stages

The models can be used as base for solution methods, such as heuristics for rerouting combined with Lagrangean relaxation, which can together give bounds on the optimal number of rearrangements needed.

A Markov decision problem in Clos switch networks

  • Xi-Ren Cao
  • Business
    Proceedings of 1995 34th IEEE Conference on Decision and Control
  • 1995
Formulates the dynamic internal blocking problem in a Clos switch network as a standard Markov decision problem. To this end, the authors introduce a connection matrix to represent the connection

A new evaluation criterion for Clos- and Benes-type rearrangeable switching networks

An extended comparison and a classification of the control algorithms for rearrangeable switching networks is tried and it is shown that the new criterion leads to a deep insight of the systems, necessary for a successful network design.

Parallel routing algorithms for nonblocking electronic and photonic switching networks

  • E. LuSi-Qing Zheng
  • Computer Science
    IEEE Transactions on Parallel and Distributed Systems
  • 2005
We study the connection capacity of a class of rearrangeable nonblocking (RNB) and strictly nonblocking (SNB) networks with/without crosstalk-free constraint, model their routing problems as weak or

A QoS switch scheduling algorithm based on recursive fair stochastic matrix decomposition

  • T. Szymanski
  • Computer Science
    2006 Workshop on High Performance Switching and Routing
  • 2006
A QoS switch scheduling algorithm with rate and delay guarantees is proposed, which applies to a classic input-buffered NxN crossbar switch without speedup and supports multicast traffic.

A low-jitter guaranteed-rate scheduling algorithm for packet-switched ip routers

  • T. Szymanski
  • Business, Computer Science
    IEEE Transactions on Communications
  • 2009
The proposed algorithm can be used to schedule Guaranteed-Rate traffic in packet-switched IP/MPLS networks, to provide near-optimal queueing delays and essentially-zero delay jitter along end-toend paths when playback buffers are employed.

A Low-Jitter Guaranteed-Rate Scheduling

The proposed algorithm can be used to schedule Guaranteed-Rate traffi ci n packet-switched IP/MPLS networks, to provide near-optimal queueing delays and essentially-zero delay jitter along end-to- end paths when playback buffers are employed.

Switch-setting algorithms for the optical N-gon prism switch

The optical N-gon prism switch is the simplest multi-layer architecture and a starting point for novel all-optical switching architectures. The N-gon prism switch is composed of parallel waveguides

Optical smart-pixel-based Clos crossbar switch.

The design of an optically interconnected Clos crossbar switch that uses three smart-pixel devices and shows that the current hybrid-SEED technology should support a 1024-channel Clos switch operating at 500 Mbits/s per channel if pixel power consumption can be reduced.



Novel algorithm for Clos-type networks

A new routing algorithm for controlling nonblocking Clos-type permutation networks is presented that uses a new method called scheduling, does not use iterations, and has execution time 0(Nr1/2) where N is the total number of ports, and r is the number of first-stage switches.

Control Algorithms for Rearrangeable Clos Networks

  • F. Hwang
  • Computer Science
    IEEE Trans. Commun.
  • 1983
It is shown that a recent edge coloring algorithm of Gabow can be used to obtain a control algorithm faster than any existing one.

Comment on 'Novel algorithm for Clos-type networks' (and reply)

Recently, a new conflict permutation resolving algorithm for Clos-type networks was developed, but the method for updating the counter matrix C in the algorithm cannot really reflect the actual number of the type of elements in each column of the specification matrix S after each repetition.

Comments on "Decomposition of Permutation Networks"

  • M. Kubale
  • Mathematics
    IEEE Trans. Computers
  • 1982
It is pointed out that the edge coloring approach results in the most efficient algorithms for the decomposition problem.

A Simple Algorithm for the Control of Rearrangeable Switching Networks

A simple algorithm for the control of rearrangeable switching networks \nu(n, n, r) is given. This algorithm makes it possible to compute the switch settings that implement a given Permutation. The

Decomposition of Permutation Networks

The problem of decomposing an arbitrary permutation of a large number of elements into a number of permutations of smaller numbers of elements has become important recently in rearrangeable switching

The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks

It is shown that a certain version of RSN's built by 2 × 2 matrices in all stages except in the center stage have properties that imply a routing procedure for base 2tRSN's based on the looping procedure.

A study of non-blocking switching networks

This paper describes a method of designing arrays of crosspoints for use in telephone switching systems in which it will always be possible to establish a connection from an idle inlet to an idle

A Permutation Network

The construction of a switching network capable of n-permutation of its input terminals to its output terminals is described and an algorithm is given for the setting of the binary cells in the network according to any specified permutation.

Structure et commande optimales de réseaux de connexion sans blocage

SommaireOn considère les structures optimales des réseaux de connexion sans blocage fonctionnant en régime de commutation ordinaire et en régime de commutation simultanée. On évalue asymptotiquement